Paper 2015/342

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

Yan Zhu, Xin Wang, Di Ma, and Ruiqi Guo


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.

Available format(s)
Public-key cryptography
Publication info
Published elsewhere. Major revision. AsiaCCS 2015
Broadcast EncryptionCryptographic MembershipAggregation Function
Contact author(s)
zhuyan @ ustb edu cn
dmadma @ umich edu
2015-04-28: revised
2015-04-20: received
See all versions
Short URL
Creative Commons Attribution


      author = {Yan Zhu and Xin Wang and Di Ma and Ruiqi Guo},
      title = {Identity-Set-based Broadcast Encryption supporting “Cut-or-Select” with Short Ciphertext},
      howpublished = {Cryptology ePrint Archive, Paper 2015/342},
      year = {2015},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.