#### Paper 2014/195

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.

Available format(s)
Category
Public-key cryptography
Publication info
A major revision of an IACR publication in CRYPTO 2014
Keywords
Contact author(s)
mzhandry @ stanford edu
History
2014-06-28: last of 2 revisions
See all versions
Short URL
https://ia.cr/2014/195

CC BY

BibTeX

@misc{cryptoeprint:2014/195,
author = {Dan Boneh and Brent Waters and Mark Zhandry},