{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:21:46Z","timestamp":1778127706134,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540008477","type":"print"},{"value":"9783540365631","type":"electronic"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36563-x_26","type":"book-chapter","created":{"date-parts":[[2007,11,2]],"date-time":"2007-11-02T10:24:59Z","timestamp":1193999099000},"page":"373-390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["Secure Applications of Pedersen\u2019s Distributed Key Generation Protocol"],"prefix":"10.1007","author":[{"given":"Rosario","family":"Gennaro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanislaw","family":"Jarecki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugo","family":"Krawczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tal","family":"Rabin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"26_CR1","volume-title":"Analytic Methods in the Analysis and Design of Number-Theoretic Algorithms ACM Distiguished Dissertation","author":"E. Bach","year":"1985","unstructured":"E. Bach. Analytic Methods in the Analysis and Design of Number-Theoretic Algorithms ACM Distiguished Dissertation (1984). MIT Press, Cambridge, MA, 1985. 378"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds. In Proc. 8th ACM Symp. on Principles of Distributed Computation, pages 201\u2013209, 1989.","DOI":"10.1145\/72981.72995"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Mihir Bellare and Phillip Rogaway. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In ACM Conference on Computer and Communications Security, pages 62\u201373, 1993. 379","DOI":"10.1145\/168588.168596"},{"key":"26_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/3-540-48910-X_7","volume-title":"Eurocrypt\u2019 99","author":"R. Canetti","year":"1999","unstructured":"R. Canetti and S. Goldwasser. An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack. In Eurocrypt\u2019 99, pages 90\u2013106, 1999. LNCS No. 1592. 374, 389"},{"key":"26_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/3-540-48405-1_7","volume-title":"Adaptive security for threshold cryptosystems","author":"R. Canetti","year":"1999","unstructured":"Ran Canetti, Rosario Gennaro, StanisIlaw Jarecki, Hugo Krawczyk, and Tal Rabin. Adaptive security for threshold cryptosystems. In Proc. CRYPTO 99, pages 98\u2013115. Springer-Verlag, 1999. LNCS No. 1666. 383"},{"key":"26_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-69053-0_9","volume-title":"Eurocrypt\u2019 97","author":"R. Cramer","year":"1997","unstructured":"R. Cramer, R. Gennaro, and B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. In Eurocrypt\u2019 97, pages 103\u2013118, 1997. LNCS No. 1233. 374"},{"key":"26_CR7","series-title":"Lect Notes Comput Sci","first-page":"89","volume-title":"Crypto\u2019 92","author":"D. Chaum","year":"1992","unstructured":"D. Chaum and T. Pederson. Wallet databases with observers. In Crypto\u2019 92, LNCS No. 740, pages 89\u2013105, 1992. 389"},{"key":"26_CR8","unstructured":"C. Cachin, and J.A. Poritz Secure Intrusion-tolerant Replication on the Internet. In Proc. Intl. Conference on Dependable Systems and Networks (DNS-2002), Washington DC, USA, IEEE, 2002. (see also \n                    http:\/\/eprint.iacr.org\/\n                    \n                  ) 375, 377, 378, 388"},{"issue":"4","key":"26_CR9","first-page":"532","volume":"E76-A","author":"M. Cerecedo","year":"1993","unstructured":"M. Cerecedo, T. Matsumoto, and H. Imai. Efficient and secure multiparty generation of digital signatures based on discrete logarithms. IEICE Trans. Fundamentals, E76-A(4):532\u2013545, 1993. 374","journal-title":"IEICE Trans. Fundamentals"},{"key":"26_CR10","series-title":"Lect Notes Comput Sci","first-page":"120","volume-title":"Crypto\u201987","author":"Y. Desmedt","year":"1987","unstructured":"Yvo Desmedt. Society and group oriented cryptography: A new concept. Crypto\u201987, pages 120\u2013127, 1987. LNCS No. 293. 373"},{"key":"26_CR11","series-title":"Lect Notes Comput Sci","first-page":"307","volume-title":"Crypto\u2019 89","author":"Y. Desmedt","year":"1989","unstructured":"Y. Desmedt and Y. Frankel. Threshold cryptosystems. In Crypto\u2019 89, pages 307\u2013315, 1989. LNCS No. 435. 373"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"P. Feldman. A Practical Scheme for Non-Interactive Verifiable Secret Sharing. In Proc. 28th FOCS, pages 427\u2013437. IEEE, 1987. 379","DOI":"10.1109\/SFCS.1987.4"},{"key":"26_CR13","series-title":"Lect Notes Comput Sci","first-page":"186","volume-title":"Crypto\u201986","author":"A. Fiat","year":"1986","unstructured":"Amos Fiat and Adi Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Crypto\u201986, pages 186\u2013194, 1986. LNCS No. 263. 382"},{"key":"26_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/3-540-48481-7_2","volume-title":"Adaptively-secure distributed Public Key systems","author":"Y. Frankel","year":"1999","unstructured":"Y. Frankel, P. D. MacKenzie, and M. Yung. Adaptively-secure distributed Public Key systems. In Algorithms-ESA\u201999, 7th Annual European Symposium, Prague, pages 4\u201327, 1999. LNCS No. 1643 375, 383"},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1006\/inco.2000.2881","volume":"164","author":"R. Gennaro","year":"2001","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust threshold DSS signatures. In Information and Computation 164, pp.54\u201384, 2001. 374, 382","journal-title":"Information and Computation"},{"key":"26_CR16","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. 1592. 373, 374, 377, 380, 388"},{"issue":"2","key":"26_CR17","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 Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing, 17(2):281\u2013308, April 1988. 378, 382","journal-title":"SIAM J. Computing"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Rosario Gennaro, Michael Rabin, and Tal Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In Proc. 17th ACM Symp. on Principles of Distributed Comp.. ACM, 1998.","DOI":"10.1145\/277697.277716"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"L. Harn. Group oriented (t, n)di gital signature scheme. In IEE Proc.-Comput.Digit.Tech, 141(5):307\u2013313, Sept 1994. 374","DOI":"10.1049\/ip-cdt:19941293"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"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. 374","DOI":"10.1145\/266420.266442"},{"key":"26_CR21","unstructured":"S. Jarecki. Efficient Threshold Cryptosystems. MIT PhD Thesis, June 2001, \n                    http:\/\/theory.lcs.mit.edu\/~cis\/cis-theses.html\n                    \n                  . 377"},{"key":"26_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/3-540-45539-6_16","volume-title":"Eurocrypt\u201900","author":"S. Jarecki","year":"2000","unstructured":"StanisIlaw Jarecki and Anna Lysyanskaya. Adaptively secure threshold cryptosystems without erasures. In Eurocrypt\u201900, pages 221\u2013242, 2000. LNCS. No. 1807. 383"},{"key":"26_CR23","series-title":"Lect Notes Comput Sci","first-page":"191","volume-title":"Eurocrypt\u2019 94","author":"C.-H. Li","year":"1994","unstructured":"C.-H. Li, T. Hwang, and N.-Y. Lee. (t, n)thres hold signature schemes based on discrete logarithm. In Eurocrypt\u2019 94, pp. 191\u2013200, 1994. LNCS No. 950. 374"},{"issue":"4","key":"26_CR24","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00145-001-0009-4","volume":"14","author":"A. K. Lenstra","year":"2001","unstructured":"A. K. Lenstra and E. R. Verheul Selecting Cryptographic Key Sizes. In Journal of Cryptology, vol. 14(4), 2001, pages 255\u2013293. 388","journal-title":"Journal of Cryptology"},{"key":"26_CR25","doi-asserted-by":"crossref","unstructured":"Torben Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Crypto\u2019 91, pages 129\u2013140. 1991.","DOI":"10.1007\/3-540-46766-1_9"},{"key":"26_CR26","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":"Torben Pedersen. A threshold cryptosystem without a trusted party. In Eurocrypt\u2019 91, pages 522\u2013526, 1991. LNCS No. 547. 374, 379"},{"issue":"1","key":"26_CR27","first-page":"86","volume":"E79-A","author":"C. Park","year":"1996","unstructured":"C. Park and K. Kurosawa. New ElGamal Type Threshold Digital Signature Scheme. IEICE Trans. Fundamentals, E79-A(1):86\u201393, January 1996. 374","journal-title":"IEICE Trans. Fundamentals"},{"key":"26_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/3-540-68339-9_33","volume-title":"Eurocrypt\u2019 96","author":"D. Pointcheval","year":"1996","unstructured":"D. Pointcheval, and J. Stern, Security Proofs for Signature Schemes. Eurocrypt\u2019 96, pages 387\u2013398, 1996. LNCS No. 1070. 376, 382, 385, 387, 389"},{"key":"26_CR29","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir. How to Share a Secret. CACM, 22:612\u2013613, 1979. 373, 374","journal-title":"CACM"},{"key":"26_CR30","series-title":"Lect Notes Comput Sci","first-page":"235","volume-title":"Crypto\u201989","author":"P. Schnorr","year":"1989","unstructured":"P. Schnorr. Efficient identification and signatures for smart cards.-Crypto\u201989, pages 235\u2013251, 1989. LNCS No. 435. 375, 382"},{"key":"26_CR31","doi-asserted-by":"crossref","unstructured":"Victor Shoup. Practical threshold signatures. In Eiurocrypt\u2019 00, pages 207\u2013220. Springer-Verlag, 2000. 375","DOI":"10.1007\/3-540-45539-6_15"},{"key":"26_CR32","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0054113","volume-title":"Eurocrypt\u2019 98","author":"V. Shoup","year":"1998","unstructured":"V. Shoup and R. Gennaro. Securing threshold cryptosystems against chosen ciphertext attack. In Eurocrypt\u2019 98, pages 1\u201316, 1998. LNCS No. 1403. 374"},{"key":"26_CR33","unstructured":"Wei Dai. Benchmarks for the Crypto++ 4.0 library performance. Available at \n                    http:\/\/www.eskimo.com\/~weidai\/cryptlib.html\n                    \n                   388"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2014 CT-RSA 2003"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36563-X_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:49:43Z","timestamp":1558262983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36563-X_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008477","9783540365631"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-36563-x_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"28 February 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}