{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:23:51Z","timestamp":1753889031470,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540601760"},{"type":"electronic","value":"9783540447177"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0053422","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T04:05:50Z","timestamp":1149653150000},"page":"35-46","source":"Crossref","is-referenced-by-count":4,"title":["On the dealer's randomness required in secret sharing schemes"],"prefix":"10.1007","author":[{"given":"C.","family":"Blundo","sequence":"first","affiliation":[]},{"given":"A. Giorgio","family":"Gaggia","sequence":"additional","affiliation":[]},{"given":"D. R.","family":"Stinson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,23]]},"reference":[{"key":"4_CR1","first-page":"27","volume-title":"\u201cLecture Notes in Computer Science\u201d, Vol. 403","author":"J. C. Benaloh","year":"1990","unstructured":"J. C. Benaloh and J. Leichter, Generalized Secret Sharing and Monotone Functions, in \u201cAdvances in Cryptology \u2014 Crypto '88\u201d, S. Goldwasser Ed., \u201cLecture Notes in Computer Science\u201d, Vol. 403, Springer-Verlag, Berlin, pp. 27\u201335, 1990."},{"key":"4_CR2","volume-title":"Design Theory","author":"T. Beth","year":"1985","unstructured":"T. Beth, D. Jungnickel, and H. Lenz, Design Theory, Bibliographisches Institut, Zurich, 1985."},{"key":"4_CR3","first-page":"313","volume":"48","author":"G. R. Blakley","year":"1979","unstructured":"G. R. Blakley, Safeguarding Cryptographic Keys, Proceedings of AFIPS 1979 National Computer Conference, Vol. 48, New York, NY, pp. 313\u2013317, June 1979.","journal-title":"Proceedings of AFIPS 1979 National Computer Conference"},{"key":"4_CR4","first-page":"149","volume-title":"\u201cLecture Notes in Computer Science\u201d, Vol. 740","author":"C. Blundo","year":"1993","unstructured":"C. Blundo, A. De Santis, L. Gargano, and U. Vaccaro, On the Information Rate of Secret Sharing Schemes, in \u201cAdvances in Cryptology \u2014 CRYPTO '92\u201d, Ed. E. Brickell, \u201cLecture Notes in Computer Science\u201d, Vol. 740, Springer-Verlag, Berlin, pp. 149\u2013169, 1993. To appear in Theoretical Computer Science."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF00204801","volume":"8","author":"C. Blundo","year":"1995","unstructured":"C. Blundo, A. De Santis, D. R. Stinson, and U. Vaccaro, Graph Decomposition and Secret Sharing Schemes, Journal of Cryptology, Vol. 8, (1995), pp. 39\u201364. A preliminary version appeared in \u201cAdvances in Cryptology \u2014 Eurocrypt '92\u201d, Lecture Notes in Computer Science, Vol. 658, R. Rueppel Ed., Springer-Verlag, pp. 1\u201324, 1993.","journal-title":"Journal of Cryptology"},{"key":"4_CR6","first-page":"568","volume-title":"vol. 820 di \u201cLecture Notes in Computer Science\u201d","author":"C. Blundo","year":"1994","unstructured":"C. Blundo, A. De Santis, and U. Vaccaro, Randomness in Distribution Protocols, in \u201c21st International Colloquium on Automata, Languages and Programming\u201d (ICALP '94), Serge Abiteboul and Eli Shamir Eds., vol. 820 di \u201cLecture Notes in Computer Science\u201d, Springer-Verlag, Berlin, pp. 568\u2013579, 1994."},{"issue":"No.2","key":"4_CR7","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, No. 2, pp. 123\u2013124, 1991.","journal-title":"J. Cryptology"},{"issue":"No.3","key":"4_CR8","doi-asserted-by":"crossref","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, No. 3, pp. 153\u2013166, 1992.","journal-title":"J. Cryptology"},{"key":"4_CR9","first-page":"335","volume-title":"A Note on Secret Sharing Schemes, Sequences II: Methods in Communication, Security and Computer Science","author":"R. M. Capocelli","year":"1991","unstructured":"R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, A Note on Secret Sharing Schemes, Sequences II: Methods in Communication, Security and Computer Science, Springer-Verlag. Positano, Italy, pp. 335\u2013344, June 1991."},{"issue":"No.3","key":"4_CR10","doi-asserted-by":"publisher","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, No. 3, Pag. 157\u2013169, 1993.","journal-title":"Journal of Cryptology"},{"key":"4_CR11","unstructured":"I. Csisz\u00e1r and J. K\u00f6rner, Information Theory. Coding Theorems for Discrete Memoryless Systems, Academic Press, 1981."},{"key":"4_CR12","unstructured":"J. H. Dinitz and D. R. Stinson, Contemporary Design Theory. A Collection of Surveys, Wiley-Interscience Series in Discrete Mathematics and Optimization, 1992."},{"key":"4_CR13","volume-title":"Information Theory and Reliable Communications","author":"R. G. Gallager","year":"1968","unstructured":"R. G. Gallager, Information Theory and Reliable Communications, John Wiley & Sons, New York, NY, 1968."},{"key":"4_CR14","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"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and D. Zuckerman, How to Recycle Random Bits, Proceedings of 30th Annual Symposium of Computer Science, pp. 248\u2013255, 1989.","DOI":"10.1109\/SFCS.1989.63486"},{"key":"4_CR16","unstructured":"M. Ito, A. Saito, and T. Nishizeki, Secret Sharing Scheme Realizing General Access Structure, Proceedings of IEEE Global Telecommunications Conference, Globecom 87, Tokyo, Japan, pp. 99\u2013102, 1987."},{"issue":"No.1","key":"4_CR17","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, No. 1, pp. 35\u201341, Jan. 1983.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"D. Krizane, D. Peleg, and E. Upfal, A Time-Randomness Tradeoff for Oblivious Routing, Proceedings of 20th Annual ACM Symposium on Theory of Computing\u201d, pp. 93\u2013102, 1988.","DOI":"10.1145\/62212.62221"},{"key":"4_CR19","first-page":"65","volume":"14","author":"K.M. Martin","year":"1993","unstructured":"K.M. Martin, New Secret Sharing Schemes from Old, J. Comb. Math. Comb. Comp. Vol. 14, pp. 65\u201377, 1993.","journal-title":"J. Comb. Math. Comb. Comp."},{"key":"4_CR20","first-page":"143","volume":"5","author":"P. J. Schellenberg","year":"1989","unstructured":"P. J. Schellenberg and D. R. Stinson, Threshold Schemes from Combinatorial Designs, J. Combin. Math. and Combin. Computing, Vol. 5, pp. 143\u2013160, 1989.","journal-title":"J. Combin. Math. and Combin. Computing"},{"key":"4_CR21","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1090\/pspum\/019\/9959","volume":"19","author":"D. K. Ray-Chaudhuri","year":"1971","unstructured":"D. K. Ray-Chaudhuri and R. M. Wilson, Solution of Kirkman' s Schoolgirl Problem, Amer. Math. Soc. Proc. Symp. Pure Math., Vol. 19, pp. 187\u2013204, 1971.","journal-title":"Amer. Math. Soc. Proc. Symp. Pure Math."},{"issue":"n.11","key":"4_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":"4_CR23","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":"4_CR24","first-page":"170","volume-title":"\u201cLecture Notes in Computer Science\u201d, Vol. 740","author":"D. R. Stinson","year":"1993","unstructured":"D. R. Stinson, New General Lower Bounds on the Information Rate of Secret Sharing Schemes, in \u201cAdvances in Cryptology \u2014 CRYPTO '92\u201d, Ed. E. Brickell, \u201cLecture Notes in Computer Science\u201d, Vol. 740, Springer-Verlag, Berlin, pp. 170\u2013184, 1993."},{"key":"4_CR25","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":"4_CR26","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/18.272461","volume":"40","author":"D. R. Stinson","year":"1994","unstructured":"D. R. Stinson, Decomposition Constructions for Secret Sharing Schemes, IEEE Trans. Inform. Theory Vol. 40 (1994), pp. 118\u2013125.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"D. R. Stinson, Combinatorial Designs and Cryptography, in \u201cSurveys in Combinatorics, 1993\u201d, K. Walker Ed., Cambridge Univ. Press, pp. 257\u2013287.","DOI":"10.1017\/CBO9780511662089.010"},{"key":"4_CR28","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0401024","volume":"1","author":"D. R. Stinson","year":"1988","unstructured":"D. R. Stinson and A. Vanstone, A Combinatorial Approach to Threshold Schemes, SIAM J. Disc. Math., Vol. 1, May 1988, pp. 230\u2013236.","journal-title":"SIAM J. Disc. Math."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT'94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0053422","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T06:59:37Z","timestamp":1736405977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0053422"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601760","9783540447177"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/bfb0053422","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}