Publications related to RC4 | EPFL Graph Search

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

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

Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits

Sebastian Faust

Non-malleable codes, defined by Dziembowski, Pietrzak and Wichs (ICS ’10), provide roughly the following guarantee: if a codeword c encoding some message x is tampered to c' = f(c) such that c c, then the tampered message x contained in c reveals no inf ...

Springer2014

Smashing WEP in A Passive Attack

Serge Vaudenay, Martin Vuagnoux, Pouyan Sepehrdad, Petr Susil

In this paper, we report extremely fast and optimised active and passive attacks against the old IEEE 802.11 wireless communication protocol WEP. This was achieved through a huge amount of theoretical and experimental analysis (capturing WiFi packets), ref ...

2013

Proactively Accountable Anonymous Messaging in Verdict

Bryan Alexander Ford, Henry Nathaniel Corrigan-Gibbs

Among anonymity systems, DC-nets have long held attraction for their resistance to traffic analysis attacks, but practical implementations remain vulnerable to internal disruption or “jamming” attacks, which require time-consuming detection procedures to r ...

2013

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

Statistical and Algebraic Cryptanalysis of Lightweight and Ultra-Lightweight Symmetric Primitives

Pouyan Sepehrdad

Symmetric cryptographic primitives such as block and stream ciphers are the building blocks in many cryptographic protocols. Having such blocks which provide provable security against various types of attacks is often hard. On the other hand, if possible, ...

EPFL2012

Resistance against Adaptive Plaintext-Ciphertext Iterated Distinguishers

Serge Vaudenay, Atefeh Mashatan, Asli Bay

Decorrelation Theory deals with general adversaries who are mounting iterated attacks, i.e., attacks in which an adversary is allowed to make d queries in each iteration with the aim of distinguishing a random cipher C from the ideal random cipher C^*. A b ...

2012

Resistance Against Iterated Attacks by Decorrelation Revisited

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 ideal random cipher

C^*

based on all bits. In EUROCRYPT '99, ...

Springer2012

Design and Analysis of Multi-Block-Length Hash Functions

Onur Özen

Cryptographic hash functions are used in many cryptographic applications, and the design of provably secure hash functions (relative to various security notions) is an active area of research. Most of the currently existing hash functions use the Merkle-Da ...

EPFL2012

RC4

Graph Chatbot

Chat with Graph Search

Misuse-Resistant Variants of the OMD Authenticated Encryption Mode

On the Key Schedule of Lightweight Block Ciphers

Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits

Smashing WEP in A Passive Attack

Proactively Accountable Anonymous Messaging in Verdict

Mafia Fraud Attack against the RC Distance-Bounding Protocol

Statistical and Algebraic Cryptanalysis of Lightweight and Ultra-Lightweight Symmetric Primitives

Resistance against Adaptive Plaintext-Ciphertext Iterated Distinguishers

Resistance Against Iterated Attacks by Decorrelation Revisited

Design and Analysis of Multi-Block-Length Hash Functions

Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits

On the Key Schedule of Lightweight Block Ciphers

Mafia Fraud Attack against the RC Distance-Bounding Protocol

Resistance against Adaptive Plaintext-Ciphertext Iterated Distinguishers

Resistance Against Iterated Attacks by Decorrelation Revisited

Design and Analysis of Multi-Block-Length Hash Functions

Statistical and Algebraic Cryptanalysis of Lightweight and Ultra-Lightweight Symmetric Primitives

Smashing WEP in A Passive Attack

Misuse-Resistant Variants of the OMD Authenticated Encryption Mode

Proactively Accountable Anonymous Messaging in Verdict