{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:53:37Z","timestamp":1764996817393},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540564133"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-47555-9_2","type":"book-chapter","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T19:23:49Z","timestamp":1186601029000},"page":"25-34","source":"Crossref","is-referenced-by-count":9,"title":["Classification of Ideal Homomorphic Threshold Schemes over Finite Abelian Groups"],"prefix":"10.1007","author":[{"given":"Yair","family":"Frankel","sequence":"first","affiliation":[]},{"given":"Yvo","family":"Desmedt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_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, editor, Advances in Cryptology, Proc. of Crypto\u2019 86 (Lecture Notes in Computer Science 263), pp. 251\u2013260. Springer-Verlag, 1987. Santa Barbara, California, U.S.A., August 11\u201315."},{"key":"2_CR2","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":"J. C. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. In S. Goldwasser, editor, Advances in Cryptology, Proc. of Crypto\u2019 88 (Lecture Notes in Computer Science 403), pp. 27\u201335. Springer-Verlag, 1990. Santa Barbara, California, U.S.A., August 11\u201315."},{"key":"2_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., pp. 313\u2013317, 1979, vol.48.","journal-title":"Proc. Nat. Computer Conf. AFIPS Conf. Proc."},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"E. F. Brickell","year":"1991","unstructured":"E. F. Brickell and D. M. Davenport. On the classification of ideal secret sharing schemes. Journal of Cryptology, 4(2), pp. 123\u2013134, 1991.","journal-title":"Journal of Cryptology"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"G. I. Davida, R. DeMillo, and R. Lipton. Protecting shared cryptographic keys. In Proceedings of the 1980 Symposium on Security and Privacy, pp. 100\u2013102. IEEE Computer Society, April 1980. IEEE Catalog No. 80 CH1522-2.","DOI":"10.1109\/SP.1980.10011"},{"key":"2_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, Proc. of Crypto\u2019 91","author":"Y. Desmedt","year":"1992","unstructured":"Y. Desmedt and Y. Frankel. Shared generation of authenticators and signatures. In J. Feigenbaum, editor, Advances in Cryptology, Proc. of Crypto\u2019 91 (Lecture Notes in Computer Science 576), pp. 457\u2013469. Springer-Verlag, 1992. Santa Barbara, California, U.S.A., August 11\u201315."},{"key":"2_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-55966-3","volume-title":"Non-existence of homomorphic general sharing schemes for some key spaces","author":"Y. Frankel","year":"1992","unstructured":"Y. Frankel, Y. Desmedt, and M. Burmester. Non-existence of homomorphic general sharing schemes for some key spaces. To be presented at Crypto\u2019 92, to appear in: Advances in Cryptology. Proc. of Crypto\u2019 92 (Lecture Notes in Computer Science), Springer-Verlag, 1992."},{"key":"2_CR8","volume-title":"Information Theory and Reliable Communications","author":"R. G. Gallager","year":"1968","unstructured":"R. G. Gallager. Information Theory and Reliable Communications. John Wiley and Sons, New York, 1968."},{"key":"2_CR9","unstructured":"M. Ito, A. Saito, and T. Nishizeki. Secret sharing schemes realizing general access structures (in English). In Proc. IEEE Global Telccommunications Conf., Globecom\u2019 87, pp. 99\u2013102, Washington, DC., 1987. IEEE Communications Soc. Press. Also in \u201cTrans. IEICE Japan\u201d Vol. J71-A, No. 8, 1988 (in Japanese)."},{"key":"2_CR10","volume-title":"Basic Algebra I","author":"N. Jacobson","year":"1985","unstructured":"N. Jacobson. Basic Algebra I. W. H. Freeman and Company, New York, 2nd edition, 1985.","edition":"2nd edition"},{"issue":"1","key":"2_CR11","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 Tr. Inform. Theory, 29(1), pp. 35\u201341, January 1983.","journal-title":"IEEE Tr. Inform. Theory"},{"issue":"9","key":"2_CR12","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R. J. McEliece","year":"1981","unstructured":"R. J. McEliece and D. V. Sarwate. On sharing secrets and Reed-Solomon codes. Comm. ACM, 24(9), pp. 583\u2013584, September 1981.","journal-title":"Comm. ACM"},{"issue":"2","key":"2_CR13","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1145\/62044.62050","volume":"36","author":"M. Rabin","year":"1989","unstructured":"M. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM, 36(2), pp. 335\u2013348, April 1989.","journal-title":"Journal of the ACM"},{"key":"2_CR14","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, pp. 612\u2013613. November 1979.","journal-title":"Commun. ACM"},{"key":"2_CR15","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C. E. Shannon","year":"1949","unstructured":"C. E. Shannon. Communication theory of secrecy systems. Bell System Techn. Jour., 28, pp. 656\u2013715, October 1949.","journal-title":"Bell System Techn. Jour."},{"key":"2_CR16","first-page":"71","volume":"1","author":"G. J. Simmons","year":"1991","unstructured":"G. J. Simmons, W. Jackson, and K. Martin. The geometry of shared secret schemes. Bulletin of the Institute of Combinatorics and its Applications, 1, pp. 71\u201388, 1991.","journal-title":"Bulletin of the Institute of Combinatorics and its Applications"},{"issue":"2","key":"2_CR17","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0401024","volume":"1","author":"D. R. Stinson","year":"1988","unstructured":"D. R. Stinson and S. A. Vanstone. A combinatorial approach to threshold schemes. SIAM Journal on Discrete Mathematics, 1(2), pp. 230\u2013236, 1988.","journal-title":"SIAM Journal on Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT\u2019 92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47555-9_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:13:56Z","timestamp":1605629636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47555-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540564133"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-47555-9_2","relation":{},"subject":[]}}