Efficient computation modulo a shared secret with application to the generation of shared safe-prime products

Joy Algesheimer, Jan Camenisch, Victor Shoup

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationAdvances in Cryptology - CRYPTO 2002 - 22nd Annual International Cryptology Conference, Proceedings
EditorsMoti Yung
PublisherSpringer Verlag
Pages417-432
Number of pages16
ISBN (Electronic)354044050X, 9783540440505
DOIs
StatePublished - 2002
Event22nd Annual International Cryptology Conference, CRYPTO 2002 - Santa Barbara, United States
Duration: Aug 18 2002Aug 22 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2442
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other22nd Annual International Cryptology Conference, CRYPTO 2002
CountryUnited States
CitySanta Barbara
Period8/18/028/22/02

Keywords

  • Distributed primality test
  • RSA
  • Safe primes
  • Threshold cryptography

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Efficient computation modulo a shared secret with application to the generation of shared safe-prime products'. Together they form a unique fingerprint.

  • Cite this

    Algesheimer, J., Camenisch, J., & Shoup, V. (2002). Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In M. Yung (Ed.), Advances in Cryptology - CRYPTO 2002 - 22nd Annual International Cryptology Conference, Proceedings (pp. 417-432). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2442). Springer Verlag. https://doi.org/10.1007/3-540-45708-9_27