{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:10Z","timestamp":1772283670770,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540564133","type":"print"},{"value":"9783540475552","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-47555-9_1","type":"book-chapter","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T23:23:49Z","timestamp":1186615429000},"page":"1-24","source":"Crossref","is-referenced-by-count":19,"title":["Graph Decompositions and Secret Sharing Schemes"],"prefix":"10.1007","author":[{"given":"C.","family":"Blundo","sequence":"first","affiliation":[]},{"given":"A.","family":"De Santis","sequence":"additional","affiliation":[]},{"given":"D. R.","family":"Stinson","sequence":"additional","affiliation":[]},{"given":"U.","family":"Vaccaro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,5,18]]},"reference":[{"key":"1_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"Generalized secret sharing and monotone functions","author":"J. Benaloh","year":"1990","unstructured":"J. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. Lecture Notes in Computer Science, 403:27\u201335, 1990."},{"key":"1_CR2","unstructured":"C. Berge. Graphs. Second revised edition, North-Holland, 1985."},{"key":"1_CR3","first-page":"313","volume":"48","author":"G. R. Blakley","year":"1979","unstructured":"G. R. Blakley. Safeguarding cryptographic keys. AFIPS Conference Proceedings, 48:313\u2013317, 1979.","journal-title":"AFIPS Conference Proceedings"},{"key":"1_CR4","volume-title":"Secret Sharing Schemes for Access Structures based on Graphs","author":"C. Blundo","year":"1991","unstructured":"C. Blundo. Secret Sharing Schemes for Access Structures based on Graphs. Tesi di Laurea, University of Salerno, Italy, 1991, (in Italian)."},{"key":"1_CR5","first-page":"105","volume":"9","author":"E. F. Brickell","year":"1989","unstructured":"E. F. Brickell. Some ideal secret sharing schemes. J. Combin. Math. and Combin. Comput., 9:105\u2013113, 1989.","journal-title":"J. Combin. Math. and Combin. Comput."},{"key":"1_CR6","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:123\u2013134, 1991.","journal-title":"J. Cryptology"},{"key":"1_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/3-540-38424-3_17","volume-title":"Some improved bounds on the information rate of perfect secret sharing schemes","author":"E. F. Brickell","year":"1991","unstructured":"E. F. Brickell and D. R. Stinson. Some improved bounds on the information rate of perfect secret sharing schemes. Lecture Notes in Computer Science, 537:242\u2013252, 1991. To appear in J. Cryptology."},{"key":"1_CR8","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":"1_CR9","doi-asserted-by":"publisher","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. on Discrete Math., 4:502\u2013510, 1991.","journal-title":"SIAM J. on Discrete Math."},{"key":"1_CR10","series-title":"Lect Notes Comput Sci","first-page":"101","volume-title":"On the size of shares for secret sharing schemes","author":"R. M. Capocelli","year":"1991","unstructured":"R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro. On the size of shares for secret sharing schemes. Lecture Notes in Computer Science, 576:101\u2013113, 1991. To appear in J. Cryptology."},{"key":"1_CR11","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. W. H. Freeman and Company, New York, 1979."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game, Proc. 19th ACM Symp. on Theory of Computing, pages 218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"key":"1_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/3-540-46877-3_24","volume-title":"A protocol to set up shared secret schemes without the assistance of a mutually trusted party","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. Lecture Notes in Computer Science, 473:266\u2013282, 1991."},{"key":"1_CR14","first-page":"99","volume":"87","author":"M. Ito","year":"1987","unstructured":"M. Ito, A. Saito, and T. Nishizeki. Secret sharing scheme realizing general access structure. Proc. IEEE Globecom\u2019 87, pages 99\u2013102, 1987.","journal-title":"Proc. IEEE Globecom\u2019"},{"key":"1_CR15","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. Ilellman. On secret sharing systems. IEEE Transactions on Information Theory, IT-29:35\u201341, 1983.","journal-title":"IEEE Transactions on Information Theory"},{"key":"1_CR16","unstructured":"K. M. Martin. Discrete Structures in the Theory of Secret Sharing. PhD Thesis, University of London, 1991."},{"key":"1_CR17","unstructured":"K. M. Martin. New secret sharing schemes from old. Submitted to Journal of Combin. Math. and Combin. Comput."},{"key":"1_CR18","doi-asserted-by":"publisher","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. Commun. of the ACM, 24:583\u2013584, 1981.","journal-title":"Commun. of the ACM"},{"key":"1_CR19","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, pages 73\u201385, 1989.","DOI":"10.1145\/73007.73014"},{"key":"1_CR20","unstructured":"P. D. Seymour. On secret-sharing matroids. Preprint."},{"key":"1_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. Commun. of the ACM, 22:612\u2013613, 1979.","journal-title":"Commun. of the ACM"},{"key":"1_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-38424-3_16","volume-title":"Shared secret and\/or shared control schemes","author":"G. J. Simmons","year":"1991","unstructured":"G. J. Simmons. Shared secret and\/or shared control schemes. Lecture Notes in Computer Science, 537:216\u2013241, 1991."},{"key":"1_CR23","first-page":"215","volume":"68","author":"G. J. Simmons","year":"1989","unstructured":"G. J. Simmons. Robust shared secret schemes or \u2018how to be sure you have the right answer even though you don\u2019t know the question\u2019. Congressus Number., 68:215\u2013248, 1989.","journal-title":"Congressus Number"},{"key":"1_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/0-387-34799-2_30","volume-title":"How to (really) share a secret","author":"G. J. Simmons","year":"1990","unstructured":"G. J. Simmons. How to (really) share a secret. Lecture Notes in Computer Science, 403:390\u2013448, 1990."},{"key":"1_CR25","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, pages 441\u2013497, 1991.","DOI":"10.1007\/3-540-38424-3_16"},{"key":"1_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1007\/3-540-46885-4_44","volume-title":"Prepositioned shared secret and\/or shared control schemes","author":"G. J. Simmons","year":"1990","unstructured":"G. J. Simmons. Prepositioned shared secret and\/or shared control schemes. Lecture Notes in Computer Science, 434:436\u2013467, 1990."},{"key":"1_CR27","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. Bulletin of the ICA, 1:71\u201388, 1991.","journal-title":"Bulletin of the ICA"},{"key":"1_CR28","doi-asserted-by":"publisher","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:133\u2013138, 1988.","journal-title":"J. Cryptology"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT\u2019 92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47555-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T06:01:10Z","timestamp":1737352870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47555-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540564133","9783540475552"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-47555-9_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1993]]}}}