48 search results - page 1 / 10 » Computing Inverses over a Shared Secret Modulus |
EUROCRYPT
2000
Springer
15 years 1 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...
PODC
2003
ACM
15 years 2 months ago
2003
ACM
This paper presents an efficient asynchronous protocol to compute RSA inverses with respect to a public RSA modulus N whose factorization is secret and shared among a group of pa...
IJNSEC
2008
14 years 9 months ago
2008
The nature of the RSA public modulus N as a composite of at least two secret large primes was always considered as a major obstacle facing the RSA function sharing without the hel...
103
Voted
CRYPTO
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We introduce algebraic geometric techniques in secret sharing and in secure multi-party computation (MPC) in particular. The main result is a linear secret sharing scheme...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Secret sharing in user hierarchy represents a challenging area for research. Although a lot of work has already been done in this direction, this paper presents a novel approach t...