{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:53:26Z","timestamp":1778216006723,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540611868","type":"print"},{"value":"9783540683391","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-68339-9_31","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:31:14Z","timestamp":1186363874000},"page":"354-371","source":"Crossref","is-referenced-by-count":208,"title":["Robust Threshold DSS Signatures"],"prefix":"10.1007","author":[{"given":"Rosario","family":"Gennaro","sequence":"first","affiliation":[]},{"given":"Stanis\u0142aw","family":"Jarecki","sequence":"additional","affiliation":[]},{"given":"Hugo","family":"Krawczyk","sequence":"additional","affiliation":[]},{"given":"Tal","family":"Rabin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations. In Proc. 20th ACM Symp. on Theory of Computing, pages 1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"31_CR2","unstructured":"C. Boyd. Digital Multisignatures. In H. Baker and F. Piper, editors, Cryptography and Coding, pages 241\u2013246. Claredon Press, 1986."},{"key":"31_CR3","unstructured":"E. Berlekamp and L. Welch. Error correction of algebraic block codes. US Patent 4,633,470."},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Crepeau, and I. Damgard. Multiparty Unconditionally Secure Protocols. In Proc. 20th ACM Symp. on Theory of Computing, pages 11\u201319, 1988.","DOI":"10.1145\/62212.62214"},{"key":"31_CR5","series-title":"Lect Notes Comput Sci","first-page":"458","volume-title":"Proc. EUROCRYPT 90","author":"D. Chaum","year":"1990","unstructured":"D. Chaum. Zero-knowledge undeniable signatures. In Proc. EUROCRYPT 90, pages 458\u2013464. Springer-Verlag, 1990. Lecture Notes in Computer Science No. 473."},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Alredo De Santis, Yvo Desmedt, Yair Frankel, and Moti Yung. How to share a function securely. In Proc. 26th ACM Symp. on Theory of Computing, pages 522\u2013533, Santa Fe, 1994.","DOI":"10.1145\/195058.195405"},{"key":"31_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/3-540-48184-2_8","volume-title":"Proc. CRYPTO 87","author":"Y. Desmedt","year":"1988","unstructured":"Yvo Desmedt. Society and group oriented cryptography: A new concept. In Carl Pomerance, editor, Proc. CRYPTO 87, pages 120\u2013127. Springer-Verlag, 1988. Lecture Notes in Computer Science No. 293."},{"issue":"4","key":"31_CR8","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1002\/ett.4460050407","volume":"5","author":"Y. G. Desmedt","year":"1994","unstructured":"Yvo G. Desmedt, Threshold cryptography. European Transactions on Telecommunications, 5(4):449\u2013457, July 1994.","journal-title":"European Transactions on Telecommunications"},{"key":"31_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Proc. CRYPTO 89","author":"Y. Desmedt","year":"1990","unstructured":"Yvo Desmedt and Yair Frankel. Threshold cryptosystems. In G. Brassard, editor, Proc. CRYPTO 89, pages 307\u2013315. Springer-Verlag, 1990. Lecture Notes in Computer Science No. 435."},{"key":"31_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/3-540-46766-1_37","volume-title":"Proc. CRYPTO 91","author":"Y. Desmedt","year":"1992","unstructured":"Y. Desmedt and Y. Frankel. Shared generation of authenticators and signatures. In J. Feigenbaum, editor, Proc. CRYPTO 91, pages 457\u2013469. Springer-Verlag, 1992. Lecture Notes in Computer Science No. 576."},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Info. Theory, IT 31, 1985.","DOI":"10.1109\/TIT.1985.1057074"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"P. Feldman. A Practical Scheme for Non-Interactive Verifiable Secret Sharing. In Proc. 28th IEEE Symp. on Foundations of Comp. Science, pages 427\u2013437, 1987.","DOI":"10.1109\/SFCS.1987.4"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Y. Frankel, P. Gemmel, and M. Yung. Witness-based cryptographic program checking and robust function sharing. To appear in proceedings of STOC96, 1996.","DOI":"10.1145\/237814.237998"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"P. Feldman and S. Micali. An Optimal Algorithm for Synchronous Byzantine Agreement. In Proc. 20th ACM Symp. on Theory of Computing, pages 148\u2013161, 1988.","DOI":"10.1145\/62212.62225"},{"key":"31_CR15","unstructured":"National Institute for Standards and Technology. Digital Signature Standard (DSS). Technical Report 169, August 30 1991."},{"key":"31_CR16","unstructured":"Rosario Gennaro. Theory and practice of verifiable secret sharing. Ph.D. thesis, Massachusetts Institute of Technology, to appear, 1996."},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, and Tal Rabin. Robust and efficient sharing of rsa functions. manuscript, 1996.","DOI":"10.1007\/3-540-68697-5_13"},{"issue":"2","key":"31_CR18","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":"31_CR19","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":"31_CR20","doi-asserted-by":"crossref","unstructured":"L. Harn. Group oriented (t,n) digital signature scheme. IEEE Proc.-Comput.Digit.Tech, 141(5), Sept 1994.","DOI":"10.1049\/ip-cdt:19941293"},{"key":"31_CR21","unstructured":"[HJJ+95]_Amir Herzberg, Markus Jakobson, Stanislaw Jarecki, Hugo Krawczyk, and Moti Yung. Proactive proactive public key and signature systems. manuscript, 1995."},{"key":"31_CR22","series-title":"Lect Notes Comput Sci","volume-title":"Proc. CRYPTO 95","author":"A. Herzberg","year":"1995","unstructured":"Amir Herzberg, Stanislaw Jarecki, Hugo Krawczyk, and Moti Yung. Proactive secret sharing, or: How to cope with perpetual leakage. In Proc. CRYPTO 95. Springer-Verlag, August 1995. Lecture Notes in Computer Science No. 963."},{"key":"31_CR23","doi-asserted-by":"crossref","unstructured":"P. Horster, H. Petersen, and M. Michels. Meta-elgamal signatures schemes. In 2nd ACM Conference on Computer and Communications Security, pages 96\u2013107, 1994.","DOI":"10.1145\/191177.191197"},{"key":"31_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/3-540-44750-4_32","volume-title":"Crypto\u201995","author":"S. Langford","year":"1995","unstructured":"S. Langford. Threshold dss signatures without a trusted party. In Crypto\u201995, pages 397\u2013409. Springer-Verlag, 1995. Lecture Notes in Computer Science No. 963."},{"key":"31_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/3-540-46766-1_32","volume-title":"Proc. CRYPTO 91","author":"S. Micali","year":"1992","unstructured":"S. Micali and P. Rogaway. Secure computation. In J. Feigenbaum, editor, Proc. CRYPTO 91, pages 392\u2013404. Springer-Verlag, 1992. Lecture Notes in Computer Science No. 576."},{"issue":"9","key":"31_CR26","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R. McEliece","year":"1981","unstructured":"R. McEliece and D. Sarwate. On sharing secrets and reed-solomon codes. Communications of the ACM, 24(9):583\u2013584, September 1981.","journal-title":"Communications of the ACM"},{"key":"31_CR27","doi-asserted-by":"crossref","unstructured":"K. Nyberg and R. Rueppel. Message recovery for signature schemes based on the discrete logarithm problem. In Proc. EUROCRYPT 94, pages 175\u2013190, 1994.","DOI":"10.1007\/BFb0053434"},{"key":"31_CR28","doi-asserted-by":"crossref","unstructured":"T. Pedersen. Distributed provers with applications to undeniable signatures. In Proc. EUROCRYPT 91, 1991.","DOI":"10.1007\/3-540-46416-6_20"},{"key":"31_CR29","doi-asserted-by":"crossref","unstructured":"T. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Proc. CRYPTO 91, pages 129\u2013140, 1991.","DOI":"10.1007\/3-540-46766-1_9"},{"key":"31_CR30","unstructured":"M. Rabin. A Simplification Approach to Distributed Multiparty Computations. personal communication, 1995."},{"key":"31_CR31","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"},{"key":"31_CR32","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir. How to Share a Secret. Communications of the ACM, 22:612\u2013613, 1979.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201996"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68339-9_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:32:59Z","timestamp":1556739179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68339-9_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540611868","9783540683391"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-68339-9_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1996]]}}}