{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T07:15:56Z","timestamp":1742800556701,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578437"},{"type":"electronic","value":"9783540483571"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57843-9_11","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:28:40Z","timestamp":1330262920000},"page":"82-89","source":"Crossref","is-referenced-by-count":8,"title":["Secret sharing schemes with veto capabilities"],"prefix":"10.1007","author":[{"given":"C.","family":"Blundo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Santis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Gargano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U.","family":"Vaccaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"issue":"no.2","key":"11_CR1","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/TIT.1983.1056651","volume":"IT-29","author":"C. Asmuth","year":"1983","unstructured":"C. Asmuth and J. Bloom, A Modular Approach to Key Safeguarding, IEEE Trans. on Inform. Theory, vol. IT-29, no. 2, Mar. 1983, pp. 208\u2013210.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"A. Beutelspacher, How to Say \u2018No', in \u201cAdvances in Cryptology \u2014 EUROCRYPT 89\u201d, vol. 434 of \u201cLecture Notes in Computer Science\u201d, Springer-Verlag, pp. 491\u2013496.","DOI":"10.1007\/3-540-46885-4_47"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"J. C. Benaloh and J. Leichter, Generalized Secret Sharing and Monotone Functions, in \u201cAdvances in Cryptology \u2014 CRYPTO 88\u201d, Ed. S. Goldwasser, vol. 403 of \u201cLecture Notes in Computer Science\u201d, Springer-Verlag, pp. 27\u201336.","DOI":"10.1007\/0-387-34799-2_3"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"G. R. Blakley, Safeguarding Cryptographic Keys, Proceedings AFIPS 1979 National Computer Conference, pp. 313\u2013317, June 1979.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis, L. Gargano, and U. Vaccaro, On the Information Rate of Secret Sharing Schemes, in: Advances in Cryptology \u2014 CRYPTO '92, E. Brickell (Ed.), Lectures Notes in Computer Science, vol. 740, pp. 149\u2013169, 1993, Springer-Verlag.","DOI":"10.1007\/3-540-48071-4_11"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis, D. R. Stinson, and U. Vaccaro, Graph Decomposition and Secret Sharing Schemes, in \u201cAdvances in Cryptology \u2014 EUROCRYPT 92\u201d, Lecture Notes in Computer Science, Vol. 658, R. Rueppel (Bd.), Springer-Verlag, pp. 1\u201324, 1993. Also to appear in: Journal of Cryptology.","DOI":"10.1007\/3-540-47555-9_1"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis, A. Gaggia, and U. Vaccaro, New Bounds on the Information Rate of Secret Sharing Scheme, IEEE Transactions on Information Theory, to appear.","DOI":"10.1109\/18.370169"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis, and U. Vaccaro, Efficient Sharing of Many Secrets, STACS '93, 10th Annual Symposium on Theoretical Aspects of Computer Science, P. Enjalbert, A. Finkel, and K. W. Wagner (Eds.), Lecture Notes in Computer Science, vol. 665, Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56503-5_68"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. Cresti, A. De Santis, and U. Vaccaro, Fully Dynamic Secret Sharing Schemes, in: Advances in Cryptology \u2014 CRYPTO '93, D. Stinson (Ed.), Lectures Notes in Computer Science, Springer-Verlag, to appear.","DOI":"10.1007\/3-540-48329-2_10"},{"issue":"No.3","key":"11_CR10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF02451112","volume":"6","author":"E. F. Brickell","year":"1992","unstructured":"E. F. Brickell, and D. R. Stinson, Improved Bounds on the Information Rate of Perfect Secret Sharing Schemel, J. Cryptology, vol. 6, No. 3, pp. 153\u2013166, 1992.","journal-title":"J. Cryptology"},{"key":"11_CR11","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1137\/0404044","volume":"4","author":"E. F. Brickell","year":"1991","unstructured":"E. F. Brickell and D. R. Stinson, The Detection of Cheaters in Threshold Schemes, SIAM J. on Discrete Math., vol. 4, pp. 502\u2013510, 1991.","journal-title":"SIAM J. on Discrete Math."},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00198463","volume":"6","author":"R. M. Capocelli","year":"1993","unstructured":"R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, On the Size of Shares for Secret Sharing Schemes, Journal of Cryptology, vol. 6, (1993), 157\u2013167.","journal-title":"Journal of Cryptology"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, How to Play any Mental Game, Proceedings of 19th ACM Symp. on Theory of Computing, pp. 218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"issue":"no.1","key":"11_CR14","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"IT-29","author":"E. D. Karnin","year":"1983","unstructured":"E. D. Karnin, J. W. Greene, and M. E. Hellman, On Secret Sharing Systems, IEEE Trans. on Inform. Theory, vol. IT-29, no. 1, Jan. 1983, pp. 35\u201341.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"11_CR15","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/3-540-46877-3_24","volume":"473","author":"I. Ingemarson","year":"1991","unstructured":"I. Ingemarson and G. J. Simmons, A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutually Trusted Party, Lecture Notes in Computer Science, vol. 473, pp. 266\u2013282, 1991.","journal-title":"Lecture Notes in Computer Science"},{"key":"11_CR16","unstructured":"M. Ito, A. Saito, and T. Nishizeki, Secret Sharing Scheme Realizing General Access Structure, Proc. IEEE Global Telecommunications Conf., Globecom 87, Tokyo, Japan, 1987."},{"issue":"n.9","key":"11_CR17","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R. J. McEliece","year":"1981","unstructured":"R. J. McEliece and D. Sarwate, On Sharing Secrets and Reed-Solomon Codes, Communications of the ACM, vol. 24, n. 9, pp. 583\u2013584, September 1981.","journal-title":"Communications of the ACM"},{"key":"11_CR18","volume-title":"The Theory of Error-Correcting Codes","author":"F. J. MacWilliams","year":"1977","unstructured":"F. J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977."},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"T. Rabin and M. Ben-Or, Verifiable Secret Sharing and Multiparty Protocols with Honest Majority, Proc. 21st ACM Symp. on Theory of Computing, pp. 73\u201385, 1989.","DOI":"10.1145\/73007.73014"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"I. S. Reed and G. Solomon, Polynomial Codes over Certain Finite Fields, SIAM J. Appl. Math., pp. 300\u2013304, June 1960.","DOI":"10.1137\/0108018"},{"key":"11_CR21","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1109\/TIT.1977.1055732","volume":"23","author":"D. Sarwate","year":"1977","unstructured":"D. Sarwate, On the Complexity of Decoding Goppa Codes, IEEE Trans. Inform. Theory, vol. 23, pp. 616\u2013516, July 1977.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"n.11","key":"11_CR22","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, vol. 22, n. 11, pp. 612\u2013613, Nov. 1979.","journal-title":"Communications of the ACM"},{"key":"11_CR23","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"D. R. Stinson","year":"1992","unstructured":"D. R. Stinson, An Explication of Secret Sharing Schemes, Design, Codes and Cryptography, vol. 2, pp. 357\u2013390, 1992.","journal-title":"Design, Codes and Cryptography"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"D. R. Stinson, New General Lower Bounds on the Information Rate of Secret Sharing Schemes, Proceedings of Crypto '92, Advances in Cryptology, Lecture Notes in Computer Science, E. Brickell Ed., Springer-Verlag, (to appear).","DOI":"10.1007\/3-540-48071-4_12"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"G.J. Simmons, An Introduction to Shared Secret and\/or Shared Control Schemes and Their Application, Contemporary Cryptology, IEEE Press, pp. 441\u2013497, 1991.","DOI":"10.1007\/3-540-38424-3_16"},{"key":"11_CR26","first-page":"215","volume":"8","author":"G. J. Simmons","year":"1989","unstructured":"G.J. Simmons, Robust Shared Secret Schemes or \u201cHow to be Sure You Have the Right Answer even though You don't Know the Question\u201d, Congressus Numerantium, vol. 8, pp. 215\u2013248, 1989.","journal-title":"Congressus Numerantium"},{"key":"11_CR27","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1007\/3-540-46885-4_44","volume":"434","author":"G. J. Simmons","year":"1990","unstructured":"G. J. Simmons, Prepositioned Shared Secret and\/or Shared Control Schemes, Lecture Notes in Computer Science, vol. 434, pp. 436\u2013467, 1990.","journal-title":"Lecture Notes in Computer Science"},{"issue":"No.2","key":"11_CR28","doi-asserted-by":"crossref","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 J. Disc. Math., vol. 1, No. 2, May 1988, pp. 230\u2013236.","journal-title":"SIAM J. Disc. Math."},{"key":"11_CR29","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF02252871","volume":"1","author":"M. Tompa","year":"1988","unstructured":"M. Tompa and H. Woll, How to Share a Secret with Cheaters, J. Cryptology, vol. 1, pp. 133\u2013138, 1988. (Also, Crypto '86, pp. 261\u2013265.)","journal-title":"J. Cryptology"}],"container-title":["Lecture Notes in Computer Science","Algebraic Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57843-9_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:14:45Z","timestamp":1742595285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57843-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578437","9783540483571"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-57843-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}