@inproceedings{92e50e1502f84c89ab230664360236bd,
title = "Efficient computation modulo a shared secret with application to the generation of shared safe-prime products",
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 one to distributively compute shared RSA keys, where the modulus is the product of two safe primes, much more efficiently than was previously known.",
keywords = "Distributed primality test, RSA, Safe primes, Threshold cryptography",
author = "Joy Algesheimer and Jan Camenisch and Victor Shoup",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 22nd Annual International Cryptology Conference, CRYPTO 2002 ; Conference date: 18-08-2002 Through 22-08-2002",
year = "2002",
doi = "10.1007/3-540-45708-9_27",
language = "English (US)",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "417--432",
editor = "Moti Yung",
booktitle = "Advances in Cryptology - CRYPTO 2002 - 22nd Annual International Cryptology Conference, Proceedings",
}