{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T14:09:06Z","timestamp":1784556546719,"version":"3.55.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Cryptology"],"published-print":{"date-parts":[[1995,12]]},"DOI":"10.1007\/bf00204801","type":"journal-article","created":{"date-parts":[[2004,9,1]],"date-time":"2004-09-01T17:16:33Z","timestamp":1094058993000},"page":"39-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":92,"title":["Graph decompositions and secret sharing schemes"],"prefix":"10.1007","volume":"8","author":[{"given":"C.","family":"Blundo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"De Santis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"D. R.","family":"Stinson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"U.","family":"Vaccaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF00204801_CR1","series-title":"Lecture Notes in Computer Science, Vol. 740","first-page":"185","volume-title":"Proc. Crypto '92","author":"A. Beimel","year":"1993","unstructured":"A. Beimel and B. Chor. Universally ideal secret sharing schemes. Proc. Crypto '92. Lecture Notes in Computer Science, Vol. 740. Springer-Verlag, Berlin, 1993, pp. 185\u2013197."},{"key":"BF00204801_CR2","series-title":"Lecture Notes in Computer Science, Vol. 403","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"Proc. Crypto '88","author":"J. Benaloh","year":"1990","unstructured":"J. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. Proc. Crypto '88. Lecture Notes in Computer Science, Vol. 403. Springer-Verlag, Berlin, 1990, pp. 27\u201335."},{"key":"BF00204801_CR3","volume-title":"Graphs","author":"C. Berge","year":"1985","unstructured":"C. Berge. Graphs, 2nd rev. edn. North-Holland, Amsterdam, 1985.","edition":"2nd rev. edn."},{"key":"BF00204801_CR4","first-page":"313","volume":"48","author":"G. R. Blakley","year":"1979","unstructured":"G. R. Blakley. Safeguarding cryptographic keys. AFIPS Conf. Proc. 48 (1979), 313\u2013317.","journal-title":"AFIPS Conf. Proc."},{"key":"BF00204801_CR5","series-title":"Lecture Notes in Computer Science, Vol. 740","first-page":"546","volume-title":"Proc. Crypto '92","author":"B. Blakley","year":"1993","unstructured":"B. Blakley, G. R. Blakley, A. H. Chan, and J. L. Massey. Threshold schemes with disenrollment. Proc. Crypto '92. Lecture Notes in Computer Science, Vol. 740. Springer-Verlag, Berlin, 1993, pp. 546\u201354."},{"key":"BF00204801_CR6","unstructured":"C. Blundo. Secret Sharing Schemes for Access Structures Based on Graphs. Tesi di Laurea, University of Salerno, 1991 (in Italian)."},{"key":"BF00204801_CR7","series-title":"Lecture Notes in Computer Science, Vol. 773","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/3-540-48329-2_10","volume-title":"Proc. Crypto '93","author":"C. Blundo","year":"1994","unstructured":"C. Blundo, A. Cresti, A. De Santis, and U. Vaccaro. Fully dynamic secret sharing schemes. Proc. Crypto '93. Lecture Notes in Computer Science, Vol. 773. Springer-Verlag, Berlin, 1994, pp. 110\u2013125."},{"key":"BF00204801_CR8","series-title":"Lecture Notes in Computer Science, Vol. 740","first-page":"149","volume-title":"Proc. Crypto '92","author":"C. Blundo","year":"1993","unstructured":"C. Blundo, A. De Santis, L. Gargano, and U. Vaccaro. On the information rate of secret sharing schemes. Proc. Crypto '92. Lecture Notes in Computer Science, Vol. 740. Springer-Verlag, Berlin, 1993, pp. 149\u2013169."},{"key":"BF00204801_CR9","series-title":"Lecture Notes in Computer Science, Vol. 665","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1007\/3-540-56503-5_68","volume-title":"Proc. STACS '93","author":"C. Blundo","year":"1993","unstructured":"C. Blundo, A. De Santis, and U. Vaccaro. Efficient sharing of many secrets. Proc. STACS '93. Lecture Notes in Computer Science, Vol. 665. Springer-Verlag, Berlin, 1993, pp. 692\u2013703."},{"key":"BF00204801_CR10","first-page":"105","volume":"9","author":"E. F. Brickell","year":"1989","unstructured":"E. F. Brickell. Some ideal secret sharing schemes. J. Combin. Math. Combin. Comput. 9 (1989), 105\u2013113.","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"BF00204801_CR11","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 4 (1991), 123\u2013134.","journal-title":"J. Cryptology"},{"key":"BF00204801_CR12","doi-asserted-by":"crossref","unstructured":"E. F. Brickell and D. R. Stinson. Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes. Department of Computer Science and Engineering Report Series # 106, University of Nebraska, May 1990.","DOI":"10.1007\/3-540-38424-3_17"},{"key":"BF00204801_CR13","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. Discrete Math. 4 (1991), 502\u2013510.","journal-title":"SIAM J. Discrete Math."},{"key":"BF00204801_CR14","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 5 (1992), 153\u2013166.","journal-title":"J. Cryptology"},{"key":"BF00204801_CR15","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. J. Cryptology 6 (1993), 157\u2013168.","journal-title":"J. Cryptology"},{"key":"BF00204801_CR16","series-title":"Lecture Notes in Computer Science, Vol. 765","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/3-540-48285-7_10","volume-title":"Proc. Eurocrypt '93","author":"M. Carpentieri","year":"1994","unstructured":"M. Carpentieri, A. De Santis, and U. Vaccaro. Size of shares and probability of chearing in threshold schemes. Proc. Eurocrypt '93. Lecture Notes in Computer Science, Vol. 765. Springer-Verlag, Berlin, 1994, pp. 118\u2013125."},{"key":"BF00204801_CR17","first-page":"27","volume":"8","author":"E. Dawson","year":"1993","unstructured":"E. Dawson, E. S. Mahmoodian, and A. Rahilly. Orthogonal arrays and ordered threshold schemes. Austral. J. Combin. 8 (1993), 27\u201344.","journal-title":"Austral. J. Combin."},{"key":"BF00204801_CR18","volume-title":"Computers and Intractability. A Guide to Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to Theory of NP-Completeness. Freeman, New York, 1979."},{"key":"BF00204801_CR19","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micall, and A. Wigderson. How to play any mental game. Proc. 19th ACM Symp. on Theory of Computing, 1987, pp. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"BF00204801_CR20","series-title":"Lecture Notes in Computer Science, Vol. 473","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/3-540-46877-3_24","volume-title":"Proc. Eurocrypt '90","author":"I. Ingemarsson","year":"1991","unstructured":"I. Ingemarsson and G. J. Simmons. A protocol to set up shared secret schemes without the assistance of a mutually trusted party. Proc. Eurocrypt '90. Lecture Notes in Computer Science, Vol. 473. Springer-Verlag, Berlin, 1991, pp. 266\u2013282."},{"key":"BF00204801_CR21","unstructured":"M. Ito, A. Saito, and T. Nishizeki. Secret sharing scheme realizing general access structure. Proc. IEEE Globecom '87, 1987, pp. 99\u2013102."},{"key":"BF00204801_CR22","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF02620229","volume":"6","author":"M. Ito","year":"1993","unstructured":"M. Ito, A. Saito, and T. Nishizeki. Multiple assignment scheme for sharing secret. J. Cryptology 6 (1993), 15\u201320.","journal-title":"J. Cryptology"},{"key":"BF00204801_CR23","unstructured":"W.-A. Jackson and K. M. Martin. On ideal secret sharing schemes. Preprint."},{"key":"BF00204801_CR24","series-title":"Lecture Notes in Computer Science, Vol. 773","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/3-540-48329-2_11","volume-title":"Proc. Crypto '93","author":"W.-A. Jackson","year":"1994","unstructured":"W.-A. Jackson, K. M. Martin, and C. M. O'Keefe. Multisecret threshold schemes. Proc. Crypto '93. Lecture Notes in Computer Science, Vol. 773. Springer-Verlag, Berlin, 1994, pp. 126\u2013135."},{"key":"BF00204801_CR25","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"29","author":"E. D. Karnin","year":"1983","unstructured":"E. D. Karnin, J. W. Greene, and M. E. Hellman. On secret sharing systems. IEEE Trans. Inform. Theory 29 (1983), 35\u201341.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"BF00204801_CR26","unstructured":"K. M. Martin. Discrete Structures in the Theory of Secret Sharing. Ph.D. thesis, University of London, 1991."},{"key":"BF00204801_CR27","first-page":"65","volume":"14","author":"K. M. Martin","year":"1993","unstructured":"K. M. Martin. New secret sharing schemes from old. J. Combin. Math. Combin. Comput. 14 (1993), 65\u201377.","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"BF00204801_CR28","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. V. Sarwate. On sharing secrets and Reed-Solomon codes. Comm. ACM 24 (1981), 583\u2013584.","journal-title":"Comm. ACM"},{"key":"BF00204801_CR29","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, 1989, pp. 73\u201385.","DOI":"10.1145\/73007.73014"},{"key":"BF00204801_CR30","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0095-8956(92)90007-K","volume":"56","author":"P. D. Seymour","year":"1992","unstructured":"P. D. Seymour. On secret-sharing matroids. J. Combin. Theory Ser. B 56 (1992), 69\u201373.","journal-title":"J. Combin. Theory Ser. B"},{"key":"BF00204801_CR31","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir. How to share a secret. Comm. ACM 22 (1979), 612\u2013613.","journal-title":"Comm. ACM"},{"key":"BF00204801_CR32","first-page":"215","volume":"68","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 Congr. Numer. 68 (1989), 215\u2013248.","journal-title":"Congr. Numer."},{"key":"BF00204801_CR33","series-title":"Lecture Notes in Computer Science, Vol. 403","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/0-387-34799-2_30","volume-title":"Proc. Crypto '88","author":"G. J. Simmons","year":"1990","unstructured":"G. J. Simmons. How to (really) share a secret. Proc. Crypto '88. Lecture Notes in Computer Science, Vol. 403. Springer-Verlag, Berlin, 1990, pp. 390\u2013448."},{"key":"BF00204801_CR34","series-title":"Lecture Notes in Computer Science, Vol. 434","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1007\/3-540-46885-4_44","volume-title":"Proc. Eurocrypt '89","author":"G. J. Simmons","year":"1990","unstructured":"G. J. Simmons. Prepositioned shared secret and\/or shared control schemes. Proc. Eurocrypt '89. Lecture Notes in Computer Science, Vol. 434. Springer-Verlag, Berlin, 1990, pp. 436\u2013467."},{"key":"BF00204801_CR35","series-title":"Lecture Notes in Computer Science, Vol. 537","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-38424-3_16","volume-title":"Proc. Crypto '90","author":"G. J. Simmons","year":"1991","unstructured":"G. J. Simmons. Shared secret and\/or shared control schemes. Proc. Crypto '90. Lecture Notes in Computer Science, Vol. 537. Springer-Verlag, Berlin, 1991, pp. 216\u2013241."},{"key":"BF00204801_CR36","first-page":"441","volume-title":"Contemporary Cryptology","author":"G. J. Simmons","year":"1991","unstructured":"G. J. Simmons. An introduction to shared secret and\/or shared control schemes and their application. Contemporary Cryptology, IEEE Press, New York, 1991, pp. 441\u2013497."},{"key":"BF00204801_CR37","first-page":"71","volume":"1","author":"G. J. Simmons","year":"1991","unstructured":"G. J. Simmons, W. Jackson, and K. Martin. The geometry of shared secret schemes. Bull. ICA 1 (1991), 71\u201388.","journal-title":"Bull. ICA"},{"key":"BF00204801_CR38","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. Designs Codes Cryptography 2 (1992), 357\u2013390.","journal-title":"Designs Codes Cryptography"},{"key":"BF00204801_CR39","series-title":"Lectures Notes in Computer Science, Vol. 740","first-page":"170","volume-title":"Proc. Crypto '92","author":"D. R. Stinson","year":"1993","unstructured":"D. R. Stinson. New general lower bounds on the information rate of secret sharing schemes. Proc. Crypto '92. Lectures Notes in Computer Science, Vol. 740. Springer-Verlag, Berlin, 1993, pp. 170\u2013184."},{"key":"BF00204801_CR40","doi-asserted-by":"crossref","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 40 (1994), 118\u2013125.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"BF00204801_CR41","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 1 (1988), 133\u2013138.","journal-title":"J. Cryptology"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00204801.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00204801\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00204801","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00204801.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T13:40:55Z","timestamp":1734529255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00204801"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["BF00204801"],"URL":"https:\/\/doi.org\/10.1007\/bf00204801","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,12]]},"assertion":[{"value":"20 January 1992","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 1993","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}