{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:06:41Z","timestamp":1773655601695,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1997,11]]},"DOI":"10.1023\/a:1008268610932","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T08:47:34Z","timestamp":1040546854000},"page":"215-243","source":"Crossref","is-referenced-by-count":114,"title":["On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption"],"prefix":"10.1007","volume":"12","author":[{"given":"Doug R.","family":"Stinson","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"141935_CR1","unstructured":"N. Alon and M. Naor, Derandomization, witnesses for Boolean matrix multiplication and constructions of perfect hash functions, Technical Report CS94-11, Weizmann Institute of Science."},{"key":"141935_CR2","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1002\/(SICI)1520-6610(1996)4:5<353::AID-JCD4>3.0.CO;2-E","volume":"4","author":"M. Atici","year":"1996","unstructured":"M. Atici, S. S. Magliveras, D. R. Stinson and W.-D. Wei, Some recursive constructions for perfect hash families, Journal of Combinatorial Designs, Vol. 4 (1996) pp. 353\u2013363.","journal-title":"Journal of Combinatorial Designs"},{"key":"141935_CR3","doi-asserted-by":"crossref","unstructured":"A. Beimel and B. Chor, Interaction in key distribution schemes, Advances in Cryptology: CRYPTO '93, Lecture Notes in Computer Science, 773 (1994) pp. 444\u2013455.","DOI":"10.1007\/3-540-48329-2_38"},{"key":"141935_CR4","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1109\/18.335890","volume":"40","author":"A. Beimel","year":"1994","unstructured":"A. Beimel and B. Chor, Universally ideal secret sharing schemes, IEEE Transactions on Information Theory Vol. 40 (1994) pp. 786\u2013794.","journal-title":"IEEE Transactions on Information Theory"},{"key":"141935_CR5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1109\/18.481774","volume":"42","author":"A. Beimel","year":"1996","unstructured":"A. Beimel and B. Chor, Communication in key distribution schemes, IEEE Transactions on Information Theory, Vol. 42 (1996) pp. 19\u201328.","journal-title":"IEEE Transactions on Information Theory"},{"key":"141935_CR6","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"C. H. Bennett","year":"1988","unstructured":"C. H. Bennett, G. Brassard and J.-M. Robert, Privacy amplification by public discussion, SIAM J. Comput., Vol. 17 (1988) pp. 210\u2013229.","journal-title":"SIAM J. Comput."},{"key":"141935_CR7","unstructured":"S. Berkovits, How to broadcast a secret, Advances in Cryptology: EUROCRYPT '91, Lecture Notes in Computer Science, 547 (1992) pp. 536\u2013541."},{"key":"141935_CR8","volume-title":"Design Theory","author":"T. Beth","year":"1985","unstructured":"Th. Beth, D. Jungnickel and H. Lenz, Design Theory. Bibliographisches Institut, Zurich (1985)."},{"key":"141935_CR9","doi-asserted-by":"crossref","unstructured":"J. Bierbrauer, K. Gopalakrishnan and D. R. Stinson, Bounds for resilient functions and orthogonal arrays, Advances in Cryptology: CRYPTO '94, Lecture Notes in Computer Science, 839 (1994) pp. 247\u2013256.","DOI":"10.1007\/3-540-48658-5_24"},{"key":"141935_CR10","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1137\/S0895480194270950","volume":"9","author":"J. Bierbrauer","year":"1996","unstructured":"J. Bierbrauer, K. Gopalakrishnan and D. R. Stinson, Orthogonal arrays, resilient functions, error-correcting codes and linear programming bounds, SIAM J. Discrete Math, Vol. 9 (1996) pp. 424\u2013452.","journal-title":"SIAM J. Discrete Math"},{"key":"141935_CR11","doi-asserted-by":"crossref","unstructured":"R. Blom, An optimal class of symmetric key generation systems, Advances in Cryptology: EUROCRYPT '84, Lecture Notes in Computer Science, 209 (1985) pp. 335\u2013338.","DOI":"10.1007\/3-540-39757-4_22"},{"key":"141935_CR12","doi-asserted-by":"crossref","unstructured":"C. Blundo and A. Cresti, Space requirements for broadcast encryption, Advances in Cryptology: EUROCRYPT '94, Lecture Notes in Computer Science, 950 (1995) pp. 287\u2013298.","DOI":"10.1007\/BFb0053444"},{"key":"141935_CR13","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro and M. Yung, Perfectly secure key distribution for dynamic conferences, Advances in Cryptology: CRYPTO '92, Lecture Notes in Computer Science, 740 (1993) pp. 471\u2013486.","DOI":"10.1007\/3-540-48071-4_33"},{"key":"141935_CR14","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis and U. Vaccaro, Randomness in distribution protocols, Automata, Languages and Programming: ICALP '94, Lecture Notes in Computer Science, 820 (1994) pp. 568\u2013579.","DOI":"10.1007\/3-540-58201-0_99"},{"key":"141935_CR15","doi-asserted-by":"crossref","unstructured":"C. Blundo, L. A. Frota Mattos and D. R. Stinson, Trade-offs between communication and storage in unconditionally secure schemes for broadcast encryption and interactive key distribution, Advances in Cryptology: CRYPTO '96, Lecture Notes in Computer Science, 1109 (1996) pp. 387\u2013400.","DOI":"10.1007\/3-540-68697-5_29"},{"key":"141935_CR16","doi-asserted-by":"crossref","first-page":"309","DOI":"10.3233\/JCS-1994\/1995-3406","volume":"3","author":"C. Blundo","year":"1994","unstructured":"C. Blundo, L. A. Frota Mattos and D. R. Stinson, Multiple key distribution maintaining user anonymity via broadcast channels, J. Computer Security, Vol. 3 (1994\/95) pp. 309\u2013323.","journal-title":"J. Computer Security"},{"key":"141935_CR17","first-page":"105","volume":"9","author":"E. F. Brickell","year":"1989","unstructured":"E. F. Brickell, Some ideal secret sharing schemes, Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 9 (1989) pp. 105\u2013113.","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"141935_CR18","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, Journal of Cryptology, Vol. 4 (1991) pp. 123\u2013134.","journal-title":"Journal of Cryptology"},{"key":"141935_CR19","doi-asserted-by":"crossref","unstructured":"P. J. Cameron, Combinatorics: Topics, Techniques, Algorithms, Cambridge University Press (1994).","DOI":"10.1017\/CBO9780511803888"},{"key":"141935_CR20","doi-asserted-by":"crossref","unstructured":"B. Chor, O. Goldreich, J. Hastad, J. Friedman, S. Rudich and R. Smolensky, The bit extraction problem or t-resilient functions, Proc. 26th IEEE Symposium on Foundations of Computer Science (1985) pp. 396\u2013407.","DOI":"10.1109\/SFCS.1985.55"},{"key":"141935_CR21","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF00191355","volume":"8","author":"M. Dyer","year":"1995","unstructured":"M. Dyer, T. Fenner, A. Frieze and A. Thomason, On key storage in secure networks, Journal of Cryptology, Vol. 8 (1995) pp. 189\u2013200.","journal-title":"Journal of Cryptology"},{"key":"141935_CR22","doi-asserted-by":"crossref","unstructured":"A. Fiat and M. Naor, Broadcast encryption, Advances in Cryptology: CRYPTO '93, Lecture Notes in Computer Science, 773 (1994) pp. 480\u2013491.","DOI":"10.1007\/3-540-48329-2_40"},{"key":"141935_CR23","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1137\/0605009","volume":"5","author":"M. L. Fredman","year":"1984","unstructured":"M. L. Fredman and J. Komlos, On the size of separating systems and families of perfect hash functions, SIAM Journal of Algebraic and Discrete Methods, Vol. 5 (1984) pp. 61\u201368.","journal-title":"SIAM Journal of Algebraic and Discrete Methods"},{"key":"141935_CR24","doi-asserted-by":"crossref","unstructured":"J. Friedman, On the bit extraction problem, Proc. 33rd IEEE Symposium on Foundations of Computer Science, (1992) pp. 314\u2013319.","DOI":"10.1109\/SFCS.1992.267760"},{"key":"141935_CR25","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF02252869","volume":"2","author":"L. Gong","year":"1990","unstructured":"L. Gong and D. L. Wheeler, A matrix key-distribution scheme, Journal of Cryptology, Vol. 2 (1990) pp. 51\u201359.","journal-title":"Journal of Cryptology"},{"key":"141935_CR26","unstructured":"K. Gopalakrishnan, A Study of Correlation-immune, Resilient and Related Cryptographic Functions, PhD Thesis, University of Nebraska-Lincoln, 1994."},{"key":"141935_CR27","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01388386","volume":"5","author":"K. Gopalakrishnan","year":"1995","unstructured":"K. Gopalakrishnan and D. R. Stinson, Three characterizations of non-binary correlation-immune and resilient functions, Designs, Codes and Cryptography, Vol. 5 (1995) pp. 241\u2013251.","journal-title":"Designs, Codes and Cryptography"},{"key":"141935_CR28","doi-asserted-by":"crossref","unstructured":"M. Just, E. Kranakis, D. Krizanc and P. van Oorschot, On key distribution via true broadcasting, Proc. 2nd ACM Conf. on Computer and Communications Security, pp. 81\u201388.","DOI":"10.1145\/191177.191195"},{"key":"141935_CR29","doi-asserted-by":"crossref","unstructured":"V. Korjik, M. Ivkov, Y. Merinovitch, A. Barg and H. van Tilborg, A broadcast key distribution scheme based on block designs, Cryptography and Coding, V, Lecture Notes in Computer Science, 1025 (1995) pp. 12\u201321.","DOI":"10.1007\/3-540-60693-9_2"},{"key":"141935_CR30","doi-asserted-by":"crossref","unstructured":"K. Kurosawa, K. Okada and K. Sakano, Security of the center in key distribution schemes, Advances in Cryptology: ASIACRYPT '94, Lecture Notes in Computer Science, 917 (1995).","DOI":"10.1007\/BFb0000445"},{"key":"141935_CR31","doi-asserted-by":"crossref","unstructured":"T. Leighton and S. Micali, Secret-key agreement without public-key cryptography, Advances in Cryptology: CRYPTO '93, Lecture Notes in Computer Science, 773 (1994) pp. 456\u2013479.","DOI":"10.1007\/3-540-48329-2_39"},{"key":"141935_CR32","doi-asserted-by":"crossref","unstructured":"T. Matsumoto, Incidence structures for key sharing, Advances in Cryptology: ASIACRYPT '94, Lecture Notes in Computer Science, 917 (1995) pp. 342\u2013353.","DOI":"10.1007\/BFb0000446"},{"key":"141935_CR33","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn, On the program size of perfect and universal hash functions, Proc. 23rd Annual IEEE Symposium of Foundations of Computer Science, (1982) pp. 170\u2013175.","DOI":"10.1109\/SFCS.1982.80"},{"key":"141935_CR34","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0166-218X(88)90068-6","volume":"21","author":"C. J. Mitchell","year":"1988","unstructured":"C. J. Mitchell and F. C. Piper, Key storage in secure networks, Discrete Applied Mathematics, Vol. 21 (1988) pp. 215\u2013228.","journal-title":"Discrete Applied Mathematics"},{"key":"141935_CR35","first-page":"195","volume":"7","author":"C. M. O'Keefe","year":"1993","unstructured":"C. M. O'Keefe, Applications of finite geometries to information security, Australiasian J. Combinatorics, Vol. 7 (1993) pp. 195\u2013212.","journal-title":"Australiasian J. Combinatorics"},{"key":"141935_CR36","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01578871","volume":"4","author":"K. A. S. Quinn","year":"1994","unstructured":"K. A. S. Quinn, Some constructions for key distribution patterns, Designs, Codes and Cryptography, Vol. 4 (1994) pp. 177\u2013191.","journal-title":"Designs, Codes and Cryptography"},{"key":"141935_CR37","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, Communications of the ACM, Vol. 22 (1979) pp. 612\u2013613.","journal-title":"Communications of the ACM"},{"key":"141935_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 and Cryptography, Vol. 2 (1992) pp. 357\u2013390.","journal-title":"Designs, Codes and Cryptography"},{"key":"141935_CR39","volume-title":"Cryptography Theory and Practice","author":"D. R. Stinson","year":"1995","unstructured":"D. R. Stinson, Cryptography Theory and Practice. CRC Press, Inc., Boca Raton, 1995."},{"key":"141935_CR40","unstructured":"D. Welsh, Codes and Cryptography, Oxford University Press (1988)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008268610932.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008268610932\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008268610932.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T02:58:11Z","timestamp":1753757891000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008268610932"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["141935"],"URL":"https:\/\/doi.org\/10.1023\/a:1008268610932","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}