Efficient threshold RSA signatures with general moduli and no extra assumptions

Lecture Notes in Computer Science

Volumn 3386, Issue , 2005, Pages 346-361

  Damgård, Ivan ^a   Dupont, Kasper ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; NETWORK PROTOCOLS;

RANDOM ORACLES; RSA SIGNATURES; SIGNATURE SCHEMES;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

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

References (25)

1. Algesheimer, Camenisch and Shoup: Efficient computations modulo a shared secret with applications to generation of shared safe-prime products, proc. of Crypto 2002.
2. D. Boneh and M. Franklin Efficient generation of shared RSA keys, Proc. of Crypto' 97, Springer-Verlag LNCS series, nr. 1233.
3. R. Canetti, Security and Composition of Multiparty Cryptographic Protocols, Journal of Cryptology, vol.13, 2000. On-line version at http://philby.ucsd.edu/cryptolib/1998/98-18.html.
4. R.Canetti, A unified framework for analyzing security of protocols, Cryptology Eprint archive 2000/67, http://eprint.iacr.org/2000/067.ps
5. Cramer and Damgård: Secret-Key Zero-Knowledge, Proc. of TCC 2003, Springer Verlag LNCS.
6. Damgård and Fujisaki: A statistically hiding integer commitment scheme based on groups with hidden order, proc. of AsiaCrypt 2002.
7. Damgård and Jurik: A Generalization and some Applications of Paillier's Probabilistic Public-key System, to appear in Public Key Cryptography 2001.
8. Damgård and Koprowski: Practical threshold RSA signatures without a trusted dealer, Proc. of EuroCrypt 2001.
9. Alfredo De Santis, Yvo Desmedt, Yair Frankel, Moti Yung: How to share a function securely, STOC 1994: 522-533
10. Yair Frankel, Peter Gemmell, Philip D. MacKenzie and Moti Yung Optimal-Resilience Proactive Public-Key Cryptosystems Proc. of FOCS 97.
11. Yair Frankel, Philip D. MacKenzie and Moti Yung Robust Efficient Distributed RSA-Key Generation, Proc. of STOC 98.
12. P. Fouque, G. Poupard, J. Stern: Sharing Decryption in the Context of Voting or Lotteries, Proceedings of Financial Crypto 2000.
13. E. Fujisaki and E. Okamoto: Statistical Zero-Knowledge Protocols to prove Modular Polynomial Relations, proc. of Crypto 97, Springer Verlag LNCS series 1294.
14. Pierre-Alain Fouque and Jacques Stern: Fully Distributed Threshold RSA under Standard Assumptions, IACR Cryptology ePrint Archive: Report 2001/008, February 2001
15. Gennaro, Jarecki, Krawczyk and Rabin: Secure Distributed Key Generation for Discrete-Log Based Cryptosystems, Proc. of EuroCrypt 99, Springer Verlag LNCS series, nr. 1592.
16. Gennaro, Rabin, Jarecki and Krawczyk: Robust and Efficient Sharing of RSA Functions, J.Crypt, vol.13, no.2.
17. Shingo Miyazaki, Kouichi Sakurai and Moti Yung On Threshold RSA-Signing with no Dealer, Proc. of ICISC 1999, Springer Verlag LNCS series, nr.1787.
18. Brian King: Improved Methods to Perform Threshold RSA., ASIACRYPT 2000, pp.359-372, Springer Verlag LNCS.
19. M. Koprowski: Threshold Integer Secret Sharing, manuscript, 2003.
20. P.Pallier: Public-Key Cryptosystems based on Composite Degree Residue Classes, Proceedings of EuroCrypt 99, Springer Verlag LNCS series, pp. 223-238.
21. Pedersen: A Threshold cryptosystem without a trusted third party, proc. of Euro-Crypt 91, Springer Verlag LNCS nr. 547.
22. T.Rabin: A Simplified Approach to Threshold and Proactive RSA, proc. of Crypto 98, Springer Verlag LNCS 1462.
23. M.K.Reiter and K.P.Birman: How to securely replicate services, ACM Transactions on programming languages and systems 1994, vol 16, nr.3, pp.986-1009.
24. J. B. Rosser and L. Schoenfeld: Approximate formulas for some functions of prime numbers, Ill. J. Math. 6 (1962), 64-94.
25. Victor Shoup Practical Threshold Signatures, Proceedings of EuroCrypt 2000, Springer Verlag LNCS series nr. 1807.