Publication

Secure communications over insecure channels based on short authenticated strings

Related publications (67)

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.

OREN: Optimal Revocations in Ephemeral Networks

Jean-Pierre Hubaux, Maxime Raya, Igor Bilogrevic

Public-key certificates allow a multitude of entities to securely exchange and verify the authenticity of data. However, the ability to effectively revoke compromised or untrustworthy certificates is of great importance when coping with misbehavior. In thi ...

2011

Fast Key Recovery Attack on ARMADILLO1 and Variants

Serge Vaudenay, Pouyan Sepehrdad, Petr Susil

The ARMADILLO cryptographic primitive is a multi-purpose cryptographic primitive for RFID devices proposed at CHES’10. The main purpose of the primitive is to provide a secure authentication in a challenge-response protocol. It has two versions, named ARMA ...

Springer2011

Erased Secrets: Practical Information-Theoretic Group Secrecy

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani, Uday Kiran Pulleti

We consider the scenario where a group of wireless nodes want to exchange a secret key, such that no eavesdropper can guess the key. Today, this can be achieved using publickey cryptography, e.g., the Diffie-Hellman or the RSA keyexchange algorithms. Howev ...

2010

Optimal Revocations in Ephemeral Networks: A Game-Theoretic Framework

Jean-Pierre Hubaux, Maxime Raya, Igor Bilogrevic

Revocation of public-key certificates is an important security primitive. In this paper, we design a fully distributed local certificate revocation scheme for ephemeral networks - a class of extremely volatile wireless networks with short-duration and shor ...

IEEE2010

A mean field model of work stealing in large-scale systems

Nicolas Gabriel Gast

In this paper, we consider a generic model of computational grids, seen as several clusters of homogeneous processors. In such systems, a key issue when designing ecient job allocation policies is to balance the workload over the dierent resources. We pres ...

ACM Press2010

Secure communication using authenticated channels

Sylvain Pasini

Our main motivation is to design more user-friendly security protocols. Indeed, if the use of the protocol is tedious, most users will not behave correctly and, consequently, security issues occur. An example is the actual behavior of a user in front of an ...

EPFL2009

User-Aided Data Authentication

Sylvain Pasini

All classical authentication protocols are based on pre-shared authentic information such as long-term secret keys or a public key infrastructure. However, there are many practical settings, where participants can additionally employ authentic Out-Of-Band ...

2009

Revocation Games in Ephemeral Networks

Igor Bilogrevic

An ephemeral network is usually defined by the very short-lived and heterogeneous nature of interactions among self-organizing wireless devices. The wide penetration in everyday gadgets of radio technologies operating in unlicensed frequency spectrum, such ...

2009

SAS-Based Group Authentication and Key Agreement Protocols

Sylvain Pasini

New trends in consumer electronics have created a strong demand for fast, reliable and user-friendly key agreement protocols. However, many key agreement protocols are secure only against passive attacks. Therefore, message authentication is often unavoida ...

Springer2008

Mutual Authentication in RFID: Security and Privacy

Serge Vaudenay, Radu-Ioan Paise

In RFID protocols, tags identify and authenticate themselves to readers. At Asiacrypt 2007, Vaudenay studied security and privacy models for these protocols. We extend this model to protocols which offer reader authentication to tags. Whenever corruption i ...

ACM Press2008