Optimizing robustness while generating shared secret safe primes

Lecture Notes in Computer Science

Volumn 3386, Issue , 2005, Pages 120-137

  Ong, Emil ^a   Kubiatowicz, John ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Distributed key generation; Safe primes; Threshold RSA signatures

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; OPTIMIZATION; ROBUSTNESS (CONTROL SYSTEMS);

COMPUTER ARITHMETIC ALGORITHMS; DISTRIBUTED KEY GENERATION; SAFE PRIMES; THRESHOLD RSA SIGNATURES;

SECURITY OF DATA;

EID: 24144476603     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30580-4_9     Document Type: Conference Paper

References (20)

1. Shoup, V.: Practical Threshold Signatures. Lecture Notes in Computer Science 1807 (2000)
2. Algesheimer, J., Camenisch, J., Shoup, V.: Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In: Proceedings of CRYPTO 2002, Springer Verlag (2002) 417-432
3. Fouque, P.A., Stern, J.: Fully distributed threshold RSA under standard assumptions. In: Proceedings of Asiacrypt. (2001) 310-330
4. Damgård, I.B., Koprowski, M.: Practical Threshold RSA Signatures Without a Trusted Dealer. Technical Report RS-00-30, Basic Research in Computer Science, University of Aarhus (2000)
5. Malkin, M., Wu, T., Boneh, D.: Experimenting with Shared Generation of RSA keys. In: Symposium on Network and Distributed System Security. (1999) 43-56
6. Cramer, R., Shoup, V.: Signature Schemes Based on the Strong RSA Assumption. ACM Transactions on Information and System Security 3 (2000) 161-185
7. Catalano, D., Gennaro, R., Halevi, S.: Computing inverses over a secret shared modulus. In: EUROCRYPT 2000. Volume 1807 of LNCS., Springer-Verlag (2000) 190-207
8. Boneh, D., Franklin, M.: Efficient generation of shared RSA keys. Journal of the ACM (JACM) 48 (2001) 702-722
9. Frankel, Y., MacKenzie, P.D., Yung, M.: Robust Efficient Distributed RSA-Key Generation. In: Annual ACM Symposium on Theory of Computing. (1998)
10. Goldwasser, S., Lindell, Y.: Secure Multi-Party Computation Without Agreement. In: 16th International Symposium on Distributed Computing. Volume 2508 of LNCS. (2002) 17-32
11. Shamir, A.: How to share a secret. Communications of the ACM 22 (1979)
12. Damgård, J., Fujisaki, E.: A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order. In: ASIACRYPT. (2002) 125-142
13. Pedersen, T.: Non-interactive and information-theoretic secure verifiable secret sharing. In: CRYPTO 1991. Volume 576 of LNCS. (1991) 129-140
14. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computation. In: Annual ACM Symposium on Theory of Computing. (1988) 1-10
15. Mao, W.: Guaranteed Correct Sharing of Integer Factorization with Off-line Shareholders. In: Public Key Cryptography. Volume 1431 of LNCS. (1998) 60-71
16. Montgomery, P.L.: Modular Multiplication Without Trial Division. Mathematics of Computation 44 (1985) 519-521
17. Bajard, J.C., Didier, L.S., Kornerup, P.: Modular Multiplication and Base Extensions in Residue Number Systems. In: Proceedings of the 15th IEEE Symposium on Computer Arithmetic. (2001) 59-65
18. k). In: Symposium on Computer Arithmetic. (1997) 225-231
19. Bar-Ilan, J., Beaver, D.: Non-Cryptographic Fault-Tolerant Computing in a Constant Number of Rounds of Interaction. In: 8th ACM Symposium on Principles of Distributed Computation. (1989) 201-209
20. Frankel, Y., MacKenzie, P., Yung, M.: Adaptively secure distributed public-key systems. Theoretical Computer Science 287 (2002) 535-561