{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T06:30:39Z","timestamp":1784874639189,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540663478","type":"print"},{"value":"9783540484059","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48405-1_7","type":"book-chapter","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T10:24:36Z","timestamp":1178015076000},"page":"98-116","source":"Crossref","is-referenced-by-count":120,"title":["Adaptive Security for Threshold Cryptosystems"],"prefix":"10.1007","author":[{"given":"Ran","family":"Canetti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rosario","family":"Gennaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stanis\u0142aw","family":"Jarecki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hugo","family":"Krawczyk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tal","family":"Rabin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[1999,12,16]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds. In Proc. 8 th ACM PODC, pages 201\u2013209. ACM, 1989.","DOI":"10.1145\/72981.72995"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations. In Proc. 20 th STOC, pages 1\u201310. ACM, 1988.","DOI":"10.1145\/62212.62213"},{"key":"7_CR3","series-title":"Lect Notes Comput Sci","first-page":"307","volume-title":"Eurocrypt\u2019 92","author":"D. Beaver","year":"1992","unstructured":"D. Beaver and S. Haber. Cryptographic protocols provably secure against dynamic adversaries. In Eurocrypt\u2019 92, pages 307\u2013323, 1992. LNCS No. 658."},{"key":"7_CR4","unstructured":"E. Berlekamp and L. Welch. Error correction of algebraic block codes. US Patent 4,633,470."},{"key":"7_CR5","unstructured":"R. Canetti. Security and composition of multiparty cryptographic protocols. Available at the Theory of Cryptography Library, http:\/\/theory.lcs.mit.edu\/~tcryptol . 1998."},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Crepeau, and I. Damgard. Multiparty Unconditionally Secure Protocols. In Proc. 20 th STOC, pages 11\u201319. ACM, 1988.","DOI":"10.1145\/62212.62214"},{"key":"7_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1007\/BFb0055745","volume-title":"Crypto\u2019 98","author":"R. Cramer","year":"1998","unstructured":"R. Cramer and I. Damgard. Zero-knowledge proof for finite fields arithmetic, or: Can zero-knowledge be for free. In Crypto\u2019 98, pages 424\u2013441, 1998. LNCS No. 1462."},{"key":"7_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/3-540-48910-X_22","volume-title":"Eurocrypt\u2019 99","author":"R. Cramer","year":"1999","unstructured":"R. Cramer, I. Damg\u00e5rd, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations with dishonest minority. In Eurocrypt\u2019 99, pages 311\u2013326, 1999. LNCS No."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Ran Canetti, Uri Feige, Oded Goldreich, and Moni Naor. Adaptively secure multi-party computation. In Proc. 28 th STOC, pages 639\u2013648. ACM, 1996.","DOI":"10.1145\/237814.238015"},{"key":"7_CR10","unstructured":"R. Canetti, R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Adaptive security for threshold cryptosystems. http:\/\/www.research.ibm.com\/security\/adss.ps ."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"C. Dwork, M. Naor, and A. Sahai. Concurrent zero-knowledge. In Proc. 30 th STOC, pages 409\u2013418. ACM, 1998.","DOI":"10.1145\/276698.276853"},{"key":"7_CR12","unstructured":"Y. Frankel, P. MacKenzie, and M. Yung. Adaptively-secure distributed public-key systems. Personal communication with M.Yung."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust threshold DSS signatures. In Eurocrypt\u2019 96, pages 354\u2013371, 1996. Full version: http:\/\/www.research.ibm.com\/security\/DSSthresh.ps .","DOI":"10.1007\/3-540-68339-9_31"},{"key":"7_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/3-540-48910-X_21","volume-title":"Eurocrypt\u2019 99","author":"R. Gennaro","year":"1999","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. The (in)security of distributed key generation in dlog-based cryptosystems. In Eurocrypt\u2019 99, pages 295\u2013310, 1999. LNCS No."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"O. Goldreich and H. Krawczyk. On the composition of zero-knowledge proof systems. SIAM. J. Computing, 25(1), 1996.","DOI":"10.1137\/S0097539791220688"},{"issue":"2","key":"7_CR16","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Shafi Goldwasser, Silvio Micali, and Ronald L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing, 17(2):281\u2013308, April 1988.","journal-title":"SIAM J. Computing"},{"issue":"1","key":"7_CR17","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof-systems. SIAM. J. Computing, 18(1):186\u2013208, February 1989.","journal-title":"SIAM. J. Computing"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"R. Gennaro, M. Rabin, and T Rabin. Simplified vss and fast-track multiparty computations with applications to threshold cryptography. In Proc. 17 th ACM PODC, pages 101\u2013112. ACM, 1998.","DOI":"10.1145\/277697.277716"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/266420.266442"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-57332-1_28"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"J. Kilian, E. Petrank, and C. Rackoff. Lower bounds for zero-knowledge on the internet. In Proc. 39 th FOCS, pages 484\u2013492. IEEE, 1998.","DOI":"10.1109\/SFCS.1998.743499"},{"key":"7_CR22","series-title":"Lect Notes Comput Sci","first-page":"129","volume-title":"Crypto\u2019 91","author":"T. Pedersen","year":"1991","unstructured":"T. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Crypto\u2019 91, pages 129\u2013140, 1991. LNCS No. 576."},{"key":"7_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Eurocrypt\u2019 91","author":"T. Pedersen","year":"1991","unstructured":"T. Pedersen. A threshold cryptosystem without a trusted party. In Eurocrypt\u2019 91, pages 522\u2013526, 1991. LNCS No. 547."},{"key":"7_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BFb0055722","volume-title":"Crypto\u2019 98","author":"T. Rabin","year":"1998","unstructured":"Tal Rabin. A simplified approach to threshold and proactive RSA. In Crypto\u2019 98, pages 89\u2013104, 1998. LNCS No. 1462."},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C. P. Schnorr","year":"1991","unstructured":"C. P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4:161\u2013174, 1991.","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 99"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48405-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T16:35:36Z","timestamp":1556382936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48405-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540663478","9783540484059"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-48405-1_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}