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
PublisherSpringer Verlag
Pages417-432
Number of pages16
Volume2442
ISBN (Print)354044050X, 9783540440505
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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Modulo
Distributed Computation
Modulus

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

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 Advances in Cryptology - CRYPTO 2002 - 22nd Annual International Cryptology Conference, Proceedings (Vol. 2442, pp. 417-432). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2442). Springer Verlag.

Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. / Algesheimer, Joy; Camenisch, Jan; Shoup, Victor.

Advances in Cryptology - CRYPTO 2002 - 22nd Annual International Cryptology Conference, Proceedings. Vol. 2442 Springer Verlag, 2002. p. 417-432 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2442).

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

Algesheimer, J, Camenisch, J & Shoup, V 2002, Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. in Advances in Cryptology - CRYPTO 2002 - 22nd Annual International Cryptology Conference, Proceedings. vol. 2442, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2442, Springer Verlag, pp. 417-432, 22nd Annual International Cryptology Conference, CRYPTO 2002, Santa Barbara, United States, 8/18/02.
Algesheimer J, Camenisch J, Shoup V. Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In Advances in Cryptology - CRYPTO 2002 - 22nd Annual International Cryptology Conference, Proceedings. Vol. 2442. Springer Verlag. 2002. p. 417-432. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Algesheimer, Joy ; Camenisch, Jan ; Shoup, Victor. / Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. Advances in Cryptology - CRYPTO 2002 - 22nd Annual International Cryptology Conference, Proceedings. Vol. 2442 Springer Verlag, 2002. pp. 417-432 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@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",
year = "2002",
language = "English (US)",
isbn = "354044050X",
volume = "2442",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "417--432",
booktitle = "Advances in Cryptology - CRYPTO 2002 - 22nd Annual International Cryptology Conference, Proceedings",

}

TY - GEN

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

AU - Algesheimer, Joy

AU - Camenisch, Jan

AU - Shoup, Victor

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

KW - Distributed primality test

KW - RSA

KW - Safe primes

KW - Threshold cryptography

UR - http://www.scopus.com/inward/record.url?scp=84937431456&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84937431456&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84937431456

SN - 354044050X

SN - 9783540440505

VL - 2442

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 417

EP - 432

BT - Advances in Cryptology - CRYPTO 2002 - 22nd Annual International Cryptology Conference, Proceedings

PB - Springer Verlag

ER -