Paper 2002/029
Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products
Joy Algesheimer, Jan Camenisch, and Victor Shoup
Abstract
We present a new protocol for efficient distributed computation modulo a shared secret. We further present a protocol to distributively generate a random shared prime or safe prime that is much more efficient than previously known methods. This allows to distributively compute shared RSA keys, where the modulus is the product of two safe primes, much more efficiently than was previously known.
Metadata
- Available format(s)
-
PDF PS
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- RSAsafe primesthreshold cryptographydistributed primality test
- Contact author(s)
- jca @ zurich ibm com
- History
- 2002-03-06: received
- Short URL
- https://ia.cr/2002/029
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2002/029,
author = {Joy Algesheimer and Jan Camenisch and Victor Shoup},
title = {Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products},
howpublished = {Cryptology {ePrint} Archive, Paper 2002/029},
year = {2002},
url = {https://eprint.iacr.org/2002/029}
}