{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:53:42Z","timestamp":1764996822705,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540576006"},{"type":"electronic","value":"9783540482857"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-48285-7_10","type":"book-chapter","created":{"date-parts":[[2007,8,1]],"date-time":"2007-08-01T02:16:46Z","timestamp":1185934606000},"page":"118-125","source":"Crossref","is-referenced-by-count":50,"title":["Size of Shares and Probability of Cheating in Threshold Schemes"],"prefix":"10.1007","author":[{"given":"Marco","family":"Carpentieri","sequence":"first","affiliation":[]},{"given":"Alfredo","family":"De Santis","sequence":"additional","affiliation":[]},{"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, T. Rabin Verifiable Secret Sharing and Multiparty Protocols with Honest Majority, Proc. 21st ACM Symposium on Theory of Computing, pp. 73\u201385, 1989.","DOI":"10.1145\/73007.73014"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"G. R. Blakley, Safeguarding Cryptographic Keys, Proceedings AFIPS 1979 National Computer Conference, pp. 313\u2013317, 1979.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"10_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-CRYPTO 92","author":"C. Blundo","year":"1992","unstructured":"C. Blundo, A. De Santis, L. Gargano, and U. Vaccaro, On the Information Rate of Secret Sharing Schemes, \u201cAdvances in Cryptology-CRYPTO 92\u201d, Ed. E. Brickell, \u201cLecture Notes in Computer Science\u201d, Springer-Verlag, (to appear)."},{"key":"10_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-EUROCRYPT 92","author":"C. Blundo","year":"1992","unstructured":"C. Blundo, A. De Santis, D. R. Stinson, and U. Vaccaro, Graph Decomposition and Secret Sharing Schemes, \u201cAdvances in Cryptology-EUROCRYPT 92\u201d, Ed. R. Rueppel, \u201cLecture Notes in Computer Science\u201d, Springer-Verlag, (to appear)."},{"key":"10_CR5","doi-asserted-by":"crossref","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, J. Cryptology, Vol.4, 123\u2013134, 1991.","journal-title":"J. Cryptology"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF02451112","volume":"5","author":"E. F. Brickell","year":"1992","unstructured":"E. F. Brickell and D. R. Stinson, Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes, J. Cryptology, Vol. 5, pp. 153\u2013156, 1992.","journal-title":"J. Cryptology"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1137\/0404044","volume":"4","author":"E. F. Brickell","year":"1991","unstructured":"E. F. Brickell, D. R. Stinson, The Detection of Cheaters in Threshold Schemes, SIAM J. Disc. Math, Vol. 4, pp. 502\u2013510, 1991.","journal-title":"SIAM J. Disc. Math"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"R. M. Capocelli, A. De Santis, L. Gargano, U. Vaccaro, On the Size of Shares for Secret Sharing Schemes, Advances in Cryptology \u2014 CRYPTO\u2019 91, J. Feigenbaum (Ed.), Lectures Notes in Computer Science, Vol. 576, pp. 101\u2013113, 1992, Springer-Verlag. Also to appear in Journal of Cryptology.","DOI":"10.1007\/3-540-46766-1_7"},{"key":"10_CR9","unstructured":"I. Csisz\u00e1r and J. K\u00f6rner, Information Theory. Coding Theorems for Discrete Memoryless Systems, Academic Press, 1981."},{"key":"10_CR10","volume-title":"Cryptography and Data Security","author":"D. Denning","year":"1983","unstructured":"D. Denning, Cryptography and Data Security, Addison-Wesley, Reading, MA, 1983."},{"key":"10_CR11","volume-title":"Mathematical Statistics","author":"T.S. Ferguson","year":"1967","unstructured":"T.S. Ferguson, Mathematical Statistics, Academic Press, New York, 1967."},{"key":"10_CR12","doi-asserted-by":"publisher","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, pp. 35\u201341, 1983.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"10_CR13","volume-title":"Inequalities: Theory of Majorization and Its Applications","author":"A.W. Marshal","year":"1979","unstructured":"A.W. Marshal], I. Olkin, Inequalities: Theory of Majorization and Its Applications, Academic Press, New York, 1979."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R. J. McEliece","year":"1981","unstructured":"R. J. McEliece, D. V. Sarwate, On Sharing Secrets and Reed-Solomon Codes, Communications of the ACM, Vol. 24, pp. 583\u2013584, 1981.","journal-title":"Communications of the ACM"},{"key":"10_CR15","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, Communication of the ACM, Vol. 22, pp. 612\u2013613, 1979.","journal-title":"Communication of the ACM"},{"key":"10_CR16","first-page":"215","volume":"68","author":"G. Simmons","year":"1989","unstructured":"G. Simmons, Robust Shared Secret Schemes or \u201cHow to be Sure You Have the Right Answer Even Though You Do Not Know the Question\u201d, Congr. Numer., Vol. 68, pp. 215\u2013248, 1989.","journal-title":"Congr. Numer."},{"key":"10_CR17","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":"10_CR18","doi-asserted-by":"publisher","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":"10_CR19","unstructured":"D. R. Stinson, Decomposition Constructions for Secret Sharing Schemes, Technical Report UNL-CSE-92-020, Department of Computer Science and Engineering, University of Nebraska, September 1992."},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF02252871","volume":"1","author":"M. Tompa","year":"1988","unstructured":"M. Tompa, H. Woll, How to Share a Secret with Cheaters, Journal of Cryptology, Vol. 1, pp. 133\u2013139, 1988.","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201993"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48285-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T01:37:37Z","timestamp":1737337057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48285-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540576006","9783540482857"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-48285-7_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1994]]}}}