Cryptology ePrint Archive: Report 2019/038

Identity-based Broadcast Encryption with Efficient Revocation

Aijun Ge and Puwen Wei

Abstract: 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.

Category / Keywords: Broadcast encryption, revocation, asymmetric pairings, provable security, constant size ciphertext

Original Publication (with minor differences): IACR-PKC-2019

Date: received 15 Jan 2019, last revised 24 Apr 2019

Contact author: geaijun at 163 com

Available format(s): PDF | BibTeX Citation

Version: 20190424:094338 (All versions of this report)

Short URL: ia.cr/2019/038


[ Cryptology ePrint archive ]