Sciweavers

EUROCRYPT
2007
Springer
14 years 1 months ago
Cryptanalysis of the Sidelnikov Cryptosystem
We present a structural attack against the Sidelnikov cryptosystem [8]. The attack creates a private key from a given public key. Its running time is subexponential and is effecti...
Lorenz Minder, Amin Shokrollahi
EUROCRYPT
2007
Springer
14 years 1 months ago
Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....
Chun-Yuan Hsiao, Chi-Jen Lu, Leonid Reyzin
EUROCRYPT
2007
Springer
14 years 1 months ago
Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities
Marc Stevens, Arjen K. Lenstra, Benne de Weger
EUROCRYPT
2007
Springer
14 years 1 months ago
Zero Knowledge and Soundness Are Symmetric
We give a complexity-theoretic characterization of the class of problems in NP having zero-knowledge argument systems. This characterization is symmetric in its treatment of the ze...
Shien Jin Ong, Salil P. Vadhan
EUROCRYPT
2007
Springer
14 years 1 months ago
The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks
Abstract. Multiparty signature protocols need protection against roguekey attacks, made possible whenever an adversary can choose its public key(s) arbitrarily. For many schemes, p...
Thomas Ristenpart, Scott Yilek
EUROCRYPT
2007
Springer
14 years 1 months ago
Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don't Exist
A (k, )-robust combiner for collision-resistant hash-functions is a construction which from hash-functions constructs a hash-function which is collision-resistant if at least k of ...
Krzysztof Pietrzak
EUROCRYPT
2007
Springer
14 years 1 months ago
Ideal Multipartite Secret Sharing Schemes
Oriol Farràs, Jaume Martí-Farr&eacut...
EUROCRYPT
2007
Springer
14 years 1 months ago
Feistel Networks Made Public, and Applications
Feistel Network, consisting of a repeated application of the Feistel Transform, gives a very convenient and popular method for designing “cryptographically strong” permutations...
Yevgeniy Dodis, Prashant Puniya
EUROCRYPT
2007
Springer
14 years 1 months ago
Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit
Significant progress in the design of special purpose hardware for supporting the Number Field Sieve (NFS) has been made. From a practical cryptanalytic point of view, however, no...
Willi Geiselmann, Rainer Steinwandt
EUROCRYPT
2007
Springer
14 years 1 months ago
Atomic Secure Multi-party Multiplication with Low Communication
We consider the standard secure multi-party multiplication protocol due to M. Rabin. This protocol is based on Shamir’s secret sharing scheme and it can be viewed as a practical ...
Ronald Cramer, Ivan Damgård, Robbert de Haan