Sciweavers

EUROCRYPT
2000
Springer
13 years 8 months ago
Efficient Receipt-Free Voting Based on Homomorphic Encryption
Voting schemes that provide receipt-freeness prevent voters from proving their cast vote, and hence thwart vote-buying and coercion. We analyze the security of the multi-authority ...
Martin Hirt, Kazue Sako
EUROCRYPT
2000
Springer
13 years 8 months ago
Cox-Rower Architecture for Fast Parallel Montgomery Multiplication
Abstract. This paper proposes a fast parallel Montgomery multiplication algorithm based on Residue Number Systems (RNS). It is easy to construct a fast modular exponentiation by ap...
Shin-ichi Kawamura, Masanobu Koike, Fumihiko Sano,...
EUROCRYPT
2000
Springer
13 years 8 months ago
A NICE Cryptanalysis
We present a chosen-ciphertext attack against both NICE cryptosystems. These two cryptosystems are based on computations in the class group of non-maximal imaginary orders. More pr...
Éliane Jaulmes, Antoine Joux
EUROCRYPT
2000
Springer
13 years 8 months ago
Cryptanalysis of Countermeasures Proposed for Repairing ISO 9796-1
Abstract. ISO 9796-1, published in 1991, was the first standard specifying a digital signature scheme with message recovery. In [4], Coron, Naccache and Stern described an attack o...
Marc Girault, Jean-François Misarsky
EUROCRYPT
2000
Springer
13 years 8 months ago
Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation
We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is uncondit...
Paul Dumais, Dominic Mayers, Louis Salvail
EUROCRYPT
2000
Springer
13 years 8 months ago
An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves
We present an index-calculus algorithm for the computation of discrete logarithms in the Jacobian of hyperelliptic curves defined over finite fields. The complexity predicts that i...
Pierrick Gaudry
EUROCRYPT
2000
Springer
13 years 8 months ago
Efficient Concurrent Zero-Knowledge in the Auxiliary String Model
We show that if any one-way function exists, then 3-round concurrent zero-knowledge arguments for all NP problems can be built in a model where a short auxiliary string with a pres...
Ivan Damgård
EUROCRYPT
2000
Springer
13 years 8 months ago
Single Database Private Information Retrieval Implies Oblivious Transfer
Giovanni Di Crescenzo, Tal Malkin, Rafail Ostrovsk...