Cryptology ePrint Archive: Report 2014/195

Low Overhead Broadcast Encryption from Multilinear Maps

Dan Boneh and 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.

Category / Keywords: public-key cryptography / Broadcast encryption, multilinear maps

Original Publication (with major differences): IACR-CRYPTO-2014

Date: received 13 Mar 2014, last revised 28 Jun 2014

Contact author: mzhandry at stanford edu

Available format(s): PDF | BibTeX Citation

Version: 20140628:184503 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]