TY - GEN
T1 - Efficient Fully Anonymous Public-Key Trace and Revoke with Adaptive IND-CCA Security
AU - Mandal, Mriganka
AU - Sarkar, Ramprasad
AU - Hur, Junbeom
AU - Nuida, Koji
N1 - Funding Information:
Acknowledgments. This work was supported by Institute of Information & Communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT) (No. 2019-0-00533, IITP-2021-2020-0-01819).
Publisher Copyright:
© 2021, Springer Nature Switzerland AG.
PY - 2021
Y1 - 2021
N2 - We aim to efficiently design a unified, cost-effective primitive exhibiting two mutually orthogonal functionalities, namely subscribed users anonymity and public-key traitor traceability in the context of Broadcast Encryption (BE), and propose an explicit construction of identity-based Fully Anonymous Public-Key Trace and Revoke (FAnoPKTR) scheme that is obtained by coupling the Identity-Based Encryption (IBE) framework with the collusion-secure optimal probabilistic fingerprinting codes. In addition to being adaptively secure, our design is proven to be INDistinguishable Chosen-Ciphertext Attack (IND-CCA) secure under asymmetric Decisional Bilinear Diffie-Hellman Type-3 (DBDH-3) assumption in standard security model without random oracles. Our asymmetric Type-3 bilinear pairing-based scheme has communication bandwidth that grows with the size of a subscriber set for any encryption, and the user secret-key size is constant. Moreover, our decryption algorithm is faster, which requires only three asymmetric pairings to recover the encrypted broadcast message.
AB - We aim to efficiently design a unified, cost-effective primitive exhibiting two mutually orthogonal functionalities, namely subscribed users anonymity and public-key traitor traceability in the context of Broadcast Encryption (BE), and propose an explicit construction of identity-based Fully Anonymous Public-Key Trace and Revoke (FAnoPKTR) scheme that is obtained by coupling the Identity-Based Encryption (IBE) framework with the collusion-secure optimal probabilistic fingerprinting codes. In addition to being adaptively secure, our design is proven to be INDistinguishable Chosen-Ciphertext Attack (IND-CCA) secure under asymmetric Decisional Bilinear Diffie-Hellman Type-3 (DBDH-3) assumption in standard security model without random oracles. Our asymmetric Type-3 bilinear pairing-based scheme has communication bandwidth that grows with the size of a subscriber set for any encryption, and the user secret-key size is constant. Moreover, our decryption algorithm is faster, which requires only three asymmetric pairings to recover the encrypted broadcast message.
KW - Adaptive IND-CCA security
KW - Anonymity and privacy
KW - Broadcast encryption
KW - Collusion-secure codes
KW - Fraud detection and revocation
KW - Identity-based encryption
KW - Type-3 bilinear map
UR - http://www.scopus.com/inward/record.url?scp=85122039032&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-93206-0_11
DO - 10.1007/978-3-030-93206-0_11
M3 - Conference contribution
AN - SCOPUS:85122039032
SN - 9783030932053
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 168
EP - 189
BT - Information Security Practice and Experience - 16th International Conference, ISPEC 2021, Proceedings
A2 - Deng, Robert
A2 - Bao, Feng
A2 - Wang, Guilin
A2 - Shen, Jian
A2 - Ryan, Mark
A2 - Meng, Weizhi
A2 - Wang, Ding
PB - Springer Science and Business Media Deutschland GmbH
T2 - 16th International Conference on Information Security Practice and Experience, ISPEC 2021
Y2 - 17 December 2021 through 19 December 2021
ER -