标题:Identity-Based Broadcast Encryption with Efficient Revocation
作者:Ge, Aijun ;Wei, Puwen
通讯作者:Ge, Aijun
作者机构:[Ge, Aijun ;Wei, Puwen ] Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Shandong University, Jinan, China;[ 更多
会议名称:22nd IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2019
会议日期:14 April 2019 through 17 April 2019
来源:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
出版年:2019
卷:11442 LNCS
页码:405-435
DOI:10.1007/978-3-030-17253-4_14
关键词:Asymmetric pairings; Broadcast encryption; Constant size ciphertext; Provable security; Revocation
摘要:Identity-based broadcast encryption (IBBE) is an effective method to protect the data security and privacy in multi-receiver scenarios, which can make broadcast encryption more practical. This paper further expands the study of scalable revocation methodology in the setting of IBBE, where a key authority releases a key update material periodically in such a way that only non-revoked users can update their decryption keys. Following the binary tree data structure approach, a concrete instantiation of revocable IBBE scheme is proposed using asymmetric pairings of prime order bilinear groups. Moreover, this scheme can withstand decryption key exposure, which is proven to be semi-adaptively secure under chosen plaintext attacks in the standard model by reduction to static complexity assumptions. In particular, the proposed scheme is very efficient both in terms of computation costs and communication bandwidth, as the ciphertext size is constant, regardless of the number of recipients. To demonstrate the practicality, it is further implemented in Charm, a framework for rapid prototyping of cryptographic primitives. © 2019, International Association for Cryptologic Research.
收录类别:EI;SCOPUS
资源类型:会议论文;期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85064945874&doi=10.1007%2f978-3-030-17253-4_14&partnerID=40&md5=6cc2d711cc635356dbb7b5b981ecbb1c
TOP