EUROCRYPT
2007
Springer
13 years 10 months ago
2007
Springer
Among the three broad classes of Identity-Based Encryption schemes built from pairings, the exponent inversion paradigm tends to be the most efficient, but also the least extensibl...
EUROCRYPT
2007
Springer
13 years 10 months ago
2007
Springer
sion of an extended abstract to be published in Advances in Cryptology—EUROCRYPT 2007, Springer-Verlag, 2007. Available online from the IACR Cryptology ePrint Archive as Report 2...
EUROCRYPT
2007
Springer
13 years 10 months ago
2007
Springer
EUROCRYPT
2007
Springer
13 years 10 months ago
2007
Springer
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...
EUROCRYPT
2007
Springer
13 years 10 months ago
2007
Springer
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....
EUROCRYPT
2007
Springer
13 years 10 months ago
2007
Springer
EUROCRYPT
2007
Springer
13 years 10 months ago
2007
Springer
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...
EUROCRYPT
2007
Springer
13 years 10 months ago
2007
Springer
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...
EUROCRYPT
2007
Springer
13 years 10 months ago
2007
Springer
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 ...
EUROCRYPT
2007
Springer
13 years 10 months ago
2007
Springer