{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:12Z","timestamp":1772283672497,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1007\/bf01398012","type":"journal-article","created":{"date-parts":[[2005,4,2]],"date-time":"2005-04-02T19:56:49Z","timestamp":1112471809000},"page":"143-169","source":"Crossref","is-referenced-by-count":115,"title":["On the information rate of perfect secret sharing schemes"],"prefix":"10.1007","volume":"6","author":[{"given":"Marten","family":"Van Dijk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"M. Atici, Optimal information and average information rates of the connected graphs on six vertices, Master's thesis, University of Nebraska, May 1994."},{"key":"CR2","unstructured":"C. Blundo, Secret Sharing Schemes for Access Structures based on Graphs, Tesi di Laurea (1991) (in Italian)."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis, L. Gargano, and U. Vaccaro, On the information rate of secret sharing schemes, InAdvances in Cryptology-CRYPTO '92, Lecture Notes in Comput. Sci., Vol. 740, pp. 148?167 (1993).","DOI":"10.1007\/3-540-48071-4_11"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis, D. R. Stinson, and U. Vaccaro, Graph decompositions and secret sharing schemes,? InAdvances in Cryptology-Proceedings of Eurocrypt '92, Lecture Notes in Comput. Sci., Vol. 658 (1993) pp. 1?24.","DOI":"10.1007\/3-540-47555-9_1"},{"key":"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., Vol. 9 (1989) pp. 105?113.","journal-title":"J. Combin. Math. and Combin. Comput."},{"key":"CR6","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 (1992) pp. 153?166.","journal-title":"J. Cryptology"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"Ernest F. Brickell","year":"1991","unstructured":"Ernest F. Brickell and Daniel M. Davenport, On the classification of ideal secret sharing schemes,J. Cryptology, Vol. 4 (1991) pp. 123?134.","journal-title":"J. Cryptology"},{"key":"CR8","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, Vol. 6 (1993), pp. 157?167.","journal-title":"J. Cryptology"},{"key":"CR9","unstructured":"L. Csirmaz, The size of a share must be large, Mathematical Institute of the Hungarian Academy of Science, Preprint No. 54\/1993."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Marten van Dijk, A linear construction of perfect secret sharing schemes, April 1994. Submitted toDesigns, Codes, and Cryptography.","DOI":"10.1007\/BFb0053421"},{"key":"CR11","volume-title":"Information Theory and Reliable Communications","author":"R. G. Gallager","year":"1968","unstructured":"R. G. Gallager,Information Theory and Reliable Communications, John Wiley, New York (1968)."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01388562","volume":"4","author":"W.-A. Jackson","year":"1994","unstructured":"W.-A. Jackson and K. Martin, Geometric secret sharing schemes and their duals,Designs, Codes and Cryptography, Vol. 4 (1994) pp. 83?95.","journal-title":"Designs, Codes and Cryptography"},{"key":"CR13","unstructured":"K. M. Martin, Discrete structures in the theory of secret sharing, Ph.D. thesis, Royal Holloway and Bedford New College, University of London (1991)."},{"key":"CR14","first-page":"65","volume":"14","author":"K. M. Martin","year":"1993","unstructured":"K. M. Martin, New secret sharing schemes from old,Journal of Combin. Math. and Combin. Comput., Vol. 14 (1993) pp. 65?77.","journal-title":"Journal of Combin. Math. and Combin. Comput."},{"key":"CR15","unstructured":"N. Palmieri, Graphs decomposition for secret sharing schemes, Tesi di Laurea (1993) (in Italian)."},{"key":"CR16","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,Commun. of the ACM, Vol. 22 (1979) pp. 612?613.","journal-title":"Commun. of the ACM"},{"key":"CR17","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 and Cryptography, Vol. 2 (1992) pp. 357?390.","journal-title":"Designs, Codes and Cryptography"},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"D. R. Stinson, New general lower bounds on the information rate of secret sharing schemes, InAdvances in Cryptology-CRYPTO '92, Lecture Notes in Comput. Sci., Vol. 740 (1993) pp. 168?182.","DOI":"10.1007\/3-540-48071-4_12"},{"key":"CR19","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, Vol. IT-40 (1994) pp. 118?125.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01398012.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01398012\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01398012","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T20:25:18Z","timestamp":1683059118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01398012"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["BF01398012"],"URL":"https:\/\/doi.org\/10.1007\/bf01398012","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}