136
Voted
EUROCRYPT
2000
Springer
15 years 7 months ago
2000
Springer
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...
135
Voted
EUROCRYPT
2000
Springer
15 years 7 months ago
2000
Springer
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...
133
Voted
EUROCRYPT
2000
Springer
15 years 7 months ago
2000
Springer
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...
112
Voted
EUROCRYPT
2000
Springer
15 years 7 months ago
2000
Springer
123
Voted
EUROCRYPT
2000
Springer
15 years 7 months ago
2000
Springer
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...