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

  • Joy Algesheimer
  • Jan Camenisch
  • Victor Shoup
Conference paper

DOI: 10.1007/3-540-45708-9_27

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2442)
Cite this paper as:
Algesheimer J., Camenisch J., Shoup V. (2002) Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products. In: Yung M. (eds) Advances in Cryptology — CRYPTO 2002. CRYPTO 2002. Lecture Notes in Computer Science, vol 2442. Springer, Berlin, Heidelberg

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

RSA safe primes threshold cryptography distributed primality test 
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Joy Algesheimer
    • 1
  • Jan Camenisch
    • 1
  • Victor Shoup
    • 1
  1. 1.Zurich Research LaboratoryIBM ResearchRüschlikon

Personalised recommendations