Paper 2014/195

Low Overhead Broadcast Encryption from Multilinear Maps

Dan Boneh, Brent Waters, and Mark Zhandry


We use multilinear maps to provide a solution to the long-standing problem of public-key broadcast encryption where all parameters in the system are small. In our constructions, ciphertext overhead, private key size, and public key size are all poly-logarithmic in the total number of users. The systems are fully collusion-resistant against any number of colluders. All our systems are based on an O(log N)-way multilinear map to support a broadcast system for N users. We present three constructions based on different types of multilinear maps and providing different security guarantees. Our systems naturally give identity-based broadcast systems with short parameters.

Available format(s)
Public-key cryptography
Publication info
A major revision of an IACR publication in CRYPTO 2014
Broadcast encryptionmultilinear maps
Contact author(s)
mzhandry @ stanford edu
2014-06-28: last of 2 revisions
2014-03-13: received
See all versions
Short URL
Creative Commons Attribution


      author = {Dan Boneh and Brent Waters and Mark Zhandry},
      title = {Low Overhead Broadcast Encryption from Multilinear Maps},
      howpublished = {Cryptology ePrint Archive, Paper 2014/195},
      year = {2014},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.