Publication

On the (Im)possibility of Commitment over Gaussian Unfair Noisy Channels

Publications associées (43)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

On Bisimulations for the Spi Calculus

Johannes Borgström

The spi calculus is an extension of the pi calculus with cryptographic primitives, designed for the verification of cryptographic protocols. Due to the extension, the naive adaptation of labeled bisimulations for the pi calculus is too strong to be useful ...

2004

Mobility Helps Peer-to-Peer Security

Jean-Pierre Hubaux, Levente Buttyan, Srdan Capkun

We propose a straightforward technique to provide peer-to-peer security in mobile networks. We show that far from being a hurdle, mobility can be exploited to set up security associations among users. We leverage on the temporary vicinity of users, during ...

2003

On Bisimulations for the Spi Calculus

Johannes Borgström

2003

High performance VLSI architectures implementing strong cryptographic primitives

Feth Allah Cherigui

The main topic of this thesis is related to the state of the art in designing cryptographic primitives from a hardware point of view. A special emphasis is dedicated to low-power/low-energy CMOS design. A set of solutions is proposed including an LFSR base ...

EPFL2002

On solving distributed CS(O)Ps with privacy

Cryptographic protocols can enforce privacy in distributed computation of functions [Goldwasser'96] and are a competitor of the distributed constructive search techniques. [Goldreich'87,Chaum'87,Chaum'88,Ben-or'88] show how cryptographic protocols can be c ...

2002

A feedback strategy for binary symmetric channels

Emre Telatar, Aslan Tchamkerten

Communication over unknown binary symmetric channels with instantaneous and perfect feedback is considered. We describe a universal scheme based on a decision feedback strategy. ...

2002

A feedback strategy for binary symmetric channels

Emre Telatar, Aslan Tchamkerten

Communication over unknown binary symmetric channels with instantaneous and perfect feedback is considered. We describe a universal scheme based on a decision feedback strategy. ...

2002

Ergodic chaos shift keying for 2 users

Martin Hasler, Thomas Schimming

We show how a multiuser chaos-based communication system can be designed. The approach builds on the recently introduced method of ergodic chaos shift keying. This method uses a nonlinear correlation estimator for extracting the binary information from the ...

2001

Extensions to an Authentication Technique Proposed for the Global Mobility Network

Levente Buttyan, Uwe Wilhelm

We present three attacks against the authentication protocol that has been proposed for the so called global mobility network in \cite{kn:Suz97}. We show that the attacks are feasible and propose corrections that make the protocol more robust and resistant ...

2000

Formal methods in the design of cryptographic protocols (state of the art)

Levente Buttyan

This paper is a state of the art review of the use of formal methods in the design of cryptographic protocols. ...

1999