Publications related to Creating Shared Secrets out of Thin Air

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.

Optimal Proximity Proofs Revisited

Serge Vaudenay, Handan Kilinç Alper

Distance bounding protocols become important since wireless technologies become more and more common. Therefore, the security of the distance bounding protocol should be carefully analyzed. However, most of the protocols are not secure or their security is ...

Springer Verlag2015

Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance

Damian Vizár, Reza Reyhanitabar

A definition of online authenticated-encryption (OAE), call it OAE1, was given by Fleischmann, Forler, and Lucks (2012). It has become a popular definitional target because, despite allowing encryption to be online, security is supposed to be maintained ev ...

Springer2015

Secure Wireless Communications via Cooperative Transmitting

Ninoslav Marina

Information-theoretic secrecy is combined with cryptographic secrecy to create a secret-key exchange protocol for wireless networks. A network of transmitters, which already have cryptographically secured channels between them, cooperate to exchange a secr ...

Hindawi Publishing Corporation2014

Topology Optimization For Energy-Efficient Communications In Consensus Wireless Networks

Martin Vetterli, Benjamin Bejar Haro

Over the past years there has been an increasing interest in developing distributed computation methods over wireless networks. A new communication paradigm has emerged where distributed algorithms such as consensus have played a key role in the developmen ...

IEEE2014

Triangle Network Secrecy

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

We characterize the secret message capacity of the triangle network, that consists of a source, a relay and a destination connected through orthogonal erasure channels. A passive eavesdropper, Eve, wiretaps any one of the three channels. The source and the ...

2014

Triangle Network Secrecy

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

Ieee2014

Misuse-Resistant Variants of the OMD Authenticated Encryption Mode

Serge Vaudenay, Damian Vizár, Reza Reyhanitabar

We present two variants of OMD which are robust against nonce misuse. Security of OMD---a CAESAR candidate---relies on the assumption that implementations always ensure correct use of nonce (a.k.a. message number); namely that, the nonce never gets repeate ...

Springer-Verlag Berlin2014

Creating Secrets out of Erasures

Christina Fragouli, Suhas Diggavi, Panagiotis Kostopoulos

Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary ca ...

2013

Exchanging Pairwise Secrets Efficiently

Christina Fragouli, Suhas Diggavi, Iris Safaka

We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot ...

Institute of Electrical and Electronics Engineers Inc.2013

Creating Shared Secrets out of Thin Air

Graph Chatbot

Chat with Graph Search

Optimal Proximity Proofs Revisited

Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance

Secure Wireless Communications via Cooperative Transmitting

Probing the network. Architecturality of Wireless Infrastructure

Topology Optimization For Energy-Efficient Communications In Consensus Wireless Networks

Triangle Network Secrecy

Triangle Network Secrecy

Misuse-Resistant Variants of the OMD Authenticated Encryption Mode

Creating Secrets out of Erasures

Exchanging Pairwise Secrets Efficiently

Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance

Triangle Network Secrecy

Topology Optimization For Energy-Efficient Communications In Consensus Wireless Networks

Optimal Proximity Proofs Revisited

Triangle Network Secrecy

Secure Wireless Communications via Cooperative Transmitting

Probing the network. Architecturality of Wireless Infrastructure

Creating Secrets out of Erasures

Misuse-Resistant Variants of the OMD Authenticated Encryption Mode

Exchanging Pairwise Secrets Efficiently