Paper 2014/195

Low Overhead Broadcast Encryption from Multilinear Maps

Dan Boneh, Brent Waters, and Mark Zhandry

Abstract

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.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
A major revision of an IACR publication in Crypto 2014
Keywords
Broadcast encryptionmultilinear maps
Contact author(s)
mzhandry @ stanford edu
History
2014-06-28: last of 2 revisions
2014-03-13: received
See all versions
Short URL
https://ia.cr/2014/195
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2014/195,
      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{https://eprint.iacr.org/2014/195}},
      url = {https://eprint.iacr.org/2014/195}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.