EUROCRYPT
1999
Springer
14 years 4 months ago
1999
Springer
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have...
EUROCRYPT
1999
Springer
14 years 4 months ago
1999
Springer
In this paper we discuss various aspects of cryptosystems based on hyperelliptic curves. In particular we cover the implementation of the group law on such curves and how to genera...
EUROCRYPT
1999
Springer
14 years 4 months ago
1999
Springer
We examine the concurrent composition of zero-knowledge proofs. By concurrent composition, we indicate a single prover that is involved in multiple, simultaneous zero-knowledge pro...
EUROCRYPT
1999
Springer
14 years 4 months ago
1999
Springer
Since the Diffie-Hellman paper, asymmetric encryption has been a very important topic, and furthermore ever well studied. However, between the efficiency of RSA and the security of...
EUROCRYPT
1999
Springer
14 years 4 months ago
1999
Springer
EUROCRYPT
1999
Springer
14 years 4 months ago
1999
Springer
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
EUROCRYPT
1999
Springer
14 years 4 months ago
1999
Springer
A recoding rule for exponentiation is a method for reducing the cost of the exponentiation ae by reducing the number of required multiplications. If w(e) is the (hamming) weight of...
EUROCRYPT
1999
Springer
14 years 4 months ago
1999
Springer
Abstract. This paper compares the parameters sizes and software performance of several recent constructions for universal hash functions: bucket hashing, polynomial hashing, Toepli...
EUROCRYPT
1999
Springer
14 years 4 months ago
1999
Springer
Abstract. This work describes schemes for distributing between n servers the evaluation of a function f which is an approximation to a random function, such that only authorized su...
EUROCRYPT
1999
Springer
14 years 4 months ago
1999
Springer
Abstract. This paper addresses the discrete logarithm problem in elliptic curve cryptography. In particular, we generalize the Menezes, Okamoto, and Vanstone (MOV) reduction so tha...