Combinatorial bounds for broadcast encryption

  • Michael Luby
  • Jessica Staddon
Conference paper

DOI: 10.1007/BFb0054150

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1403)
Cite this paper as:
Luby M., Staddon J. (1998) Combinatorial bounds for broadcast encryption. In: Nyberg K. (eds) Advances in Cryptology — EUROCRYPT'98. EUROCRYPT 1998. Lecture Notes in Computer Science, vol 1403. Springer, Berlin, Heidelberg

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 trade-off 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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Michael Luby
    • 1
  • Jessica Staddon
    • 2
  1. 1.International Computer Science InstituteBerkeley
  2. 2.RSA LaboratoriesRedwood City

Personalised recommendations