Publication

Building blocks for secure services

Related publications (111)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Key agreement over a radio link

Jean-Pierre Hubaux, Mario Cagalj

We present a simple, and yet powerful, technique for key establishment over a radio link in peer-to-peer networks. Our approach is based on the Diffie-Hellman key agreement protocol. This protocol is known to be vulnerable to the ``man-in-the-middle" attac ...

2004

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

Quantum Cryptography : On the Security of the BB84 Key-Exchange Protocol

Thomas Baignères

In 1984, C.H. Bennet and G. Brassard proposed a new protocol aimed to solve the problem of symmetric cryptographic key exchange. This protocol was called BB84 after the name of its authors. While a traditional method would rely on public key cryptography ( ...

2003

On Bisimulations for the Spi Calculus

Johannes Borgström

2003

Password interception in a SSL/TLS channel

Serge Vaudenay, Martin Vuagnoux

Simple password authentication is often used e.g. from an e-mail software application to a remote IMAP server. This is frequently done in a protected peer-to-peer tunnel, e.g. by SSL/TLS. At Eurocrypt'02, Vaudenay (2002) presented vulnerabilities in paddin ...

2003

Applying Fondue to Specify a Drink Vending Machine

Shane Sendall

The purpose of the paper is to present our approach for specifying system behavior during analysis, part of the Fondue software development method. The approach is exempli ed on a case study, a Drink Vending Machine (DVM). It is based on Operation Schemas ...

2003

Towards the Formal Integration of Two Upcoming Standards: IEC61970 and IEC61850

Otto Preiss, Christian Frei, Tatjana Kostic

AbstractThe constant demand for a better integration of utility applications and systems provokes the question on the compatibility of standards that were, and still are, developed for these individual utility disciplines. This paper discusses the need for ...

2003

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 Formal Analysis of Syverson`s Rational Exchange Protocol

Jean-Pierre Hubaux, Levente Buttyan, Srdan Capkun

In this paper, we provide a formal analysis of a rational exchange protocol proposed by Syverson. A rational exchange protocol guarantees that misbehavior cannot generate benefits, and is therefore discouraged. The analysis is performed using our formal mo ...

2002