[Resource Topic] 2014/195: Low Overhead Broadcast Encryption from Multilinear Maps

Welcome to the resource topic for 2014/195

Title:
Low Overhead Broadcast Encryption from Multilinear Maps

Authors: Dan Boneh, Brent Waters, 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.

ePrint: https://eprint.iacr.org/2014/195

Talk: https://www.youtube.com/watch?v=qgfUcmbyNVI

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .