Sciweavers

ASIACRYPT
2005
Springer
14 years 5 months ago
Fast Computation of Large Distributions and Its Cryptographic Applications
Let X1, X2, . . . , Xk be independent n bit random variables. If they have arbitrary distributions, we show how to compute distributions like Pr{X1 ⊕ X2 ⊕ · · · ⊕ Xk} and ...
Alexander Maximov, Thomas Johansson
ASIACRYPT
2005
Springer
14 years 5 months ago
A Practical Attack on the Fixed RC4 in the WEP Mode
In this paper we revisit a known but ignored weakness of the RC4 keystream generator, where secret state info leaks to the generated keystream, and show that this leakage, also kno...
Itsik Mantin
ASIACRYPT
2005
Springer
14 years 5 months ago
A Failure-Friendly Design Principle for Hash Functions
Abstract. This paper reconsiders the established Merkle-Damg˚ard design principle for iterated hash functions. The internal state size w of an iterated n-bit hash function is trea...
Stefan Lucks
ASIACRYPT
2005
Springer
14 years 5 months ago
Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
Abstract We provide evidence that the unforgeability of several discrete-log based signatures like Schnorr signatures cannot be equivalent to the discrete log problem in the standa...
Pascal Paillier, Damien Vergnaud
ASIACRYPT
2005
Springer
14 years 5 months ago
Updatable Zero-Knowledge Databases
Moses Liskov
ASIACRYPT
2005
Springer
14 years 5 months ago
Adapting Density Attacks to Low-Weight Knapsacks
Cryptosystems based on the knapsack problem were among the first public-key systems to be invented. Their high encryption/decryption rate attracted considerable interest until it ...
Phong Q. Nguyen, Jacques Stern
ASIACRYPT
2005
Springer
14 years 5 months ago
Universally Convertible Directed Signatures
Many variants of Chaum and van Antwerpen’s undeniable signatures have been proposed to achieve specific properties desired in real-world applications of cryptography. Among them...
Fabien Laguillaumie, Pascal Paillier, Damien Vergn...
ASIACRYPT
2005
Springer
14 years 5 months ago
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
Martin Hirt, Jesper Buus Nielsen
ASIACRYPT
2005
Springer
14 years 5 months ago
Modular Security Proofs for Key Agreement Protocols
The security of key agreement protocols has traditionally been notoriously hard to establish. In this paper we present a modular approach to the construction of proofs of security ...
Caroline Kudla, Kenneth G. Paterson