41 search results - page 1 / 9 » Reducing the Complexity in the Distributed Multiplication Pr... |
AINA
2007
IEEE
2007
IEEE
Reducing the Complexity in the Distributed Multiplication Protocol of Two Polynomially Shared Values
14 years 1 months ago
The multiparty multiplication of two polynomially shared values over Zq with a public prime number q is an important module in distributed computations. The multiplication protoco...
CRYPTO
2001
Springer
13 years 11 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
CAV
2001
Springer
13 years 10 months ago
2001
Springer
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
PKC
2007
Springer
14 years 1 months ago
2007
Springer
Damg˚ard et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposit...
IJNSEC
2008
13 years 7 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...