CryptoDB

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

Authors: Joy Algesheimer Jan Camenisch Victor Shoup URL: http://eprint.iacr.org/2002/029 Search ePrint Search Google 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.
BibTeX
@misc{eprint-2002-11553,
title={Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products},
booktitle={IACR Eprint archive},
keywords={RSA, safe primes, threshold cryptography, distributed primality test},
url={http://eprint.iacr.org/2002/029},
note={ jca@zurich.ibm.com 11752 received 6 Mar 2002, last revised 6 Mar 2002},
author={Joy Algesheimer and Jan Camenisch and Victor Shoup},
year=2002
}