{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:21Z","timestamp":1759638501440},"publisher-location":"Berlin, Heidelberg","reference-count":14,"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_10","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:31:14Z","timestamp":1186363874000},"page":"107-118","source":"Crossref","is-referenced-by-count":31,"title":["Efficient Multiplicative Sharing Schemes"],"prefix":"10.1007","author":[{"given":"Simon R.","family":"Blackburn","sequence":"first","affiliation":[]},{"given":"Mike","family":"Burmester","sequence":"additional","affiliation":[]},{"given":"Yvo","family":"Desmedt","sequence":"additional","affiliation":[]},{"given":"Peter R.","family":"Wild","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"10_CR1","series-title":"Lect Notes Comput Sci","first-page":"251","volume-title":"Advances in Cryptology \u2014 Crypto\u2019 86, Proceedings","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 \u2014 Crypto\u2019 86, Proceedings. Lecture Notes in Computer Science 263. Berlin: Springer 1987, pp. 251\u2013260"},{"key":"10_CR2","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":"10_CR3","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), IEEE Press 1994, pp. 522\u2013533. Full paper in preparation (available from authors when completed)","DOI":"10.1145\/195058.195405"},{"key":"10_CR4","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, Proceedings","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, Proceedings. Lecture Notes in Computer Science 917. Berlin: Springer 1995, pp. 21\u201332"},{"key":"10_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Advances in Cryptology \u2014 Crypto\u2019 89, Proceedings","author":"Y. Desmedt","year":"1990","unstructured":"Y. Desmedt and Y. Frankel: Threshold cryptosystems. In: G. Brassard (ed.): Advances in Cryptology \u2014 Crypto\u2019 89, Proceedings. Lecture Notes in Computer Science 435. Berlin: Springer 1990, pp. 307\u2013315"},{"key":"10_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/3-540-46766-1_37","volume-title":"Advances in Cryptology \u2014 Crypto\u2019 91, Proceedings","author":"Y. Desmedt","year":"1992","unstructured":"Y. Desmedt and Y. Frankel. Shared generation of authenticators and signatures. In: J. Feigenbaum (ed.): Advances in Cryptology \u2014 Crypto\u2019 91, Proceedings. Lecture Notes in Computer Science 576. Berlin: Springer 1992, pp 457\u2013469"},{"issue":"4","key":"10_CR7","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1137\/S0895480192224713","volume":"7","author":"Y. Desmedt","year":"1994","unstructured":"Y. Desmedt and 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":"10_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-47555-9_2","volume-title":"Advances in Cryptology \u2014 Eurocrypt\u2019 92, Proceedings","author":"Y. Frankel","year":"1993","unstructured":"Y. Frankel and Y. Desmedt. Classification of ideal homomorphic threshold schemes over finite Abelian groups. In: R.A. Rueppel (ed.): Advances in Cryptology \u2014 Eurocrypt\u2019 92, Proceedings. Lecture Notes in Computer Science 658. Berlin: Springer 1993, pp 25\u201334"},{"key":"10_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/3-540-48071-4_39","volume-title":"Advances in Cryptology \u2014 Crypto\u2019 92, Proceedings","author":"Y. Frankel","year":"1993","unstructured":"Y. Frankel, Y. Desmedt and M. Burmester. Non-existence of homomorphic general sharing schemes for some key spaces. In: E.F. Brickell (ed.): Advances in Cryptology \u2014 Crypto\u2019 92, Proceedings. Lecture Notes in Computer Science 740. Berlin: Springer 1993, pp 549\u2013557"},{"issue":"4","key":"10_CR10","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."},{"issue":"1","key":"10_CR11","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":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"29","author":"E.D. Karnin","year":"1983","unstructured":"E.D. Karnin, J.W. Greene, and M. Hellman: On secret sharing systems. IEEE Trans. Inform. Theory, 29(1), 35\u201341 (1983)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10_CR13","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"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/TIT.1964.1053661","volume":"IT-10","author":"R.C. Singleton","year":"1964","unstructured":"R.C. Singleton: Maximal distance q-nary codes. IEEE Trans. Inform. Theory, IT-10, 116\u2013118 (1964)","journal-title":"IEEE Trans. Inform. Theory"}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T00:31:50Z","timestamp":1550709110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68339-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540611868","9783540683391"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-68339-9_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1996]]}}}