EUROCRYPT
2006
Springer
14 years 7 days ago
2006
Springer
We present an Identity Based Encryption (IBE) system that is fully secure in the standard model and has several advantages over previous such systems
EUROCRYPT
2006
Springer
14 years 7 days ago
2006
Springer
In this work we provide efficient distributed protocols for generating shares of random noise, secure against malicious participants. The purpose of the noise generation is to crea...
EUROCRYPT
2006
Springer
14 years 7 days ago
2006
Springer
NTRU is a very efficient public-key cryptosystem based on polynomial arithmetic. Its security is related to the hardness of lattice problems in a very special class of lattices. Th...
EUROCRYPT
2006
Springer
14 years 7 days ago
2006
Springer
In this paper we examine the security criteria for a KEM and a DEM that are sufficient for the overall hybrid encryption scheme to be plaintext-aware in the standard model. We appl...
EUROCRYPT
2006
Springer
14 years 7 days ago
2006
Springer
The standard security definition of unconditional secure function evaluation, which is based on the ideal/real model paradigm, has the disadvantage of being overly complicated to w...
EUROCRYPT
2006
Springer
14 years 7 days ago
2006
Springer
Abstract. We present an asymptotically optimal reduction of one-outof-two String Oblivious Transfer to one-out-of-two Bit Oblivious Transfer using Interactive Hashing in conjunctio...
EUROCRYPT
2006
Springer
14 years 7 days ago
2006
Springer
Abstract. We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of ver...
EUROCRYPT
2006
Springer
14 years 7 days ago
2006
Springer
Let g be an element of prime order p in an abelian group and Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, we can compute the secret in O(log p
EUROCRYPT
2006
Springer
14 years 7 days ago
2006
Springer
Motivated by the representation of biometric and multimedia objects, we consider the problem of hiding noisy point-sets using a secure sketch. A point-set X consists of s points fr...
EUROCRYPT
2006
Springer
14 years 7 days ago
2006
Springer
We present the first efficient group signature scheme that is provably secure without random oracles. We achieve this result by combining provably secure hierarchical signatures i...