EUROCRYPT
2000
Springer
13 years 8 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...