Concept

One-time pad

Related publications (48)

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.

Broadcasting Private Messages Securely

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

Consider a source, Alice, broadcasting private messages to multiple receivers through a broadcast erasure channel; users send back to Alice public feedback that she causally uses to decide the coding strategy for her following transmissions. Recently, the ...

IEEE2012

On Hiding a Plaintext Length by Preencryption

Serge Vaudenay, Cihangir Tezcan

It is a well known fact that encryption schemes can not hide a plaintext length when it is unbounded. We thus admit that an approximation of it may leak and we focus on hiding its precise value. Some standards such as TLS or SSH offer to do it by applying ...

Springer2011

A First Step Towards Automatic Application of Power Analysis Countermeasures

Paolo Ienne, Francesco Regazzoni, Philip Brisk, Ali Galip Bayrak

In cryptography, side channel attacks, such as power analysis, attempt to uncover secret information from the physical implementation of cryptosystems rather than exploiting weaknesses in the cryptographic algorithms themselves. The design and implementati ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

Scalable and Secure Aggregation in Distributed Networks

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

We consider the problem of computing an aggregation function in a \emph{secure} and \emph{scalable} way. Whereas previous distributed solutions with similar security guarantees have a communication cost of

O(n^3)

, we present a distributed protocol that r ...

CoRR2011

Characterization of the secrecy region of a single relay cooperative system

Ninoslav Marina

Security is an important aspect for the future wire- less networks. Since the number of network nodes increases con- stantly, and, in addition, the networks are decentralized and ad- hoc in nature, it becomes more challenging to apply the current cryptogra ...

2010

Discovery and Exploitation of New Biases in RC4

Serge Vaudenay, Martin Vuagnoux, Pouyan Sepehrdad

In this paper, we present several weaknesses in the stream cipher RC4. First, we present a technique to automatically reveal linear correlations in the PRGA of RC4. With this method, 48 new exploitable correlations have been discovered. Then we bind these ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

On the Impossibility of Strong Encryption over \aleph_{0}

Serge Vaudenay

We give two impossibility results regarding strong encryption over an infinite enumerable domain. The first one relates to statistically secure one-time encryption. The second one relates to computationally secure encryption resisting adaptive chosen ciphe ...

Springer Berlin / Heidelberg2009

Quantitative security of block ciphers

Thomas Baignères

Block ciphers probably figure in the list of the most important cryptographic primitives. Although they are used for many different purposes, their essential goal is to ensure confidentiality. This thesis is concerned by their quantitative security, that i ...

EPFL2008

Cryptanalysis of e-mail protocols providing perfect forward secrecy

Recently, two e-mail protocols were proposed claiming to provide perfect secrecy. These protocols use authentication and (Diffie-Hellman) key-exchange techniques, and as such, other standard security criteria besides perfect forward secrecy include key-rep ...

2008

Secrecy for bounded security protocols with freshness check is NEXPTIME-complete

The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bounded protocols with freshness check is shown to be NEXPTIME-complete. Relating ...

2008

Scalable and Secure Aggregation in Distributed Networks

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

O(n^3)

, we present a distributed protocol that r ...

CoRR2011