Adaptive security for threshold cryptosystems

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

Volumn 1666, Issue , 1999, Pages 98-116

  Canetti, Ran ^a   Gennaro, Rosario ^a   Jarecki, Stanisław ^b   Krawczyk, Hugo ^a,c   Rabin, Tal ^a  

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

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK SECURITY;

ADAPTIVE SECURITY; CENTRAL PROBLEMS; DESIGN AND ANALYSIS; DISTRIBUTED KEY GENERATION; EFFICIENT PROTOCOLS; SECURE PROTOCOLS; THRESHOLD CRYPTOGRAPHY; THRESHOLD CRYPTOSYSTEMS;

CRYPTOGRAPHY;

EID: 84957083549     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48405-1_7     Document Type: Conference Paper

References (24)

1. J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds. In Proc. 8th ACM PODC, pages 201-209. ACM, 1989.
2. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations. In Proc. 20th STOC, pages 10. ACM, 1988.
3. D. Beaver and S. Haber. Cryptographic protocols provably secure against dynamic adversaries. In Eurocrypt '92, pages 307-323, 1992. LNCS No. 658. BW. E. Berlekamp and L. Welch. Error correction of algebraic block codes. US Patent 4,633,470.
4. R. Canetti. Security and composition of multiparty cryptographic protocols. Available at the Theory of Cryptography Library, http://theory.lcs.mit.edu/~tcryptol. 1998.
5. D. Chaum, C. Crepeau, and I. Damgard. Multiparty Unconditionally Secure Protocols. In Proc. 20th STOC, pages 11-19. ACM, 1988.
6. R. Cramer and I. Damgard. Zero-knowledge proof for finite fields arithmetic, or: Can zero-knowledge be for free. In Crypto '98, pages 424-441, 1998. LNCS No. 1462.
7. R. Cramer, I. Damgård, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations with dishonest minority. In Eurocrypt '99, pages 311-326, 1999. LNCS No.
8. Ran Canetti, Uri Feige, Oded Goldreich, and Moni Naor. Adaptively secure multi-party computation. In Proc. 28th STOC, pages 639-648. ACM, 1996.
9. R. Canetti, R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Adaptive security for threshold cryptosystems. http://www.research.ibm.com/security/adss.ps.
10. C. Dwork, M. Naor, and A. Sahai. Concurrent zero-knowledge. In Proc. 30th STOC, pages 409-418. ACM, 1998.
11. Y. Frankel, P. MacKenzie, and M. Yung. Adaptively-secure distributed public-key systems. Personal communication with M.Yung.
12. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust threshold DSS signatures. In Eurocrypt '96, pages 354-371, 1996. Full version: http://www.research.ibm.com/security/DSSthresh.ps.
13. 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.
14. O. Goldreich and H. Krawczyk. On the composition of zero-knowledge proof systems. SIAM. J. Computing, 25(1), 1996.
15. Shafi Goldwasser, Silvio Micali, and Ronald L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing, 17(2):281-308, April 1988.
16. S. Goldwasser, S. Micali, and C. Racko_. The knowledge complexity of interactive proof-systems. SIAM. J. Computing, 18(1):186-208, February 1989.
17. R. Gennaro, M. Rabin, and T Rabin. Simpli_ed vss and fast-track multiparty computations with applications to threshold cryptography. In Proc. 17th ACM PODC, pages 101-112. ACM, 1998.
18. 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.
19. T. Itoh and K. Sakurai. On the complexity of constant round zkip of possession of knowledge. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E76-A(1), January 1993.
20. J. Kilian, E. Petrank, and C. Rackoff. Lower bounds for zero-knowledge on the internet. In Proc. 39th FOCS, pages 484-492. IEEE, 1998.
21. T. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Crypto '91, pages 129-140, 1991. LNCS No. 576.
22. T. Pedersen. A threshold cryptosystem without a trusted party. In Eurocrypt '91, pages 522-526, 1991. LNCS No. 547.
23. Tal Rabin. A simplified approach to threshold and proactive RSA. In Crypto '98, pages 89-104, 1998. LNCS No. 1462.
24. C. P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4:161-174, 1991.