{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:50Z","timestamp":1725490250232},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_26","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T01:32:38Z","timestamp":1188351158000},"page":"292-304","source":"Crossref","is-referenced-by-count":6,"title":["Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Di Crescenzo","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"J. C. Benaloh, J. Leichter, Generalized Secret Sharing and Monotone Functions, Proc. of CRYPTO 88.","DOI":"10.1007\/0-387-34799-2_3"},{"key":"26_CR2","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."},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1008216403325","volume":"11","author":"C. Blundo","year":"1997","unstructured":"C. Blundo, A. De Santis, R. De Simone, and U. Vaccaro, Tight Bounds on the Information Rate of Secret Sharing Schemes, Design, Codes, and Cryptography, vol. 11, 1997, pp. 107\u2013122.","journal-title":"Design, Codes, and Cryptography"},{"key":"26_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/3-540-48658-5_17","volume-title":"Advances in Cryptology-CRYPTO 94","author":"C. Blundo","year":"1994","unstructured":"C. Blundo, A. De Santis, G. Di Crescenzo, A. Giorgio Gaggia and U. Vaccaro, Multi-Secret Sharing Schemes, in \u201cAdvances in Cryptology-CRYPTO 94\u201d, Lecture Notes in Computer Science, vol. 839, Springer Verlag, pp. 150\u2013163."},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0304-3975(95)00065-8","volume":"154","author":"C. Blundo","year":"1996","unstructured":"C. Blundo, A. De Santis, L. Gargano and U. Vaccaro, On the Information Rate of Secret Sharing Schemes, in Theoretical Computer Science, vol. 154, pp. 283\u2013306, 1996 (previous version in CRYPTO 92).","journal-title":"Theoretical Computer Science"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis, A. Giorgio Gaggia, and U. Vaccaro, New Bounds on the Information Rate of Secret Sharing Schemes, in IEEE Transactions on Information Theory, vol. IT-41, n. 2, march 1955.","DOI":"10.1109\/18.370169"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis, and U. Vaccaro, Efficient Sharing of Many Secrets, in Proceedings of STACS 93.","DOI":"10.1007\/3-540-56503-5_68"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"57","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, pp. 57\u2013167, 1993.","journal-title":"Journal of Cryptology"},{"issue":"4","key":"26_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s001459900029","volume":"10","author":"L. Csirmaz","year":"1997","unstructured":"L. Csirmaz, The Size of a Share Must be Large, Journal of Cryptology, Vol. 10, n. 4, pp. 223\u2013231, 1997.","journal-title":"Journal of Cryptology"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"T. Cover and J. Thomas, Elements of Information Theory, John Wiley and Sons, 1991.","DOI":"10.1002\/0471200611"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"G. Di Crescenzo, Sharing One Secret vs. Sharing Many Secrets: Tight Bounds on The Average Improvement Ratio, in Proceedings of SODA 2000.","DOI":"10.1007\/3-540-44683-4_26"},{"key":"26_CR12","unstructured":"G. Di Crescenzo and R. Impagliazzo, Proofs of Membership vs. Proofs of Knowledge, in Proceedings of Computational Complexity 1998."},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"T. Feder, E. Kushilevitz, and M. Naor, Amortized Communication Complexity, in Proceedings of FOCS 91, 1991, pp. 239\u2013248.","DOI":"10.1109\/SFCS.1991.185374"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, R. Raz and A. Wigderson, A direct product theorem, in Proceedings of 11th Annual IEEE Conference on Structure in Complexity Theory, 1994.","DOI":"10.1109\/SCT.1994.315814"},{"key":"26_CR15","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":"3","key":"26_CR16","first-page":"287","volume":"9","author":"W. Jackson","year":"1996","unstructured":"W. Jackson, K. Martin, and C. O\u2019Keefe, Multi-Secret Threshold Schemes, in Design, Codes and Cryptography, vol. 9, n. 3, pp. 287\u2013303, 1996.","journal-title":"Design, Codes and Cryptography"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900014","volume":"9","author":"W. Jackson","year":"1996","unstructured":"W. Jackson, K. Martin, and C. O\u2019Keefe, Ideal Secret Sharing Schemes with Multiple Secrets, in Journal of Cryptology, Vol. 9, pp. 233\u2013250, 1996.","journal-title":"Journal of Cryptology"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"M. Karchmer, and A. Wigderson, On Span Programs, in Proceedings of 8th Annual IEEE Conference on Structure in Complexity Theory, 1993.","DOI":"10.1109\/SCT.1993.336536"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"N. Nisan, S. Rudich and M. Saks, Products and Help Bits in Decision Trees, in Proceedings of FOCS 94, 1994, pp. 318\u2013329.","DOI":"10.1109\/SFCS.1994.365683"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"R. Raz, A parallel repetition theorem, in Proceedings of STOC 95.","DOI":"10.1145\/225058.225181"},{"issue":"11","key":"26_CR21","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, n. 11, November 1979, pp. 612\u2013613.","journal-title":"Communication of the ACM"},{"key":"26_CR22","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"D. R. Stinson","year":"1992","unstructured":"D. R. Stinson, Decomposition Constructions for Secret Sharing Schemes, Design, Codes and Cryptography, Vol. 2, pp. 357\u2013390, 1992.","journal-title":"Design, Codes and Cryptography"},{"key":"26_CR23","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":"26_CR24","unstructured":"D. R. Stinson, Bibliography on Secret Sharing Schemes, http:\/\/bibd.unl.edu\/stin-son\/ssbib.html , October 2, 1997."},{"key":"26_CR25","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF01398012","volume":"6","author":"M. Dijk van","year":"1995","unstructured":"M. van Dijk, On the Information Rate of Perfect Secret Sharing Schemes, in Design, Codes and Cryptography, vol. 6, pp. 143\u2013169, 1995.","journal-title":"Design, Codes and Cryptography"},{"key":"26_CR26","doi-asserted-by":"crossref","unstructured":"A. Yao, Coherent Functions and Program Checkers, in Proceedings of STOC 90.","DOI":"10.1145\/100216.100226"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:27:45Z","timestamp":1556818065000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}