Cryptology ePrint Archive: Report 2015/342

Identity-Set-based Broadcast Encryption supporting “Cut-or-Select” with Short Ciphertext

Yan Zhu and Xin Wang and Di Ma and Ruiqi Guo

Abstract: In this paper we present an identity-set-based broadcast encryption scheme with three working modes: positive membership (Select-mode), all member (All-mode), and negative membership (Cut-mode) over the user identity set, simultaneously.The core of our scheme is the implementation of cryptographic representation of subset by using two aggregation functions: Zeros-based aggregation and Poles-based aggregation. These two aggregation functions are capable of compressing any subset into one element in a bilinear map group for determining the membership between an element and a subset. Our scheme achieves the optimal bound of O(1)-size for either ciphertext (consisting of just two elements) or decryption key (one element) for an identity set of large size. We prove that our scheme is secure under the General Diffie-Hellman Exponent (GDHE) assumption.

Category / Keywords: public-key cryptography / Broadcast Encryption, Cryptographic Membership, Aggregation Function

Original Publication (with major differences): AsiaCCS 2015

Date: received 16 Apr 2015, last revised 28 Apr 2015

Contact author: zhuyan at ustb edu cn; dmadma@umich edu

Available format(s): PDF | BibTeX Citation

Version: 20150428:090845 (All versions of this report)

Short URL: ia.cr/2015/342

Discussion forum: Show discussion | Start new discussion