Publication

A Formal Semantics For Protocol Narrations

Publications associées (58)

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

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 ...

2006

Short 2-Move Undeniable Signatures

Serge Vaudenay, Jean Monnerat

Attempting to reach a minimal number of moves in cryptographic protocols is a quite classical issue. Besides the theoretical interests, minimizing the number of moves can clearly facilitate practical implementations in environments with communication const ...

2006

Looking Ahead in Open Multithreaded Transactions

Maxime Monod

Open multithreaded transactions constitute building blocks that allow a developer to design and structure the execution of complex distributed systems featuring cooperative and competitive concurrency in a reliable way. In this paper we describe an optimiz ...

2006

A Formal Semantics For Protocol Narrations

Sébastien Briais

Protocol narrations are an informal means to describe, in an idealistic manner, the functioning of cryptographic protocols as a single intended sequence of cryptographic message exchanges among the protocol's participants. Protocol narrations have also bee ...

2005

Action Semantics in Smart Objects

Daniel Thalmann, Tolga Abaci, Jan Ciger

We present a method of formal description of the action semantics in smart objects. Smart objects were primarily used for behavioral animation in the past. We demonstrate, how a formally described semantics can be used for action planning purposes by intel ...

2005

On Bluetooth repairing: key agreement based on symmetric-key cryptography

Serge Vaudenay

Despite many good (secure) key agreement protocols based on public-key cryptography exist, secure associations between two wireless devices are often established using symmetric-key cryptography for cost reasons. The consequence is that common daily used s ...

2005

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

A Formal Model of Rational Exchange and Its Application to the Analysis of Syverson's Protocol

Jean-Pierre Hubaux, Levente Buttyan, Srdan Capkun

We propose a formal model of rational exchange and exchange protocols in general, which is based on game theory. In this model, an exchange protocol is represented as a set of strategies in a game that is played by the protocol parties and the network that ...

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

The Role of Tarski’s Declarative Semantics in the Design of Modeling Languages

Alain Wegmann, Andrey Naumenko

This paper focuses on Tarski

s declarative semantics and their usefulness in the design of a modeling language. We introduce the principles behind Tarski

s approach to semantics and explain what advantages this offers in the context of modeling languages. ...

2003