{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:27:17Z","timestamp":1754486837615},"reference-count":28,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3819,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0304-3975(02)00399-7","type":"journal-article","created":{"date-parts":[[2003,2,28]],"date-time":"2003-02-28T19:20:13Z","timestamp":1046460013000},"page":"123-140","source":"Crossref","is-referenced-by-count":27,"title":["Sharing one secret vs. sharing many secrets"],"prefix":"10.1016","volume":"295","author":[{"given":"Giovanni Di","family":"Crescenzo","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00399-7_BIB1","doi-asserted-by":"crossref","unstructured":"J.C. Benaloh, J. Leichter, Generalized secret sharing and monotone functions, in: Advances in Cryptology\u2014CRYPTO 88, Lecture Notes in Computer Science, Vol. 403, Springer, Berlin, pp. 27\u201335.","DOI":"10.1007\/0-387-34799-2_3"},{"key":"10.1016\/S0304-3975(02)00399-7_BIB2","doi-asserted-by":"crossref","unstructured":"G.R. Blakley, Safeguarding cryptographic keys, in: Proceedings of the National Computer Conference 1979, Vol. 48 of American Federation of Information Processing Societies Proceedings, 1979, pp 313\u2013317.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"10.1016\/S0304-3975(02)00399-7_BIB3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1008216403325","article-title":"Tight bounds on the information rate of secret sharing schemes","volume":"11","author":"Blundo","year":"1997","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/S0304-3975(02)00399-7_BIB4","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis, G. Di Crescenzo, A. Giorgio Gaggia, U. Vaccaro, Multi-secret sharing schemes, in: Advances in Cryptology\u2014CRYPTO 94, Lecture Notes in Computer Science, Vol. 839, Springer, Berlin, pp. 150\u2013163.","DOI":"10.1007\/3-540-48658-5_17"},{"key":"10.1016\/S0304-3975(02)00399-7_BIB5","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0304-3975(95)00065-8","article-title":"On the information rate of secret sharing schemes","volume":"154","author":"Blundo","year":"1996","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S0304-3975(02)00399-7_BIB6","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1109\/18.370169","article-title":"New bounds on the information rate of secret sharing schemes","volume":"IT-41","author":"Blundo","year":"1995","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(02)00399-7_BIB7","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis, U. Vaccaro, Efficient sharing of many secrets, in: Proc. Symp. on Theoretical Aspects of Computer Science (STACS\u201993), Lecture Notes in Computer Science, Vol. 665, Springer, Berlin, pp. 692\u2013703.","DOI":"10.1007\/3-540-56503-5_68"},{"key":"10.1016\/S0304-3975(02)00399-7_BIB8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF00198463","article-title":"On the size of shares for secret sharing schemes","volume":"6","author":"Capocelli","year":"1993","journal-title":"J. Cryptol."},{"year":"1991","series-title":"Elements of Information Theory","author":"Cover","key":"10.1016\/S0304-3975(02)00399-7_BIB9"},{"issue":"4","key":"10.1016\/S0304-3975(02)00399-7_BIB10","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s001459900029","article-title":"The size of a share must be large","volume":"10","author":"Csirmaz","year":"1997","journal-title":"J. Cryptol."},{"key":"10.1016\/S0304-3975(02)00399-7_BIB11","doi-asserted-by":"crossref","unstructured":"G. Di Crescenzo, Sharing one secret vs. sharing many secrets: tight bounds on the average improvement ratio, in: Proc. 11th Annu. ACM-SIAM Symp. on Discrete Algorithms (SODA 2000), San Francisco, pp. 273\u2013274.","DOI":"10.1016\/S0304-3975(02)00399-7"},{"key":"10.1016\/S0304-3975(02)00399-7_BIB12","doi-asserted-by":"crossref","unstructured":"G. Di Crescenzo, Sharing one secret vs. sharing many secrets: tight bounds on the max improvement ratio, in: Proc. Mathematical Foundations of Computer Science 2001 (MFCS 2001), Lecture Notes in Computer Science, Vol. 2136, Springer, Berlin, pp. 292\u2013303.","DOI":"10.1007\/3-540-44683-4_26"},{"key":"10.1016\/S0304-3975(02)00399-7_BIB13","doi-asserted-by":"crossref","unstructured":"G. Di Crescenzo, R. Impagliazzo, Proofs of membership vs. proofs of knowledge, in: Proc. IEEE Conf. on Computational Complexity, 1998, pp. 34\u201345.","DOI":"10.1109\/CCC.1998.694589"},{"issue":"4","key":"10.1016\/S0304-3975(02)00399-7_BIB14","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1137\/S0097539792235864","article-title":"Amortized Communication Complexity","volume":"24","author":"Feder","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(02)00399-7_BIB15","doi-asserted-by":"crossref","unstructured":"M. Franklin, M. Yung, Communication complexity of secure computation, in: Proc. 24th ACM Symp. on Theory of Computing (STOC 1992), pp. 699\u2013710.","DOI":"10.1145\/129712.129780"},{"key":"10.1016\/S0304-3975(02)00399-7_BIB16","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, R. Raz, A. Wigderson, A direct product theorem, in: Proc. 9th Annu. IEEE Structures in Complexity Theory, 1994, pp. 88-96.","DOI":"10.1109\/SCT.1994.315814"},{"key":"10.1016\/S0304-3975(02)00399-7_BIB17","unstructured":"M. Ito, A. Saito, T. Nishizeki, Secret sharing scheme realizing general access structure, in: Proc. IEEE Global Telecommunications Conf., Globecom\u201987, 1987, pp. 99\u2013102."},{"issue":"3","key":"10.1016\/S0304-3975(02)00399-7_BIB18","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF00129770","article-title":"A construction for multisecret threshold schemes","volume":"9","author":"Jackson","year":"1996","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/S0304-3975(02)00399-7_BIB19","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s001459900014","article-title":"Ideal secret sharing schemes with multiple secrets","volume":"9","author":"Jackson","year":"1996","journal-title":"J. Cryptol."},{"key":"10.1016\/S0304-3975(02)00399-7_BIB20","doi-asserted-by":"crossref","unstructured":"M. Karchmer, A. Wigderson, On span programs, in: Proc. 8th Annu. IEEE Conf. on Structure in Complexity Theory, pp. 102\u2013111.","DOI":"10.1109\/SCT.1993.336536"},{"key":"10.1016\/S0304-3975(02)00399-7_BIB21","doi-asserted-by":"crossref","unstructured":"N. Nisan, S. Rudich, M. Saks, Products and help bits in decision trees, in: Proc. 35th IEEE Symp. on Foundations of Computer Science (FOCS 1994), pp. 318\u2013329.","DOI":"10.1109\/SFCS.1994.365683"},{"key":"10.1016\/S0304-3975(02)00399-7_BIB22","doi-asserted-by":"crossref","unstructured":"R. Raz, A parallel repetition theorem, in: Proc. 27th ACM Symp. on Theory of Computing (STOC 1995), pp. 447\u2013456.","DOI":"10.1145\/225058.225181"},{"issue":"11","key":"10.1016\/S0304-3975(02)00399-7_BIB23","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(02)00399-7_BIB24","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1109\/18.272461","article-title":"Decomposition constructions for secret sharing schemes","volume":"40","author":"Stinson","year":"1994","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(02)00399-7_BIB25","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF00125203","article-title":"An explication of secret sharing schemes","volume":"2","author":"Stinson","year":"1992","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/S0304-3975(02)00399-7_BIB26","unstructured":"D.R. Stinson, Bibliography on secret sharing schemes, http:\/\/www.cacr.math.uwaterloo.ca\/~dstinson\/ssbib.html."},{"key":"10.1016\/S0304-3975(02)00399-7_BIB27","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF01398012","article-title":"On the information rate of perfect secret sharing schemes","volume":"6","author":"van Dijk","year":"1995","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/S0304-3975(02)00399-7_BIB28","doi-asserted-by":"crossref","unstructured":"A. Yao, Coherent functions and program checkers, in: Proc. 22nd ACM Symp. on Theory of Computing (STOC 90), 1990, pp. 84\u201394.","DOI":"10.1145\/100216.100226"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502003997?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502003997?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T07:22:57Z","timestamp":1583997777000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502003997"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":28,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0304397502003997"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00399-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}