{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:20:13Z","timestamp":1725488413618},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540611868"},{"type":"electronic","value":"9783540683391"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-68339-9_9","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T21:31:14Z","timestamp":1186349474000},"page":"96-106","source":"Crossref","is-referenced-by-count":2,"title":["Homomorphisms of Secret Sharing Schemes: A Tool for Verifiable Signature Sharing"],"prefix":"10.1007","author":[{"given":"Mike","family":"Burmester","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"9_CR1","series-title":"Lect Notes Comput Sci","first-page":"251","volume-title":"Advances in Cryptology, Proc. of Crypto\u2019 86","author":"J.C. Benaloh","year":"1987","unstructured":"J.C. Benaloh: Secret sharing homomorphisms: Keeping shares of a secret secret. In: A. Odlyzko (ed.): Advances in Cryptology, Proc. of Crypto\u2019 86. Lecture Notes in Computer Science 263, Berlin: Springer 1987, pp. 251\u2013260"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson: Completeness theorems for non-cryptographic fault-tolerant distributed computation. Proceedings of the twentieth annual ACM Symp. Theory of Computing, STOC, 1988, pp. 1\u201310.","DOI":"10.1145\/62212.62213"},{"key":"9_CR3","first-page":"313","volume":"48","author":"G. R. Blakley","year":"1979","unstructured":"G. R. Blakley: Safeguarding cryptographic keys. In: Proc. Nat. Computer Conf. AFIPS Conf. Proc., 48, 1979, pp. 313\u2013317","journal-title":"Proc. Nat. Computer Conf. AFIPS Conf. Proc."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau and I. Damg\u00e5rd: Multiparty unconditionally secure protocols. Proceedings of the twentieth annual ACM Symp. Theory of Computing, STOC, 1988, pp. 11\u201319","DOI":"10.1145\/62212.62214"},{"key":"9_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BFb0000421","volume-title":"Advances in Cryptology \u2014 Asiacrypt\u2019 94","author":"Y. Desmedt","year":"1995","unstructured":"Y. Desmedt, G. Di Crescenzo, and M. Burmester: Multiplicative non-abelian sharing schemes and their application to threshold cryptography. In: J. Pieprzyk, R. Safavi-Naini (eds.): Advances in Cryptology \u2014 Asiacrypt\u2019 94. Lecture Notes in Computer Science 917. Berlin: Springer 1995, pp. 21\u201332"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung: How to share a function securely. In: Proceedings of the twenty-sixth annual ACM Symp. Theory of Computing (STOC), 1994, pp. 522\u2013533. Full paper in preparation.","DOI":"10.1145\/195058.195405"},{"issue":"4","key":"9_CR7","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1002\/ett.4460050407","volume":"5","author":"Y. G. Desmedt","year":"1994","unstructured":"Y. G. Desmedt: Threshold cryptography. European Trans. on Telecommunications, 5(4), pp. 449\u2013457 (1994)","journal-title":"European Trans. on Telecommunications"},{"issue":"4","key":"9_CR8","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1137\/S0895480192224713","volume":"7","author":"Y. G. Desmedt","year":"1994","unstructured":"Y. G. Desmedt, Y. Frankel: Homomorphic zero-knowledge threshold schemes over any finite abelian group. SIAM Journal on Discrete Mathematics, 7(4), 667\u2013679, (1994)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"9_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/0-387-34805-0_23","volume-title":"Advances in Cryptology \u2014 Crypto\u2019 89","author":"M. Soete De","year":"1990","unstructured":"M. De Soete, J-J. Quisquater, and K. Vedder: A signature with shared verification scheme. In: G. Brassard (ed.): Advances in Cryptology \u2014 Crypto\u2019 89. Lecture Notes in Computer Science 435. Berlin: Springer 1990, pp. 253\u2013262"},{"key":"9_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/3-540-49264-X_5","volume-title":"Advances in Cryptology \u2014 Eurocrypt\u2019 95","author":"M. K. Franklin","year":"1995","unstructured":"M. K. Franklin and M. K. Reiter: Verifiable signature sharing. In: L.C. Guillou, J.J. Quisquater (eds.): Advances in Cryptology \u2014 Eurocrypt\u2019 95. Lecture Notes in Computer Science 921. Berlin: Springer 1995, pp. 50\u201363"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"M. K. Franklin and M. K. Reiter: The design and implementation of a secure auction service. IEEE Symposium on Security and Privacy. Oakland CA, 1995","DOI":"10.1109\/SECPRI.1995.398918"},{"key":"9_CR12","unstructured":"M. K. Franklin and M. K. Reiter: A linear protocol failure for RSA with exponent three. Presented at the Rump session of Crypto\u2019 95, Santa Barbara, California, USA, August 27\u201331, 1995."},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1137\/0218049","volume":"18","author":"Z. Galil","year":"1989","unstructured":"Z. Galil, S. Haber, and M. Yung: Minimum-knowledge interactive proofs for decision problems. Siam J. Comput., 18(4), 711\u2013739 (1989)","journal-title":"Siam J. Comput."},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali and A. Wigderson: How to play any mental game. Proceedings of the Nineteenth annual ACM Symp. Theory of Computing, STOC, 1987, pp. 218\u2013229","DOI":"10.1145\/28395.28420"},{"issue":"1","key":"9_CR15","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. Comput., 18(1), 186\u2013208 (1989)","journal-title":"Siam J. Comput."},{"issue":"24","key":"9_CR16","doi-asserted-by":"publisher","first-page":"2094","DOI":"10.1049\/el:19931399","volume":"29","author":"L. Harn","year":"1993","unstructured":"L. Harn: Digital signature with (t,n) shared verification based on discrete logarithms. Electronics Letters, 29(24), 2094\u20132095 (1993)","journal-title":"Electronics Letters"},{"key":"9_CR17","volume-title":"Basic Algebra I. W. H","author":"N. Jacobson","year":"1985","unstructured":"N. Jacobson: Basic Algebra I. W. H. Freeman and Company, New York (1985)"},{"key":"9_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/3-540-46416-6_20","volume-title":"Advances in Cryptology \u2014 Eurocrypt\u2019 91","author":"T. P. Pedersen","year":"1991","unstructured":"T. P. Pedersen: Distributed provers with applications to undeniable signatures. In: D.W. Davies (ed.): Advances in Cryptology \u2014 Eurocrypt\u2019 91. Lecture Notes in Computer Science 547, Berlin: Springer 1991, pp. 221\u2013242"},{"key":"9_CR19","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. Commun. ACM, 22, 612\u2013613 (1979)","journal-title":"Commun. 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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T15:32:51Z","timestamp":1556724771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68339-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540611868","9783540683391"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-68339-9_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1996]]}}}