Welcome to the resource topic for 2002/029
Title:
Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products
Authors: Joy Algesheimer, Jan Camenisch, 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.
ePrint: https://eprint.iacr.org/2002/029
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .