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.

Weariness and Loyalty Loss in Recurrent Service Models

Max-Olivier Hongler, Olivier Gallay

For recurrent service providers (fast-food, entertainment, medical care,...), retaining loyal customers is obviously a key issue. The customers' loyalty essentially depends on their service satisfaction defined via an ad-hoc utility function. Among several ...

2008

Local deformation models for monocular 3D shape recovery

Pascal Fua, Mathieu Salzmann, Raquel Urtasun

Without a deformation model, monocular 3D shape recovery of deformable surfaces is severly under-constrained. Even when the image information is rich enough, prior knowledge of the feasible deformations is required to overcome the ambiguities. This is furt ...

2008

Secure Communication Over Radio Channels

Rachid Guerraoui, Seth Gilbert

We study the problem of secure communication in a multi-channel, single-hop radio network with a malicious adversary that can cause collisions and spoof messages. We assume no pre-shared secrets or trusted-third-party infrastructure. The main contribution ...

2008

Privacy of Recent RFID Authentication Protocols

Khaled Ouafi

Privacy is a major concern in RFID systems, especially with widespread deployment of wireless-enabled interconnected personal devices e.g. PDAs and mobile phones, credit cards, e-passports, even clothing and tires. An RFID authentication protocol should no ...

Springer2008

Cryptanalysis of the Sidelnikov cryptosystem

Mohammad Amin Shokrollahi, Lorenz Minder

We present a structural attack against the Sidelnikov cryptosystem. The attack creats a private key from a give public key. Its running time is subexponential and it is effective if the parameters of the Reed-Muller code allow for efficient sampling of min ...

Springer Verlag2007

Real-time freeway traffic state estimation based on extended Kalman filter: A case study

This paper presents a case study of real-time traffic state estimation. The adopted general approach to the design of universal traffic state estimators for freeway stretches is based on stochastic macroscopic traffic flow modeling and extended Kalman filt ...

INFORMS2007

Chosen-prefix collisions for MD5 and colliding X.509 certificates for different identities

Arjen Lenstra

We present a novel, automated way to find differential paths for MD5. As an application we have shown how, at an approximate expected cost of 2 50 calls to the MD5 compression function, for any two chosen message prefixes P and P′, suffixe ...

2007

Integrity (I) codes: Message Integrity Protection and Authentication over Insecure Channels

Jean-Pierre Hubaux, Mario Cagalj, Srdan Capkun

Inspired by unidirectional error detecting codes that are used in situations where only one kind of bit errors are possible (e.g., it is possible to change a bit “0” into a bit “1”, but not the contrary), we propose integrity codes (I-codes) for a radio co ...

2006

Key Agreement in Peer-to-Peer Wireless Networks

Jean-Pierre Hubaux, Mario Cagalj, Srdan Capkun

We present a set of simple techniques for key establishment over a radio link in peer-to-peer networks. Our approach is based on the Diffie-Hellman key agreement protocol, which is known to be vulnerable to the ``man-in-the-middle" attack if the two users ...

2006

Thwarting selfish and malicious behavior in wireless networks

Mario Cagalj

Security is at the core of any communication system and, in particular, of wireless (radio) networks. In this thesis, we focus on three important security aspects in the framework of wireless networks: selfish (noncooperative) behavior at the Medium Access ...

EPFL2006