{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T15:38:44Z","timestamp":1779896324769,"version":"3.53.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540429876","type":"print"},{"value":"9783540456827","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45682-1_20","type":"book-chapter","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T02:31:48Z","timestamp":1180146708000},"page":"331-350","source":"Crossref","is-referenced-by-count":49,"title":["Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes"],"prefix":"10.1007","author":[{"given":"Anna","family":"Lysyanskaya","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chris","family":"Peikert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,11,20]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or, Sha. Goldwasser, and Avi Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. 20th Annual ACM Symposium on Theory of Computing (STOC), pages 1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"20_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-45539-6_31","volume-title":"Advances in Cryptology \u2014EUR OCRYPT 2000","author":"F. Boudot","year":"2000","unstructured":"Fabrice Boudot. Efficient proofs that a committed number lies in an interval. In Bart Preneel, editor, Advances in Cryptology \u2014EUR OCRYPT 2000, volume 1807 of Lecture Notes in Computer Science, pages 431\u2013444. Springer Verlag, 2000."},{"key":"20_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/3-540-44647-8_23","volume-title":"Advances in Cryptology \u2014CR YPTO 2001","author":"J. Camenisch","year":"2001","unstructured":"Jan Camenisch and Anna Lysyanskaya. An identity escrow scheme with appointed verifiers. In Joe Kilian, editor, Advances in Cryptology \u2014CR YPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 388\u2013407. Springer Verlag, 2001."},{"key":"20_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014ASIA CRYPT\u2019 98","author":"J. Camenisch","year":"1998","unstructured":"Jan Camenisch and Markus Michels. A group signature scheme based on an RSAvariant. Technical Report RS-98-27, BRICS, Departement of Computer Science, University of Aarhus, November 1998. Preliminary version in:Advances in Cryptology \u2014ASIA CRYPT\u2019 98, vol. 1514 of LNCS."},{"issue":"1","key":"20_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Ran Canetti. Security and composition of multi-party cryptographic protocols. Journal of Cryptology, 13(1):143\u2013202, 2000.","journal-title":"Journal of Cryptology"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Ran Canetti, Uri Feige, Oded Goldreich, and Moni Naor. Adaptively secure multiparty computation. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 639\u2013648, 1996.","DOI":"10.1145\/237814.238015"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Ran Canetti, Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, and Tal Rabin. Adaptive security for threshold cryptosystems. In Advances in Cryptology\u2014CRYPTO 99. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-48405-1_7"},{"key":"20_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-45539-6_14","volume-title":"Advances in Cryptology \u2014EUR OCRYPT 2000","author":"D. Catalano","year":"2000","unstructured":"Dario Catalano, Rosario Gennaro, and Shai Halevi. Computing inverses over a shared secret modulus. In Bart Preneel, editor, Advances in Cryptology \u2014EUR OCRYPT 2000, volume 1807 of Lecture Notes in Computer Science, pages 190\u2013206. Springer Verlag, 2000."},{"key":"20_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Advances in Cryptology \u2014CR YPTO\u2019 92","author":"D. Chaum","year":"1993","unstructured":"David Chaum and Torben Pryds Pedersen. Wallet databases with observers. In Ernest F. Brickell, editor, Advances in Cryptology \u2014CR YPTO\u2019 92, volume 740 of Lecture Notes in Computer Science, pages 89\u2013105. Springer-Verlag, 1993."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Ronald Cramer, Ivan Damg\u00e5rd, Stefan Dziembowski, Martin Hirt, and Tal Rabin. Efficient multiparty computations secure against an adaptive adversary. In Advances in Cryptology\u2014EUROCRYPT 99, pages 311\u2013326. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-48910-X_22"},{"key":"20_CR11","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014EUR OCRYPT 2001","author":"R. Cramer","year":"2001","unstructured":"Ronald Cramer, Ivan Damg\u00e5rd, and Jesper Buus Nielsen. Multiparty computation from threshold homomorphic encryption. In Birgit Pfitzmann, editor, Advances in Cryptology \u2014EUR OCRYPT 2001, Lecture Notes in Computer Science. Springer Verlag, 2001."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Ronald Cramer and Victor Shoup. Signature schemes based on the strong RSA assumption. In Proc. 6th ACM Conference on Computer and Communications Security, pages 46\u201352. ACM press, nov 1999.","DOI":"10.1145\/319709.319716"},{"key":"20_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1007\/3-540-44598-6_27","volume-title":"Advances in Cryptology \u2014CR YPTO\u2019 00","author":"I. Damg\u00e5rd","year":"2000","unstructured":"Ivan Damg\u00e5rd and Jesper Buus Nielsen. Improved non-committing encryption schemes based on a general complexity assumption. In Mihir Bellare, editor, Advances in Cryptology \u2014CR YPTO\u2019 00, volume 1880 of Lecture Notes in Computer Science, pages 432\u2013450. Springer Verlag, 2000."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Yvo Desmedt. Society and group oriented cryptography. In Advances in Cryptology\u2014CRYPTO 87. Springer-Verlag, 1987.","DOI":"10.1007\/3-540-48184-2_8"},{"key":"20_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Advances in Cryptology \u2014CR YPTO\u2019 89","author":"Y. Desmedt","year":"1990","unstructured":"Yvo Desmedt and Yair Frankel. Threshold cryptography. In Advances in Cryptology \u2014CR YPTO\u2019 89, volume 435 of Lecture Notes in Computer Science, pages 307\u2013315. Springer-Verlag, 1990."},{"key":"20_CR16","series-title":"Lect Notes Comput Sci","volume-title":"Financial Cryptography 2000","author":"P. Fouque","year":"2000","unstructured":"P. Fouque, G. Poupard, and J. Stern. Sharing decryption in the context of voting or lotteries. In Financial Cryptography 2000, Lecture Notes in Computer Science. Springer Verlag, 2000."},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Yair Frankel, Philip MacKenzie, and Moti Yung. Adaptively-secure optimalresilience proactive RSA. In Advances in Cryptology\u2014ASIACRYPT 99. Springer-Verlag, 1999.","DOI":"10.1007\/978-3-540-48000-6_15"},{"key":"20_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-48910-X_9","volume-title":"Advances in Cryptology \u2014EUROCRYPT\u2019 99","author":"R. Gennaro","year":"1999","unstructured":"Rosario Gennaro, Shai Halevi, and Tal Rabin. Secure hash-and-sign signatures without the random oracle. In Jacques Stern, editor, Advances in Cryptology \u2014EUROCRYPT\u2019 99, volume 1592 of Lecture Notes in Computer Science, pages 123\u2013139. Springer Verlag, 1999."},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In Proc. 19th Annual ACM Symposium on Theory of Computing (STOC), pages 218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Sha. Goldwasser, Silvio Micali, and Charles Rackoff. The knowledge complexity of interactive proof systems. In Proc. 27th Annual Symposium on Foundations of Computer Science, pages 291\u2013304, 1985.","DOI":"10.1145\/22145.22178"},{"key":"20_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-45539-6_16","volume-title":"Advances in Cryptology \u2014EUR OCRYPT 2000","author":"S. Jarecki","year":"2000","unstructured":"StanisIlaw Jarecki and Anna Lysyanskaya. Adaptively secure threshold cryptography: introducing cocurrency, removing erasures. In Bart Preneel, editor, Advances in Cryptology \u2014EUR OCRYPT 2000, volume 1807 of Lecture Notes in Computer Science, pages 190\u2013206. Springer Verlag, 2000."},{"key":"20_CR22","unstructured":"Anna Lysyanskaya and Chris Peikert. Adaptive security in the threshold setting: From cryptosystems to signature schemes. Manuscript. Available from http:\/\/eprint.iacr.org ."},{"key":"20_CR23","unstructured":"Jesper Buus Nielsen. Personal communication."},{"key":"20_CR24","series-title":"Lect Notes Comput Sci","first-page":"223","volume-title":"Advances in Cryptology \u2014EUR OCRYPT\u2019 99","author":"P. Paillier","year":"1999","unstructured":"Pascal Paillier. Public-key cryptosystems based on composite residuosity classes. In Jacques Stern, editor, Advances in Cryptology \u2014EUR OCRYPT\u2019 99, volume 1592 of Lecture Notes in Computer Science, pages 223\u2013239. Springer Verlag, 1999."},{"key":"20_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 91","author":"T. P. Pedersen","year":"1992","unstructured":"Torben Pryds Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Joan Feigenbaum, editor, Advances in Cryptology \u2014 CRYPTO\u2019 91, volume 576 of Lecture Notes in Computer Science, pages 129\u2013140. Springer Verlag, 1992."},{"issue":"11","key":"20_CR26","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Adi Shamir. How to share a secret. Communications of the ACM, 22(11):612\u2013613, November 1979.","journal-title":"Communications of the ACM"},{"key":"20_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/3-540-45539-6_15","volume-title":"Advances in Cryptology \u2014EUR OCRYPT\u2019 00","author":"V. Shoup","year":"2000","unstructured":"Victor Shoup. Practical threshold signatures. In Bart Preneel, editor, Advances in Cryptology \u2014EUR OCRYPT\u2019 00, volume 1807 of Lecture Notes in Computer Science, pages 207\u2013220. Springer Verlag, 2000."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45682-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T06:48:00Z","timestamp":1556434080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45682-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429876","9783540456827"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-45682-1_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}