{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:51:50Z","timestamp":1778215910335,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540675174","type":"print"},{"value":"9783540455394","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45539-6_16","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:26:08Z","timestamp":1184603168000},"page":"221-242","source":"Crossref","is-referenced-by-count":87,"title":["Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures"],"prefix":"10.1007","author":[{"given":"Stanis\u0142aw","family":"Jarecki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Lysyanskaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,5,12]]},"reference":[{"key":"16_CR1","unstructured":"Bea97. Donald Beaver. Plug and play encryption. In Advances in Cryptology\u2014CRYPTO 97. Springer-Verlag, 1997."},{"key":"16_CR2","unstructured":"BG92. Mihir Bellare and Oded Goldreich. On defining proofs of knowledge. In Advances in Cryptology\u2014CRYPTO 92. Springer-Verlag, 1992."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"BGW88. Michael Ben-Or, Shafi Goldwasser, and Avi Widgerson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. InACM Symposium on Theory of Computing, pages 1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"16_CR4","unstructured":"BH92. D. Beaver and S. Haber. Cryptographic protocols provably secure againts dynamic adversaries. In Advances in Cryptology\u2014EUROCRYPT 92, 1992."},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"BR97. Mihir Bellare and Phillip Rogaway. Collision-resistant hashing: towards making uowhfs practical. In Advances in Cryptology\u2014CRYPTO 97, 1997.","DOI":"10.1007\/BFb0052256"},{"key":"16_CR6","unstructured":"Bra99. Stefan Brands. Rethinking public-key infrastructures and digital certificates-building in privacy. Ph.D. dissertation, Technical University of Eindhoven, 1999."},{"key":"16_CR7","unstructured":"Cam98. Jan Camenisch. Group signature schemes and payment systems based on the discrete logarithm problem. ETH Series in Information Security and Cryptography, vol.2, 1998."},{"key":"16_CR8","unstructured":"Can98. Ran Canetti. Security and composition of multiparty cryptographic protocols. Theory of Cryptography Library, http:\/\/philby.ucsd.edu\/cryptolib\/1998.html , 1998."},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"CCD88. David Chaum, Claude Crepeau, and Ivan Damg\u00e5rd. Multiparty unconditionally secure protocols. In Proc. 20th ACM Symp. on Theory of Computing, pages 11\u201319, 1988.","DOI":"10.1145\/62212.62214"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"CD98. Ronald Cramer and Ivan Damg\u00e5rd. Zero-knowledge proof for finite field arithmetics, or: Can zero-knowledge be for free. In Advances in Cryptology\u2014CRYPTO 98, pages 424\u2013441. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0055745"},{"key":"16_CR11","unstructured":"CDD+99. 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, 1999."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"CFGN96. Ran Canetti, Uri Feige, Oded Goldreich, and Moni Naor. Adaptively secure multi-party computation. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 639\u2013648, 1996.","DOI":"10.1145\/237814.238015"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"CFIJ99. Giovanni Di Crescenzo, Niels Ferguson, Russell Impagliazzo, and Markus Jakobsson. How to forget a secret. In Proceedings of STACS\u201999, 1999.","DOI":"10.1007\/3-540-49116-3_47"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"CG99. Ran Canetti and Shafi Goldwasser. An efficient threshold public key cryptosystem secure against adaptice chosen ciphertext attack. In Advances in Cryptology\u2014EUROCRYPT 99, pages 90\u2013106. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-48910-X_7"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"CGJ+99a. 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":"16_CR16","doi-asserted-by":"crossref","unstructured":"CGJ+99b. Ran Canetti, Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, and Tal Rabin. Adaptive security for threshold cryptosystems. http:\/\/theory.lcs.mit.edu\/~cis\/cis-publications.html , 1999.","DOI":"10.1007\/3-540-48405-1_7"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"CS98. Ronald Cramer and Victor Shoup. A practical public-key cryptosystem provably secure against adaptive chosen ciphertext attack. In Advances in Cryptology\u2014CRYPTO 98. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0055717"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Des87. 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":"16_CR19","doi-asserted-by":"crossref","unstructured":"DF89. Yvo Desmedt and Yair Frankel. Threshold cryptosystems. In Advances in Cryptology\u2014CRYPTO 89, pages 307\u2013315. Springer-Verlag, 1989.","DOI":"10.1007\/0-387-34805-0_28"},{"key":"16_CR20","unstructured":"DNRS99. Cynthia Dwork, Moni Naor, Omer Reingold, and Larry Stockmeyer. Magic functions. In 40th IEEE Symp. on Foundations of Comp. Science, 1999."},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"FMY99a. Yair Frankel, Philip MacKenzie, and Moti Yung. Adaptively-secure distributed threshold public key systems. In Proceedings of ESA 99, 1999.","DOI":"10.1007\/3-540-48481-7_2"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"FMY99b. Yair Frankel, Philip MacKenzie, and Moti Yung. Adaptively-secure optimal-resilience proactive RSA. In Advances in Cryptology\u2014ASIACRYPT 99. Springer-Verlag, 1999.","DOI":"10.1007\/978-3-540-48000-6_15"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"GJKR99. Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, and Tal Rabin. Secure distributed key generation for discrete-log based cryptosystems. In Advances in Cryptology\u2014EUROCRYPT 99, pages 295\u2013310, 1999.","DOI":"10.1007\/3-540-48910-X_21"},{"key":"16_CR24","unstructured":"Gol95. Oded Goldreich. Foundations of cryptography: Fragments of a book. http:\/\/theory.lcs.mit.edu\/~oded , 1995."},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"HJJ+97. Amir Herzberg, Markus Jakobsson, Stanis\u0142aw Jarecki, Hugo Krawczyk, and Moti Yung. Proactive public key and signature systems. In 4th ACM Conf. on Comp. and Comm. Security, pages 100\u2013110, 1997.","DOI":"10.1145\/266420.266442"},{"key":"16_CR26","unstructured":"JL00. Stanislaw Jarecki and Anna Lysyanskaya. Adaptively secure threshold cryptography without erasures. Theory of Cryptography Library, 2000."},{"key":"16_CR27","unstructured":"Lys00. Anna Lysyanskaya. Threshold cryptography secure against the adaptive adversary, concurrently. Theory of Cryptography Library, 2000."},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Ped91. T. Pedersen. A threshold cryptosystem without a trusted party. In Advances in Cryptology\u2014EUROCRYPT 91, pages 522\u2013526, 1991.","DOI":"10.1007\/3-540-46416-6_47"},{"issue":"3","key":"16_CR29","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"Sch91","year":"1991","unstructured":"Sch91. C. P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3):161\u2013174, 1991.","journal-title":"Journal of Cryptology"},{"key":"16_CR30","unstructured":"SG98. Victor Shoup and Rosario Gennaro. Securing threshold cryptosystems against chosen ciphertext attack. In Advances in Cryptology\u2014EUROCRYPT 98. Springer-Verlag, 1998."},{"key":"16_CR31","unstructured":"Sho99a. Victor Shoup. A composition theorem for universal one-way hash functions. IBM Research Report RZ3147, 1999."},{"key":"16_CR32","unstructured":"Sho99b. Victor Shoup. Why chosen ciphertext security matters. IBM Research Report RZ3076, 1999."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45539-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T11:59:49Z","timestamp":1737287989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45539-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540675174","9783540455394"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-45539-6_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}