.png){kind=icon}
.png){kind=icon}
Return
Adaptively Secure Broadcast Encryption With Constant Ciphertexts
.png){kind=icon}
PRE
AI
DOI：10.1109/TBC.2016.2550759.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we present a new public key broadcast encryption (BE) for achieving adaptive security against arbitrary number of colluders. Specifically, our scheme is built from composite order multilinear maps and enjoys ciphertext overhead of a constant number of group elements which are O(1) bits. Furthermore, the private key size and public key size are all poly-logarithmic in the total number of users. Herein, we generalize the methodology of Lewko and Waters for realizing dual system encryption to the composite order multilinear groups, and then prove the adaptive security of our scheme under static assumptions in the standard model. Compared with the state-of-the-art, our scheme achieves the adaptive security in simple and non-interactive falsifiable assumptions with the optimized parameter size for BE.
Keywords:
Broadcast encryption
multilinear maps
adaptive security
constant sized ciphertexts
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.8
Papers:
2.1K
Citations:
3.0K