{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T20:49:37Z","timestamp":1761943777927,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648925"},{"type":"electronic","value":"9783540684626"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055723","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T21:12:36Z","timestamp":1154034756000},"page":"105-120","source":"Crossref","is-referenced-by-count":10,"title":["New efficient and secure protocols for verifiable signature sharing and other applications"],"prefix":"10.1007","author":[{"given":"Dario","family":"Catalano","sequence":"first","affiliation":[]},{"given":"Rosario","family":"Gennaro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"8_CR1","unstructured":"N. Asokan, V. Shoup and M. Waidner. Optimistic fair exchange of digital signatures. EUROCRYPT'98."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Non-cryptographic Fault-Tolerant Distributed Computations. STOC'88 pp.1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"M. Burmester. Homomorphism of secret sharing schemes: a tool for verifiable signature sharing. EUROCRYPT'96, pp.96\u2013106. LNCS vol.1070.","DOI":"10.1007\/3-540-68339-9_9"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"David Chaum and Hans Van Antwerpen. Undeniable signatures. CRYPTO'89, pages 212\u2013217. LNCS vol. 435.","DOI":"10.1007\/0-387-34805-0_20"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Crepeau, and I. Damgard. Multiparty Unconditionally Secure Protocols. STOC'88, pp.11\u201319, 1988.","DOI":"10.1145\/62212.62214"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. FOCS'85, pp.383\u2013395, 1985.","DOI":"10.1109\/SFCS.1985.64"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"D. Coppersmith, M. Franklin, J. Patarin and M. Reiter. Low-exponent RSA with related messages. EUROCRYPT'96, pp.1\u20139. LNCS vol.1070.","DOI":"10.1007\/3-540-68339-9_1"},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/3-540-68339-9_32","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"Ivan Damg\u00e5rd","year":"1996","unstructured":"I. Damgard and T. Pedersen. New convertible undeniable signature schemes. EUROCRYPT'96, pp.372\u2013386. LNCS vol.1070."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung. How to share a function securely. STOC'94, pp.522\u2013533, 1994.","DOI":"10.1145\/195058.195405"},{"issue":"no.6","key":"8_CR10","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M.E. Hellman. New Directions in Cryptography. IEEE Transactions on Information Theory, v. IT-22, no. 6, pp. 644\u2013654, November 1976.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"8_CR11","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"IT-31","author":"T. ElGamal","year":"1985","unstructured":"T. ElGamal. A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, IT-31(4):469\u2013472, 1985.","journal-title":"IEEE Transactions on Information Theory"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"P. Feldman. A Practical Scheme for Non-Interactive Verifiable Secret Sharing. FOCS'87, pp.427\u2013437, 1987.","DOI":"10.1109\/SFCS.1987.4"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Y. Frankel, P. Gemmell, P. Mackenzie, and M. Yung. Optimal Resilience Proactive Public-Key Cryptosystems. FOCS'97, pp.384\u2013393.","DOI":"10.1109\/SFCS.1997.646127"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"M. Franklin and M. Reiter. Verifiable Signature Sharing. EUROCRYPT'95, pp.50\u201363. LNCS vol.921.","DOI":"10.1007\/3-540-49264-X_5"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust and efficient sharing of RSA functions. CRYPTO'96, pp.157\u2013172. LNCS vol.1109.","DOI":"10.1007\/3-540-68697-5_13"},{"key":"8_CR16","unstructured":"R. Gennaro, S. Jarecki, and T. Rabin. Securely revisiting distributed key generation. Manuscript."},{"key":"8_CR17","unstructured":"R. Gennaro, H. Krawczyk and T. Rabin. RSA-Based Undeniable Signatures. CRYPTO'97, LNCS vol.1294."},{"issue":"No.3","key":"8_CR18","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O. Goldreich","year":"1996","unstructured":"O. Goldreich and A. Kahan. How to Construct Constant-Round Zero-Knowledge Proof Systems for NP. J. of Cryptology, Vol.9, No.3, pp.167\u2013190, 1996.","journal-title":"J. of Cryptology"},{"issue":"1","key":"8_CR19","first-page":"691","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. Journal of the ACM, 38(1):691\u2013729, 1991.","journal-title":"Journal of the ACM"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. STOC'87, pp.218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"issue":"2","key":"8_CR21","first-page":"270","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali. Probabilistic Encryption. JCSS, 28(2), pp.270\u2013299, April 1984.","journal-title":"JCSS"},{"issue":"1","key":"8_CR22","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":"8_CR23","doi-asserted-by":"crossref","unstructured":"H. Krawczyk. Secret sharing made short. CRYPTO'93, pp.136\u2013146, LNCS 773.","DOI":"10.1007\/3-540-48329-2_12"},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02351718","volume":"1","author":"K.S. McCurley","year":"1988","unstructured":"K.S. McCurley. A key distribution system equivalent to factoring. Journal of Cryptology. vol.1, pp.95\u2013105, 1988.","journal-title":"Journal of Cryptology"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"T. Pedersen. A threshold cryptosystem without a trusted party. EUROGRYPT'91, pp.522\u2013526, LNCS vol. 547","DOI":"10.1007\/3-540-46416-6_47"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"T. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. CRYPTO'91, pp.129\u2013140, LNCS vol. 576","DOI":"10.1007\/3-540-46766-1_9"},{"key":"8_CR27","unstructured":"T. Rabin. A Simplified Approach to Threshold and Proactive RSA. To appear in CRYPTO'98."},{"key":"8_CR28","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"},{"key":"8_CR29","unstructured":"Z. Shmuely. Composite Diffie-Hellman public-key generating systems are hard to break. Technion Dept. of Computer Science Technical Report no.356, 1985."},{"key":"8_CR30","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/3-540-68339-9_17","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"Markus Stadler","year":"1996","unstructured":"M. Stadler. Publicly Verifiable Secret Sharing. EUROCRYPT'96, pp.190\u2013199, LNCS vol.1070."},{"key":"8_CR31","unstructured":"E. Verheul and H. van Tilborg. Binding ElGamal. EUROCRYPT'97, LNCS 1233."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO '98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055723","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T03:51:20Z","timestamp":1736481080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055723"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648925","9783540684626"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/bfb0055723","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}