Secure applications of Pedersen's distributed key generation protocol

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

Volumn 2612, Issue , 2003, Pages 373-390

  Gennaro, Rosario ^a   Jarecki, Stanislaw ^b   Krawczyk, Hugo ^a   Rabin, Tal ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Discrete logarithm; Distributed key generation; Exact security; Random oracle model; Threshold cryptography

Indexed keywords

ACCESS CONTROL; ALUMINUM; AUTHENTICATION; ECONOMIC AND SOCIAL EFFECTS; HARDNESS; SECURITY OF DATA;

DISCRETE LOGARITHMS; DISTRIBUTED KEY GENERATION; EXACT SECURITY; RANDOM ORACLE MODEL; THRESHOLD CRYPTOGRAPHY;

CRYPTOGRAPHY;

EID: 23944448377     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36563-x_26     Document Type: Article

References (33)

1. E. Bach. Analytic Methods in the Analysis and Design of Number-Theoretic Algorithms ACM Distiguished Dissertation (1984). MIT Press, Cambridge, MA, 1985.
2. J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds. In Proc. 8th ACM Symp. on Principles of Distributed Computation, pages 201-209, 1989.
3. Mihir Bellare and Phillip Rogaway. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In ACM Conference on Computer and Communications Security, pages 62-73, 1993.
4. R. Canetti and S. Goldwasser. An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack. In Eurocrypt '99, pages 90-106, 1999. LNCS No. 1592.
5. Ran Canetti, Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, and Tal Rabin. Adaptive security for threshold cryptosystems. In Proc. CRYPTO 99, pages 98-115. Springer-Verlag, 1999. LNCS No. 1666.
6. R. Cramer, R. Gennaro, and B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. In Eurocrypt '97, pages 103-118, 1997. LNCS No. 1233.
7. D. Chaum and T. Pederson. Wallet databases with observers. In Crypto '92, LNCS No. 740, pages 89-105, 1992.
8. C. Cachin, and J. A. Poritz Secure Intrusion-tolerant Replication on the Internet. In Proc. Intl. Conference on Dependable Systems and Networks (DNS-2002), Washington DC, USA, IEEE, 2002. (see also http://eprint.iacr.org/)
9. M. Cerecedo, T. Matsumoto, and H. Imai. Efficient and secure multiparty generation of digital signatures based on discrete logarithms. IEICE Trans. Fundamentals, E76-A(4):532-545, 1993.
10. Yvo Desmedt. Society and group oriented cryptography: A new concept. Crypto'87, pages 120-127, 1987. LNCS No. 293.
11. Y. Desmedt and Y. Frankel. Threshold cryptosystems. In Crypto '89, pages 307-315, 1989. LNCS No. 435.
12. P. Feldman. A Practical Scheme for Non-Interactive Verifiable Secret Sharing. In Proc. 28th FOCS, pages 427-437. IEEE, 1987.
13. Amos Fiat and Adi Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Crypto'86, pages 186-194, 1986. LNCS No. 263.
14. Y. Frankel, P. D. MacKenzie, and M. Yung. Adaptively-secure distributed Public Key systems. In Algorithms - ESA '99, 7th Annual European Symposium, Prague, pages 4-27, 1999. LNCS No. 1643
15. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust threshold DSS signatures. In Information and Computation 164, pp.54-84, 2001.
16. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. The (in)security of distributed key generation in dlog-based cryptosystems. In Eurocrypt '99, pages 295-310, 1999. LNCS No. 1592.
17. Shafi Goldwasser, Silvio Micali, and Ronald Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing, 17(2):281-308, April 1988.
18. Rosario Gennaro, Michael Rabin, and Tal Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In Proc. 17th ACM Symp. on Principles of Distributed Comp., ACM, 1998.
19. L. Harn. Group oriented (t,n) digital signature scheme. In IEE Proc.-Comput.Digit.Tech, 141(5):307-313, Sept 1994.
20. A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, and M. Yung. Proactive public key and signature systems. In 1997 ACM Conference on Computers and Communication Security, 1997.
21. S. Jarecki. Efficient Threshold Cryptosystems. MIT PhD Thesis, June 2001, theory.lcs.mit.edu/~cis/cis-theses. html.
22. Stanislaw Jarecki and Anna Lysyanskaya. Adaptively secure threshold cryptosystems without erasures. In Eurocrypt'00, pages 221-242, 2000. LNCS. No. 1807.
23. C.-H. Li, T. Hwang, and N.-Y. Lee. (t,n) threshold signature schemes based on discrete logarithm. In Eurocrypt '94, pp. 191-200, 1994. LNCS No. 950.
24. A. K. Lenstra and E. R. Verheul Selecting Cryptographic Key Sizes. In Journal of Cryptology, vol. 14(4), 2001, pages 255-293.
25. Torben Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Crypto '91, pages 129-140. 1991.
26. Torben Pedersen. A threshold cryptosystem without a trusted party. In Eurocrypt '91, pages 522-526, 1991. LNCS No. 547.
27. C. Park and K. Kurosawa. New ElGamal Type Threshold Digital Signature Scheme. IEICE Trans. Fundamentals, E79-A(1):86-93, January 1996.
28. D. Pointcheval, and J. Stern, Security Proofs for Signature Schemes. Eurocrypt'96, pages 387-398, 1996. LNCS No. 1070.
29. A. Shamir. How to Share a Secret. CACM, 22:612-613, 1979.
30. P. Schnorr. Efficient identification and signatures for smart cards. - Crypto '89, pages 235-251, 1989. LNCS No. 435.
31. Victor Shoup. Practical threshold signatures. In Eiurocrypt '00, pages 207-220. Springer-Verlag, 2000.
32. V. Shoup and R. Gennaro. Securing threshold cryptosystems against chosen ciphertext attack. In Eurocrypt '98, pages 1-16, 1998. LNCS No. 1403.
33. Wei Dai. Benchmarks for the Crypto++ 4.0 library performance. Available at http://www. eskimo. com/~weidai/cryptlib.html