Combinatorial bounds for broadcast encryption
 Michael Luby,
 Jessica Staddon
 … show all 2 hide
Abstract
A broadcast encryption system allows a center to communicate securely over a broadcast channel with selected sets of users. Each time the set of privileged users changes, the center enacts a protocol to establish a new broadcast key that only the privileged users can obtain, and subsequent transmissions by the center are encrypted using the new broadcast key. We study the inherent tradeoff between the number of establishment keys held by each user and the number of transmissions needed to establish a new broadcast key. For every given upper bound on the number of establishment keys held by each user, we prove a lower bound on the number of transmissions needed to establish a new broadcast key. We show that these bounds are essentially tight, by describing broadcast encryption systems that come close to these bounds.
 R. Blom, An optimal class of symmetric key generation systems, “Advances in CryptologyEUROCRYPT '84”, Lecture Notes in Computer Science 209 (1984), 335–338.
 C. Blundo, A. Cresti, Space requirements for broadcast encryption, “Advances in CryptologyEUROCRYPT '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 in dynamic conferences, “Advances in Cryptology — CRYPTO '92”, Lecture Notes in Computer Science 740 (1993), pp 471–486. CrossRef
 C. Blundo, L. A. Frota Mattos, D. R. Stinson, Tradeoffs between communication and storage in unconditionally secure schemes for broadcast encryption and interactive key distribution, “Advances in CryptologyCRYPTO '96”, Lecture Notes in Computer Science 1109 (1996), pp 387–400.
 B. Bollobás, On generalized graphs, Acta Math. Acad. Sci. Hungar., 16 (1965), pp 447–452. CrossRef
 P. Erdös, R. Rado, Intersection theorems for systems of sets, Journal London Math. Soc, 35 (1960), pp 85–90.
 A. Fiat, M. Naor, Broadcast encryption, “Advances in CryptologyCRYPTO '93”, Lecture Notes in Computer Science 773 (1994), pp 480–491.
 D. Lubell, A short proof of Sperner's lemma, J. Combinatorial Theory, 1 (1966), p 299.
 L. D. Meshalkin, A generalization of Sperner's lemma on the number of subsets of a finite set (English translation), Theory of Probab. and its Applns., 8 (1964), pp 204–205.
 E. Sperner, Ein Satz über Untermengen einer endlichen Menge, Math. Zeitschrift, 27 (1928), pp 544–548. CrossRef
 D. R. Stinson, On some methods for unconditionally secure key distribution and broadcast encryption, Designs, Codes and Cryptography, 12 (1997), pp 215–243. CrossRef
 D. R. Stinson and T. van Trung, Some new results on key distribution patterns and broadcast encryption, submitted for publication.
 J. H. van Lint and R. M. Wilson, A Course in Combinatorics, Cambridge University Press, Cambridge, 1992.
 K. Yamamoto, Logarithmic order of free distributive lattices, J. Math. Soc. Japan, 6 (1954), pp 343–353. CrossRef
 Title
 Combinatorial bounds for broadcast encryption
 Book Title
 Advances in Cryptology — EUROCRYPT'98
 Book Subtitle
 International Conference on the Theory and Application of Cryptographic Techniques Espoo, Finland, May 31 – June 4, 1998 Proceedings
 Pages
 pp 512526
 Copyright
 1998
 DOI
 10.1007/BFb0054150
 Print ISBN
 9783540645184
 Online ISBN
 9783540697954
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 1403
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors
 Authors

 Michael Luby ^{(1)}
 Jessica Staddon ^{(2)}
 Author Affiliations

 1. International Computer Science Institute, 1947 Center St., Suite 600, 947041198, Berkeley, CA
 2. RSA Laboratories, 100 Marine Parkway, Suite 500, 940651031, Redwood City, CA
Continue reading...
To view the rest of this content please follow the download PDF link above.