On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption
 Doug R. Stinson
 … show all 1 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
This paper provides an exposition of methods by which a trusted authority can distribute keys and/or broadcast a message over a network, so that each member of a privileged subset of users can compute a specified key or decrypt the broadcast message. Moreover, this is done in such a way that no coalition is able to recover any information on a key or broadcast message they are not supposed to know. The problems are studied using the tools of information theory, so the security provided is unconditional (i.e., not based on any computational assumption).
We begin by surveying some useful schemes for key distribution that have been presented in the literature, giving background and examples (but not too many proofs). In particular, we look more closely at the attractive concept of key distribution patterns, and present a new method for making these schemes more efficient through the use of resilient functions. Then we present a general approach to the construction of broadcast schemes that combines key predistribution schemes with secret sharing schemes. We discuss the FiatNaor Broadcast Scheme, as well as other, new schemes that can be constructed using this approach.
 N. Alon and M. Naor, Derandomization, witnesses for Boolean matrix multiplication and constructions of perfect hash functions, Technical Report CS9411, Weizmann Institute of Science.
 Atici, M., Magliveras, S. S., Stinson, D. R., Wei, W.D. (1996) Some recursive constructions for perfect hash families. Journal of Combinatorial Designs 4: pp. 353363
 A. Beimel and B. Chor, Interaction in key distribution schemes, Advances in Cryptology: CRYPTO '93, Lecture Notes in Computer Science, 773 (1994) pp. 444–455.
 Beimel, A., Chor, B. (1994) Universally ideal secret sharing schemes. IEEE Transactions on Information Theory 40: pp. 786794
 Beimel, A., Chor, B. (1996) Communication in key distribution schemes. IEEE Transactions on Information Theory 42: pp. 1928
 Bennett, C. H., Brassard, G., Robert, J.M. (1988) Privacy amplification by public discussion. SIAM J. Comput. 17: pp. 210229
 S. Berkovits, How to broadcast a secret, Advances in Cryptology: EUROCRYPT '91, Lecture Notes in Computer Science, 547 (1992) pp. 536–541.
 Beth, T., Jungnickel, D., Lenz, H. (1985) Design Theory. Bibliographisches Institut, Zurich
 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–256.
 Bierbrauer, J., Gopalakrishnan, K., Stinson, D. R. (1996) Orthogonal arrays, resilient functions, errorcorrecting codes and linear programming bounds. SIAM J. Discrete Math 9: pp. 424452
 R. Blom, An optimal class of symmetric key generation systems, Advances in Cryptology: EUROCRYPT '84, Lecture Notes in Computer Science, 209 (1985) pp. 335–338.
 C. Blundo and A. Cresti, Space requirements for broadcast encryption, Advances in Cryptology: EUROCRYPT '94, Lecture Notes in Computer Science, 950 (1995) pp. 287–298.
 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–486.
 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–579.
 C. Blundo, L. A. Frota Mattos and D. R. Stinson, Tradeoffs 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–400.
 Blundo, C., Frota Mattos, L. A., Stinson, D. R. (1994) Multiple key distribution maintaining user anonymity via broadcast channels. J. Computer Security 3: pp. 309323
 Brickell, E. F. (1989) Some ideal secret sharing schemes. Journal of Combinatorial Mathematics and Combinatorial Computing 9: pp. 105113
 Brickell, E. F., Davenport, D. M. (1991) On the classification of ideal secret sharing schemes. Journal of Cryptology 4: pp. 123134
 P. J. Cameron, Combinatorics: Topics, Techniques, Algorithms, Cambridge University Press (1994).
 B. Chor, O. Goldreich, J. Hastad, J. Friedman, S. Rudich and R. Smolensky, The bit extraction problem or tresilient functions, Proc. 26th IEEE Symposium on Foundations of Computer Science (1985) pp. 396–407.
 Dyer, M., Fenner, T., Frieze, A., Thomason, A. (1995) On key storage in secure networks. Journal of Cryptology 8: pp. 189200
 A. Fiat and M. Naor, Broadcast encryption, Advances in Cryptology: CRYPTO '93, Lecture Notes in Computer Science, 773 (1994) pp. 480–491.
 Fredman, M. L., Komlos, J. (1984) On the size of separating systems and families of perfect hash functions. SIAM Journal of Algebraic and Discrete Methods 5: pp. 6168
 J. Friedman, On the bit extraction problem, Proc. 33rd IEEE Symposium on Foundations of Computer Science, (1992) pp. 314–319.
 Gong, L., Wheeler, D. L. (1990) A matrix keydistribution scheme. Journal of Cryptology 2: pp. 5159
 K. Gopalakrishnan, A Study of Correlationimmune, Resilient and Related Cryptographic Functions, PhD Thesis, University of NebraskaLincoln, 1994.
 Gopalakrishnan, K., Stinson, D. R. (1995) Three characterizations of nonbinary correlationimmune and resilient functions. Designs, Codes and Cryptography 5: pp. 241251
 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–88.
 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–21.
 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).
 T. Leighton and S. Micali, Secretkey agreement without publickey cryptography, Advances in Cryptology: CRYPTO '93, Lecture Notes in Computer Science, 773 (1994) pp. 456–479.
 T. Matsumoto, Incidence structures for key sharing, Advances in Cryptology: ASIACRYPT '94, Lecture Notes in Computer Science, 917 (1995) pp. 342–353.
 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–175.
 Mitchell, C. J., Piper, F. C. (1988) Key storage in secure networks. Discrete Applied Mathematics 21: pp. 215228
 O'Keefe, C. M. (1993) Applications of finite geometries to information security. Australiasian J. Combinatorics 7: pp. 195212
 Quinn, K. A. S. (1994) Some constructions for key distribution patterns. Designs, Codes and Cryptography 4: pp. 177191
 Shamir, A. (1979) How to share a secret. Communications of the ACM 22: pp. 612613
 Stinson, D. R. (1992) An explication of secret sharing schemes. Designs, Codes and Cryptography 2: pp. 357390
 Stinson, D. R. (1995) Cryptography Theory and Practice. CRC Press, Inc., Boca Raton
 D. Welsh, Codes and Cryptography, Oxford University Press (1988).
 Title
 On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption
 Journal

Designs, Codes and Cryptography
Volume 12, Issue 3 , pp 215243
 Cover Date
 19971101
 DOI
 10.1023/A:1008268610932
 Print ISSN
 09251022
 Online ISSN
 15737586
 Publisher
 Kluwer Academic Publishers
 Additional Links
 Topics
 Keywords

 key distribution
 broadcast encryption
 resilient functions
 secret sharing schemes
 combinatorial designs
 Industry Sectors
 Authors

 Doug R. Stinson ^{(1)}
 Author Affiliations

 1. Department of Computer Science and Engineering, University of NebraskaLincoln, Lincoln, NE, 68588, USA