Optimizing Robustness While Generating Shared Secret Safe Primes

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.

• Type: Conference
• Year: 2005
• Where: PKC
• Authors: Emil Ong, John Kubiatowicz
• Keywords: Cryptography, Montgomery Modular Multiplication, Need Special Care, PKC 2005, Threshold Rsa Signature