You are looking at a specific version 20020306:121100 of this paper. See the latest version.

Paper 2002/029

Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products

Joy Algesheimer and 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
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.