Optimizing Robustness While Generating Shared Secret Safe Primes

  • Emil Ong
  • John Kubiatowicz
Conference paper

DOI: 10.1007/978-3-540-30580-4_9

Volume 3386 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Ong E., Kubiatowicz J. (2005) Optimizing Robustness While Generating Shared Secret Safe Primes. In: Vaudenay S. (eds) Public Key Cryptography - PKC 2005. PKC 2005. Lecture Notes in Computer Science, vol 3386. Springer, Berlin, Heidelberg

Abstract

We develop a method for generating shared, secret, safe primes applicable to use in threshold RSA signature schemes such as the one developed by Shoup. We would like a scheme usable in practical settings, so our protocol is robust and efficient in asynchronous, hostile environments. We show that the techniques used for robustness need special care when they must be efficient. Specifically, we show optimizations that minimize the number and size of the proofs of knowledge used. We also develop optimizations based on computer arithmetic algorithms, in particular, precomputation and Montgomery modular multiplication.

Keywords

Distributed key generation safe primes threshold RSA signatures 
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Emil Ong
    • 1
  • John Kubiatowicz
    • 1
  1. 1.University of CaliforniaBerkeley