{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T17:31:02Z","timestamp":1782322262377,"version":"3.54.5"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"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":[[1992,12]]},"DOI":"10.1007\/bf00125203","type":"journal-article","created":{"date-parts":[[2004,11,2]],"date-time":"2004-11-02T23:35:01Z","timestamp":1099438501000},"page":"357-390","source":"Crossref","is-referenced-by-count":288,"title":["An explication of secret sharing schemes"],"prefix":"10.1007","volume":"2","author":[{"given":"D. R.","family":"Stinson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness theorems for noncryptographic fault-tolerant distributed computation, Proc. 20th ACM Symp. on Theory of Computing, (1988), pp. 1?10."},{"key":"CR2","first-page":"27","volume-title":"Lecture Notes in Computer Science","author":"J. Benaloh","year":"1990","unstructured":"J. Benaloh and J. Leichter, Generalized secret sharing and monotone functions, Lecture Notes in Computer Science, Springer-Verlag, Berlin, New York, 403, (1990), pp. 27?35."},{"key":"CR3","volume-title":"Design Theory","author":"T. Beth","year":"1985","unstructured":"T. Beth, J. Jungnickel, and H. Lenz, Design Theory. Bibliographisches Institut, Zurich, (1985)."},{"key":"CR4","unstructured":"B. Blakley, G.R. Blakley, A.H. Chan, and J.L. Massey, Threshold schemes with disenrollment, presented at CRYPTO '92."},{"key":"CR5","first-page":"313","volume":"48","author":"G.R. Blakley","year":"1979","unstructured":"G.R. Blakley, Safeguarding cryptographic keys, AFIPS Conference Proceedings, Vol. 48, (1979), pp. 313?317.","journal-title":"AFIPS Conference Proceedings"},{"key":"CR6","unstructured":"C. Blundo, A. De Santis, D.R. Stinson, and U. Vaccaro, Graph decomposition and secret sharing schemes. Presented at EUROCRYPT '92, submitted to Journal of Cryptology."},{"key":"CR7","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":"CR8","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, Vol. 4, (1991), pp. 123?134.","journal-title":"J. Cryptology"},{"key":"CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/3-540-38424-3_17","volume-title":"J. Cryptology","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, to appear in J. Cryptology. Preliminary version appeared in Lecture Notes in Computer Science, Springer-Verlag, Berlin, New York, 537, (1991), pp. 242?252."},{"key":"CR10","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. on Discrete Math., Vol. 4, (1991), pp. 502?510. Preliminary version appeared in Lecture Notes in Computer Science, Springer-Verlag, Berlin, New York, 403, (1990), pp. 564?577.","journal-title":"SIAM J. on Discrete Math."},{"key":"CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/3-540-46766-1_7","volume-title":"J. Cryptology","author":"R.M. Capocelli","year":"1992","unstructured":"R.M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, On the size of shares for secret sharing schemes. Submitted to J. Cryptology. Preliminary version appeared in Lecture Notes in Computer Science, Springer-Verlag, Berlin, New York, 576, (1992), pp. 101?113."},{"key":"CR12","first-page":"266","volume-title":"Lecture Notes in Computer Science","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, Springer-Verlag, Berlin, New York, 473, (1991), pp. 266?282."},{"key":"CR13","unstructured":"M. Ito, A. Saito, and T. Nishizeki, Secret sharing scheme realizing general access structure, Proc. IEEE Globecom '87, (1987), pp. 99?102."},{"key":"CR14","unstructured":"W.-A. Jackson and K.M. Martin, On ideal secret sharing schemes. Submitted to J. Cryptology."},{"key":"CR15","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, Vol. 29, (1983), pp. 35?41.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"CR16","unstructured":"K.M. Martin, New secret sharing schemes from old. Submitted to J. Comb. Math. Comb. Comp."},{"key":"CR17","unstructured":"K.M. Martin, Discrete Structures in the Theory of Secret Sharing. Ph.D. thesis, University of London, 1991."},{"key":"CR18","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, Commun. of the ACM, Vol. 24, (1981), pp. 583?584.","journal-title":"Commun. of the ACM"},{"key":"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, (1989), pp. 73?85.","DOI":"10.1145\/73007.73014"},{"key":"CR20","unstructured":"P.D. Seymour, On secret-sharing matroids. To appear in Journal of Combin. Theory B."},{"key":"CR21","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":"CR22","first-page":"215","volume":"68","author":"G.J. Simmons","year":"1989","unstructured":"G.J. Simmons, Robust shared secret schemes or ?how to be sure you have the right answer even though you don't known the question,? Congressus Numer., Vol. 68, (1989), pp. 215?248.","journal-title":"Congressus Numer."},{"key":"CR23","first-page":"390","volume-title":"Lecture Notes in Computer Science","author":"G.J. Simmons","year":"1990","unstructured":"G.J. Simmons, How to (really) share a secret, Lecture Notes in Computer Science, Springer-Verlag, Berlin, New York, 403, (1990), pp. 390?448."},{"key":"CR24","first-page":"436","volume-title":"Lecture Notes in Computer Science","author":"G.J. Simmons","year":"1990","unstructured":"G.J. Simmons, Prepositioned shared secret and\/or shared control schemes, Lecture Notes in Computer Science, Springer-Verlag, Berlin, New York, 434, (1990), pp. 436?467."},{"key":"CR25","first-page":"441","volume-title":"Contemporary Cryptology, The Science of Information Integrity","author":"G.J. Simmons","year":"1991","unstructured":"G.J. Simmons, An introduction to shared secret and\/or shared control schemes and their application, In (G.J. Simmons, ed.) Contemporary Cryptology, The Science of Information Integrity, IEEE Press, New York, (1991), pp. 441?497."},{"key":"CR26","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, Vol. 1, (1991), pp. 71?88.","journal-title":"Bulletin of the ICA"},{"key":"CR27","unstructured":"D.R. Stinson, New general lower bounds on the information rate of secret sharing schemes. Presented at CRYPTO '92."},{"key":"CR28","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, Vol. 1, (1988), pp. 133?138.","journal-title":"J. Cryptology"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00125203.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00125203\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00125203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,27]],"date-time":"2021-06-27T12:54:51Z","timestamp":1624798491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00125203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["BF00125203"],"URL":"https:\/\/doi.org\/10.1007\/bf00125203","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}