Publication

On Selecting the Nonce Length in Distance-Bounding Protocols

Related publications (51)

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.

Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

Sebastian Faust

Related key attacks (RKAs) are powerful cryptanalytic attacks where an adversary can change the secret key and observe the effect of such changes at the output. The state of the art in RKA security protects against an a-priori unbounded number of certain a ...

2013

Primeless Factoring-Based Cryptography

Serge Vaudenay, Sonia Mihaela Bogos

Factoring-based public-key cryptosystems have an overall complexity which is dominated by the key-production algorithm, which requires the generation of prime numbers. This is most inconvenient in settings where the key-generation is not an one-off process ...

2013

Security and Privacy in RFID Systems

Khaled Ouafi

This PhD thesis is concerned with authentication protocols using portable lightweight devices such as RFID tags. these devices have lately gained a significant attention for the diversity of the applications that could benefit form their features, ranging ...

EPFL2012

Creating Shared Secrets out of Thin Air

Christina Fragouli, Suhas Diggavi, Iris Safaka

Current security systems typically rely on the adversary's computational limitations (e.g., the fact that it cannot invert a hash function or perform large-integer factorization). Wireless networks offer the opportunity for a different, complementary kind ...

Assoc Computing Machinery2012

Multi-terminal Secrecy in a Linear Non-coherent Packetized Networks

Christina Fragouli, Mahdi Jafari Siavoshani

We consider a group of m+1 trusted nodes that aim to create a shared secret key K over a network in the presence of a passive eavesdropper, Eve. We assume a linear non-coherent network coding broadcast channel (over a finite field F_q ) from one of the hon ...

2012

Multi-terminal Secrecy in a Linear Non-coherent Packetized Networks

Christina Fragouli, Mahdi Jafari Siavoshani

2012

Unconditionally-Secure Robust Secret Sharing with Compact Shares

Alfonso Bolívar Cevallos Manzano

We consider the problem of reconstructing a shared secret in the presence of faulty shares, with unconditional security. We require that any t shares give no information on the shared secret, and reconstruction is possible even if up to t out of the n shar ...

Springer-Verlag2012

A Mobile World of Security

Christine Neuberg

Security in mobile communications is a topic of increasing relevance in everyday life. We all use mobile devices for everyday communications, maybe even for exchanging confidential information with the work place. This requires security systems that are re ...

EPFL2011

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

Group secret key agreement over state-dependent wireless broadcast channels

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani

We consider a group of m trusted nodes that aim to create a shared secret key K, using a state-dependent wireless broadcast channel that exists from one of the honest nodes to the rest of the nodes including a passive eavesdropper Eve. All of the trusted n ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011