EUROCRYPT
2001
Springer
13 years 9 months ago
2001
Springer
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...
EUROCRYPT
2001
Springer
13 years 9 months ago
2001
Springer
NTRU is a fast public key cryptosystem presented in 1996 by Hoffstein, Pipher and Silverman of Brown University. It operates in the ring of polynomials Z[X]/(XN − 1), where the ...
EUROCRYPT
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposureresilient functions. Both are concerned with...
EUROCRYPT
2001
Springer
13 years 9 months ago
2001
Springer
We propose a threshold RSA scheme which is as efficient as the fastest previous threshold RSA scheme (by Shoup), but where two assumptions needed in Shoup’s and in previous schem...
EUROCRYPT
2001
Springer
13 years 9 months ago
2001
Springer
At EuroCrypt’99, Paillier proposed a new encryption scheme based on higher residuosity classes. The new scheme was proven to be one-way under the assumption that computing N-resi...
EUROCRYPT
2001
Springer
13 years 9 months ago
2001
Springer
In this paper we show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealin...
EUROCRYPT
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We present a formalism for the analysis of key-exchange protocols that combines previous definitional approaches and results in a definition of security that enjoys som...
EUROCRYPT
2001
Springer
13 years 9 months ago
2001
Springer
EUROCRYPT
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We provide identi£cation protocols that are secure even when the adversary can reset the internal state and/or randomization source of the user identifying itself, and w...
EUROCRYPT
2001
Springer
13 years 9 months ago
2001
Springer
In this paper we consider the security of block ciphers which contain alternate layers of invertible S-boxes and affine mappings (there are many popular cryptosystems which use thi...