Abstract
We present adaptively-secure efficient solutions to several central problems in the area of threshold cryptography. We prove these solutions to withstand adaptive attackers that choose parties for corruption at any time during the run of the protocol. In contrast, all previously known efficient protocols for these problems were proven secure only against less realistic static adversaries that choose and fix the subset of corrupted parties before the start of the protocol run.
Specifically, we provide adaptively-secure solutions for distributed key generation in discrete-log based cryptosystems, and for the problem of distributed generation of DSS signatures (threshold DSS). We also show how to transform existent static solutions for threshold RSA and proactive schemes to withstand the stronger adaptive attackers. In doing so, we introduce several techniques for the design and analysis of adaptively-secure protocols that may well find further applications.
Chapter PDF
References
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.
M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations. In Proc. 20th STOC, pages 1–10. ACM, 1988.
D. Beaver and S. Haber. Cryptographic protocols provably secure against dynamic adversaries. In Eurocrypt’ 92, pages 307–323, 1992. LNCS No. 658.
E. Berlekamp and L. Welch. Error correction of algebraic block codes. US Patent 4,633,470.
R. Canetti. Security and composition of multiparty cryptographic protocols. Available at the Theory of Cryptography Library, http://theory.lcs.mit.edu/~tcryptol. 1998.
D. Chaum, C. Crepeau, and I. Damgard. Multiparty Unconditionally Secure Protocols. In Proc. 20th STOC, pages 11–19. ACM, 1988.
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.
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.
Ran Canetti, Uri Feige, Oded Goldreich, and Moni Naor. Adaptively secure multi-party computation. In Proc. 28th STOC, pages 639–648. ACM, 1996.
R. Canetti, R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Adaptive security for threshold cryptosystems. http://www.research.ibm.com/security/adss.ps.
C. Dwork, M. Naor, and A. Sahai. Concurrent zero-knowledge. In Proc. 30th STOC, pages 409–418. ACM, 1998.
Y. Frankel, P. MacKenzie, and M. Yung. Adaptively-secure distributed public-key systems. Personal communication with M.Yung.
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.
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.
O. Goldreich and H. Krawczyk. On the composition of zero-knowledge proof systems. SIAM. J. Computing, 25(1), 1996.
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.
S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof-systems. SIAM. J. Computing, 18(1):186–208, February 1989.
R. Gennaro, M. Rabin, and T Rabin. Simplified vss and fast-track multiparty computations with applications to threshold cryptography. In Proc. 17th ACM PODC, pages 101–112. ACM, 1998.
HJJ+97._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.
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.
J. Kilian, E. Petrank, and C. Rackoff. Lower bounds for zero-knowledge on the internet. In Proc. 39th FOCS, pages 484–492. IEEE, 1998.
T. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Crypto’ 91, pages 129–140, 1991. LNCS No. 576.
T. Pedersen. A threshold cryptosystem without a trusted party. In Eurocrypt’ 91, pages 522–526, 1991. LNCS No. 547.
Tal Rabin. A simplified approach to threshold and proactive RSA. In Crypto’ 98, pages 89–104, 1998. LNCS No. 1462.
C. P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4:161–174, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Canetti, R., Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T. (1999). Adaptive Security for Threshold Cryptosystems. In: Wiener, M. (eds) Advances in Cryptology — CRYPTO’ 99. CRYPTO 1999. Lecture Notes in Computer Science, vol 1666. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48405-1_7
Download citation
DOI: https://doi.org/10.1007/3-540-48405-1_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66347-8
Online ISBN: 978-3-540-48405-9
eBook Packages: Springer Book Archive