Summary: 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 polylogarithmic 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.
For the entire collection see [Zbl 1292.94002].