Publications related to Forward secrecy

Boosting OMD for Almost Free Authentication of Associated Data

Serge Vaudenay, Damian Vizár, Reza Reyhanitabar

We propose pure OMD (p-OMD) as a new variant of the Offset Merkle-Damgård (OMD) authenticated encryption scheme. Our new scheme inherits all desirable security features of OMD while having a more compact structure and providing higher efficiency. The origi ...

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

On the Key Schedule of Lightweight Block Ciphers

Serge Vaudenay, Jialin Huang

Key schedules in lightweight block ciphers are often highly simplified, which causes weakness that can be exploited in many attacks. Today it remains an open problem on how to use limited operations to guarantee enough diffusion of key bits in lightweight ...

Springer-Verlag Berlin2014

Revisiting Iterated Attacks in the Context of Decorrelation Theory

Serge Vaudenay, Atefeh Mashatan, Asli Bay

Iterated attacks are comprised of iterating adversaries who can make d plaintext queries, in each iteration to compute a bit, and are trying to distinguish between a random cipher C and the perfect cipher C* based on all bits. Vaudenay showed that a 2d-dec ...

2014

Exploiting Common Randomness: a Resource for Network Secrecy

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

We investigate the problem of secure communication in a simple network with three communicating parties, two distributed sources who communicate over orthogonal channels to one destination node. The cooperation between the sources is restricted to a rate l ...

2013

Exploiting Common Randomness: a Resource for Network Secrecy

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

Ieee2013

Scalable and Secure Polling in Dynamic Distributed Networks

Rachid Guerraoui, Anne-Marie Kermarrec, Hamza Harkous, Florian Huc

We consider the problem of securely conducting a poll in synchronous dynamic networks equipped with a Public Key Infrastructure (PKI). Whereas previous distributed solutions had a communication cost of O(n^2) in an n nodes system, we present SPP (Secure an ...

2012

Mafia Fraud Attack against the RC Distance-Bounding Protocol

Serge Vaudenay, Aikaterini Mitrokotsa

At ACM~CCS 2008, Rasmussen and Capkun introduced a distance-bounding protocol RC07 (henceforth RC protocol) where the prover and verifier use simultaneous transmissions and the verifier counts the delay between sending a challenge (starting with a hidden m ...

IEEE2012

Beyond Bits: Reconstructing Images from Local Binary Descriptors

Pierre Vandergheynst, Alexandre Massoud Alahi, Emmanuel D'Angelo

Local Binary Descriptors (LBDs) are good at matching image parts, but how much information is actually carried? Surprisingly, this question is usually ignored and replaced by a comparison of matching performances. In this paper, we directly address it by t ...

2012

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.

Forward secrecy

Boosting OMD for Almost Free Authentication of Associated Data

Secure Wireless Communications via Cooperative Transmitting

On the Key Schedule of Lightweight Block Ciphers

Revisiting Iterated Attacks in the Context of Decorrelation Theory

Exploiting Common Randomness: a Resource for Network Secrecy

Exploiting Common Randomness: a Resource for Network Secrecy

Scalable and Secure Polling in Dynamic Distributed Networks

Mafia Fraud Attack against the RC Distance-Bounding Protocol

Security and Privacy in RFID Systems

Beyond Bits: Reconstructing Images from Local Binary Descriptors

Graph Chatbot

Chat with Graph Search

Secure Wireless Communications via Cooperative Transmitting

Revisiting Iterated Attacks in the Context of Decorrelation Theory

Boosting OMD for Almost Free Authentication of Associated Data

Mafia Fraud Attack against the RC Distance-Bounding Protocol

Beyond Bits: Reconstructing Images from Local Binary Descriptors

Security and Privacy in RFID Systems

Exploiting Common Randomness: a Resource for Network Secrecy

Exploiting Common Randomness: a Resource for Network Secrecy

Scalable and Secure Polling in Dynamic Distributed Networks

On the Key Schedule of Lightweight Block Ciphers