Sciweavers

ICISC
2008
126views Cryptology» more  ICISC 2008»
14 years 29 days ago
Essentially Optimal Universally Composable Oblivious Transfer
Oblivious transfer is one of the most important cryptographic primitives, both for theoretical and practical reasons and several protocols were proposed during the years. We provid...
Ivan Damgård, Jesper Buus Nielsen, Claudio O...
ICISC
2008
103views Cryptology» more  ICISC 2008»
14 years 29 days ago
Instruction Set Limitation in Support of Software Diversity
This paper proposes a novel technique, called instruction set limitation, to strengthen the resilience of software diversification against collusion attacks. Such attacks require a...
Bjorn De Sutter, Bertrand Anckaert, Jens Geiregat,...
ICISC
2008
146views Cryptology» more  ICISC 2008»
14 years 29 days ago
A New Technique for Multidimensional Linear Cryptanalysis with Applications on Reduced Round Serpent
Abstract. In this paper, we present a new technique for Matsui's algorithm 2 using multidimensional linear approximation. We show that the data complexity of the attack can be...
Joo Yeon Cho, Miia Hermelin, Kaisa Nyberg
FSE
2008
Springer
193views Cryptology» more  FSE 2008»
14 years 1 months ago
New Features of Latin Dances: Analysis of Salsa, ChaCha, and Rumba
The stream cipher Salsa20 was introduced by Bernstein in 2005 as a candidate in the eSTREAM project, accompanied by the reduced versions Salsa20/8 and Salsa20/12. ChaCha is a varia...
Jean-Philippe Aumasson, Simon Fischer 0002, Shahra...
FSE
2008
Springer
100views Cryptology» more  FSE 2008»
14 years 1 months ago
Bit-Pattern Based Integral Attack
Muhammad Reza Z'aba, Håvard Raddum, Matthew ...
FSE
2008
Springer
177views Cryptology» more  FSE 2008»
14 years 1 months ago
MD4 is Not One-Way
MD4 is a hash function introduced by Rivest in 1990. It is still used in some contexts, and the most commonly used hash function (MD5, SHA-1, SHA-2) are based on the design princip...
Gaëtan Leurent
FSE
2008
Springer
110views Cryptology» more  FSE 2008»
14 years 1 months ago
How to Encrypt with a Malicious Random Number Generator
Chosen-plaintext attacks on private-key encryption schemes are currently modeled by giving an adversary access to an oracle that encrypts a given message m using random coins that ...
Seny Kamara, Jonathan Katz
FSE
2008
Springer
130views Cryptology» more  FSE 2008»
14 years 1 months ago
Differential Fault Analysis of Trivium
Michal Hojsík, Bohuslav Rudolf
FSE
2008
Springer
101views Cryptology» more  FSE 2008»
14 years 1 months ago
Post-Processing Functions for a Biased Physical Random Number Generator
Abstract. A corrector is used to reduce or eliminate statistical weakness of a physical random number generator. A description of linear corrector generalizing post-processing desc...
Patrick Lacharme
FSE
2008
Springer
117views Cryptology» more  FSE 2008»
14 years 1 months ago
Efficient Reconstruction of RC4 Keys from Internal States
Abstract. In this paper we present an efficient algorithm for the retrieval of the RC4 secret key, given an internal state. This algorithm is several orders of magnitude faster tha...
Eli Biham, Yaniv Carmeli