Publication

Optimal Symmetric Ratcheting for Secure Communication

Related publications (85)

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.

Matryoshka: Hiding Secret Communication in Plain Sight

Christina Fragouli, Iris Safaka

We want to enable a pair of communicating users to exchange secret messages while hiding the fact that secret communication is taking place. We propose a linguistic steganography approach, where each human message is hidden in another human-like message. A ...

2016

Metadata Protection Considerations for TLS Present and Future

Bryan Alexander Ford

TLS 1.3 takes important steps to improve both performance and security, so far offers little protection against traffic analysis or fingerprinting using unencrypted metadata or other side-channels such as transmission lengths and timings. This paper explor ...

2016

Privacy-Preserving Photo Sharing based on a Public Key Infrastructure

Touradj Ebrahimi, Lin Yuan, David Mc Nally

A significant number of pictures are posted to social media sites or exchanged through instant messaging and cloud-based sharing services. Most social media services offer a range of access control mechanisms to protect users privacy. As it is not in the b ...

Spie-Int Soc Optical Engineering2015

Algebraic Cryptanalysis of Deterministic Symmetric Encryption

Petr Susil

Deterministic symmetric encryption is widely used in many cryptographic applications. The security of deterministic block and stream ciphers is evaluated using cryptanalysis. Cryptanalysis is divided into two main categories: statistical cryptanalysis and ...

EPFL2015

Secret Communication Over Broadcast Erasure Channels With State-Feedback

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

We consider a 1-to-K communication scenario, where a source transmits private messages to K receivers through a broadcast erasure channel, and the receivers feedback strictly, causally, and publicly their channel states after each transmission. We explore ...

Ieee-Inst Electrical Electronics Engineers Inc2015

GenoGuard: Protecting Genomic Data Against Brute-Force Attacks

Jean-Pierre Hubaux, Jacques Fellay, Erman Ayday, Zhicong Huang, Ari Juels

Secure storage of genomic data is of great and increasing importance. The scientific community's improving ability to interpret individuals' genetic materials and the growing size of genetic database populations have been aggravating the potential conseque ...

2015

Private and Secure Public-Key Distance Bounding: Application to NFC Payment

Serge Vaudenay

Distance-Bounding is used to defeat relay attacks. For wireless payment systems, the payment terminal is not always online. So, the protocol must rely on a public key for the prover (payer). We propose a generic transformation of a (weakly secure) symmetri ...

Springer2015

Seeking Anonymity in an Internet Panopticon

Bryan Alexander Ford

Internet, users often need to assume, by default, that their every statement or action online is monitored and tracked. The Dissent project at Yale University takes a collective approach to online anonymity, based on different algorithmic foundations from ...

Assoc Computing Machinery2015

Secure Communication in Erasure Networks with State-feedback

László Czap

The security and efficiency of communication are two of the main concerns for networks of today and the future. Our understanding of how to efficiently send information over various channels and networks has significantly increased in the past decade (see ...

EPFL2014

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