{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:00:45Z","timestamp":1762297245508},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48071-4_39","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T21:23:49Z","timestamp":1186349029000},"page":"549-557","source":"Crossref","is-referenced-by-count":12,"title":["Non-existence of homomorphic general sharing schemes for some key spaces"],"prefix":"10.1007","author":[{"given":"Yair","family":"Frankel","sequence":"first","affiliation":[]},{"given":"Yvo","family":"Desmedt","sequence":"additional","affiliation":[]},{"given":"Mike","family":"Burmester","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"publisher","first-page":"685","DOI":"10.2307\/1968960","volume":"43","author":"A. A. Albert","year":"1942","unstructured":"Albert, A. A., Non-associative algebras: Fundamental concepts and isotopy. Annals of Mathematics 43 (1942) 685\u2013707","journal-title":"Annals of Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A., Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the twentieth annual ACM Symp. Theory of Computing, STOC (May 2\u20134, 1988) pp. 1\u201310","key":"39_CR2","DOI":"10.1145\/62212.62213"},{"key":"39_CR3","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":"Benaloh, J. C., Secret sharing homomorphisms: Keeping shares of a secret secret. In Advances in Cryptology, Proc. of Crypto\u2019 86 (Lecture Notes in Computer Science 263) (1987) A. Odlyzko. Ed. Springer-Verlag pp. 251\u2013260"},{"key":"39_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"Advances in Cryptology. Proc. of Crypto\u2019 88","author":"J. C. Benaloh","year":"1990","unstructured":"Benaloh, J. C., Leichter, J.: Generalized secret sharing and monotone functions. In Advances in Cryptology. Proc. of Crypto\u2019 88 (Lecture Notes in Computer Science 403) (1990) S. Goldwasser, Ed. Springer-Verlag pp. 27\u201335"},{"unstructured":"Blakley, G. R., Safeguarding cryptographic keys. In Proc. Nat. Computer Conf. AFIPS Conf. Proc. (1979) pp. 313\u2013317","key":"39_CR5"},{"doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C. Damg\u00e0rd, L.: Multiparty unconditionally secure protocols. In Proceedings of the twentieth annual ACM Symp. Theory of Computing. STOC (May 2\u20134, 1988) pp. 11\u201319","key":"39_CR6","DOI":"10.1145\/62212.62214"},{"key":"39_CR7","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":"Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In Advances in Cryptology \u2014 Crypto\u2019 89, Proceedings (Lecture Notes in Computer Science 435) (1990) G. Brassard, Ed. Springer-Verlag pp. 307\u2013315"},{"key":"39_CR8","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":"Desmedt, Y., Frankel, Y.: Shared generation of authenticators and signatures. In Advances in Cryptology \u2014 Crypto\u2019 91, Proceedings (Lecture Notes in Computer Science 576) (1992) J. Feigenbaum. Ed. Springer-Verlag pp. 457\u2013469"},{"unstructured":"Desmedt, Y., Frankel, Y.: Perfect zero-knowledge sharing schemes over any finite Abelian group. Presented at Sequences\u2019 91. June 17\u201322, 1991, Positano, Italy, to appear in: the Proceedings, Springer-Verlag 1991","key":"39_CR9"},{"unstructured":"Franklin, M., Yung, M.: Communication complexity of secure computation. In Proceedings of the twenty fourth annual ACM Symp. Theory of Computing, STOC (1992) pp. 699\u2013710","key":"39_CR10"},{"doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In Proceedings of the Nineteenth annual ACM Symp. Theory of Computing. STOC (May 25\u201327, 1987) pp. 218\u2013229","key":"39_CR11","DOI":"10.1145\/28395.28420"},{"key":"39_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/3-540-46877-3_32","volume-title":"Advances in Cryptology, Proc. of Eurocrypt\u2019 90","author":"T. Hwang","year":"1991","unstructured":"Hwang, T.: Cryptosystems for group oriented cryptography. In Advances in Cryptology, Proc. of Eurocrypt\u2019 90 (Lecture Notes in Computer Science 473) (1991) I. Damg\u00e5rd, Ed. Springer-Verlag pp. 352\u2013360"},{"unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structures. In Proc. IEEE Global Telecommunications Conf., Globecom\u2019 87 (1987) IEEE Communications Soc. Press pp. 99\u2013102","key":"39_CR13"},{"key":"39_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF00206323","volume":"1","author":"B. S. Kaliski Jr.","year":"1988","unstructured":"Kaliski, Jr., B. S., Rivest, R. L., Sherman, A. T.: Is the Data Encryption Standard a group? (results of cycling experiments on DES. Journal of Cryptology 1 (1988) 3\u201336","journal-title":"Journal of Cryptology"},{"key":"39_CR15","series-title":"Lect Notes Comput Sci","volume-title":"Generalized threshold cryptosystems","author":"C.-S. Laih","year":"1991","unstructured":"Laih, C.-S., Harn, L.: Generalized threshold cryptosystems. Presented at Asiacrypt\u2019 91. November 11\u201314. 1991. Fujiyoshida, Yamanashi, Japan, to appear in: Advances in Cryptology. Proc. of Asiacrypt\u2019 91 (Lecture Notes in Computer Science), Springer-Verla"},{"key":"39_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Advances in Cryptology, Proc. of Eurocrypt\u2019 91","author":"T. P. Pedersen","year":"1991","unstructured":"Pedersen, T. P.: A threshold cryptosystem without a trusted party. In Advances in Cryptology, Proc. of Eurocrypt\u2019 91 (Lecture Notes in Computer Science 547) (April 1991) D. W. Davies. Ed. Springer-Verlag pp. 522\u2013526"},{"key":"39_CR17","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22 (1979) 612\u2013613","journal-title":"Commun. ACM"},{"doi-asserted-by":"crossref","unstructured":"Yao, A. C.: How to generate and exchange secrets. In The Computer Society of IEEE, 27th Annual Symp. on Foundations of Computer Science (FOCS) (1986) IEEE Computer Society Press pp. 162\u2013167","key":"39_CR18","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48071-4_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:50:16Z","timestamp":1619556616000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48071-4_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540573401"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-48071-4_39","relation":{},"subject":[]}}