TY - GEN
T1 - Efficient Anonymous Multi-group Broadcast Encryption
AU - Kim, Intae
AU - Hwang, Seong Oun
AU - Susilo, Willy
AU - Baek, Joonsang
AU - Kim, Jongkil
N1 - Funding Information:
This work is partially supported by the Australian Research Council Discovery Project DP180100665. I. Kim was also supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (NRF-2017R1A6A3A01076090). S. O. Hwang was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIP) (No. 2020R1A2B5B01002145).
Publisher Copyright:
© 2020, Springer Nature Switzerland AG.
PY - 2020
Y1 - 2020
N2 - Nowadays, broadcasters must supply diverse content to multiple groups without delay in platforms such as social media and streaming sites. Unfortunately, conventional broadcast encryption schemes are deemed unsuitable for such platforms since they generate an independent ciphertext for each piece of contents and hence the number of headers generated during encryption increases linearly with the size of contents. The increased number of headers will result in wasting a limited network bandwidth, which makes the application impractical. To resolve this issue, multi-channel broadcast encryption was proposed in the literature, which transmits a single header for multiple channels to several groups of viewers at a time. However, the multi-channel broadcast encryption is also impractical because it requires heavy computations, communications, and storage overheads. Moreover, it should also address additional issues, such as receiver privacy (anonymity), static user-set size, and limited encryption. In this work, we aim to tackle this problem by proposing an efficient broadcast encryption scheme, called “anonymous multi-group broadcast encryption”. This primitive achieves faster encryption and decryption, provides smaller sized public parameters, private keys, and ciphertexts. Hence, it solves the aforementioned issues of the multi-channel broadcast encryption. Specifically, the proposed scheme provides provable anonymity and confidentiality based on the External Diffie-Hellman (XDH) and-Decisional Bilinear Diffie-Hellman (DBDH) assumptions, respectively, in the standard model.
AB - Nowadays, broadcasters must supply diverse content to multiple groups without delay in platforms such as social media and streaming sites. Unfortunately, conventional broadcast encryption schemes are deemed unsuitable for such platforms since they generate an independent ciphertext for each piece of contents and hence the number of headers generated during encryption increases linearly with the size of contents. The increased number of headers will result in wasting a limited network bandwidth, which makes the application impractical. To resolve this issue, multi-channel broadcast encryption was proposed in the literature, which transmits a single header for multiple channels to several groups of viewers at a time. However, the multi-channel broadcast encryption is also impractical because it requires heavy computations, communications, and storage overheads. Moreover, it should also address additional issues, such as receiver privacy (anonymity), static user-set size, and limited encryption. In this work, we aim to tackle this problem by proposing an efficient broadcast encryption scheme, called “anonymous multi-group broadcast encryption”. This primitive achieves faster encryption and decryption, provides smaller sized public parameters, private keys, and ciphertexts. Hence, it solves the aforementioned issues of the multi-channel broadcast encryption. Specifically, the proposed scheme provides provable anonymity and confidentiality based on the External Diffie-Hellman (XDH) and-Decisional Bilinear Diffie-Hellman (DBDH) assumptions, respectively, in the standard model.
KW - Anonymous multi-group broadcast encryption
KW - Broadcast encryption
KW - Inner product evaluation
KW - Multi-channel broadcast encryption
UR - http://www.scopus.com/inward/record.url?scp=85091292995&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-57808-4_13
DO - 10.1007/978-3-030-57808-4_13
M3 - Conference contribution
AN - SCOPUS:85091292995
SN - 9783030578077
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 251
EP - 270
BT - Applied Cryptography and Network Security - 18th International Conference, ACNS 2020, Proceedings
A2 - Conti, Mauro
A2 - Zhou, Jianying
A2 - Casalicchio, Emiliano
A2 - Spognardi, Angelo
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 19 October 2020 through 22 October 2020
ER -