# zbMATH — the first resource for mathematics

Fully CCA2 secure identity based broadcast encryption without random oracles. (English) Zbl 1211.68187
Summary: In broadcast encryption schemes, a broadcaster encrypts messages and transmits them to some subset $$S$$ of users who are listening to a broadcast channel. Any user in $$S$$ can use his private key to decrypt the broadcast. An identity based cryptosystem is a public key cryptosystem where the public key can be represented as an arbitrary string. In this paper, we propose the first Identity Based Broadcast Encryption (IBBE) scheme that is IND-ID-CCA2 secure without random oracles. The public key and ciphertext are constant size, and the private key size is linear in the total number of receivers. To the best of our knowledge, it is the first IBBE scheme that is fully CCA2 secure without random oracles. Moreover, our IBBE scheme is collusion resistant for arbitrarily large collusion of users.

##### MSC:
 68P25 Data encryption (aspects in computer science)
Full Text:
##### References:
 [1] Fiat, A.; Naor, M., Broadcast encryption, (), 480-491 · Zbl 0870.94026 [2] Shamir, A., Identity-based cryptosystems and signature schemes, (), 47-53 · Zbl 1359.94626 [3] Waters, B., Efficient identity-based encryption without random oracles, (), 114-127 · Zbl 1137.94360 [4] Cocks, C., An identity based encryption scheme based on quadratic residues, (), 360-363 · Zbl 0999.94532 [5] Delerablee, C., Identity-based broadcast encryption with constant size ciphertext and private keys, (), 200-215 · Zbl 1153.94366 [6] Delerablee, C.; Paillier, P.; Pointcheval, D., Fully collusion secure dynamic broadcast encryption with constant-size ciphertexts or decryption keys, (), 39-59 · Zbl 1151.94502 [7] Gentry, C., Practical identity-based encryption without random oracles, (), 445-464 · Zbl 1140.94340 [8] Boneh, D.; Gentry, C.; Waters, B., Collusion resistant broadcast encryption with short ciphertexts and private keys, (), 258-275 · Zbl 1145.94434 [9] Boneh, D.; Franklin, M., Identity-based encryption from the Weil pairing, (), 213-229 · Zbl 1002.94023 [10] Boneh, D.; Boyen, X., Efficient selective-ID secure identity based encryption without random oracles, (), 223-238 · Zbl 1122.94355 [11] Boneh, D.; Boyen, X., Secure identity based encryption without random oracles, (), 443-459 · Zbl 1104.94019 [12] Boneh, D.; Boyen, X.; Goh, E.J., Hierarchical identity based encryption with constant size ciphertext, (), 440-456 · Zbl 1137.94340 [13] Halevy, D.; Shamir, A., The LSD broadcast encryption scheme, (), 47-60 · Zbl 1026.94528 [14] Naor, D.; Naor, M.; Lotspiech, J., Revocation and tracing schemes for stateless receivers, (), 41-62 · Zbl 1002.94522 [15] Goodrich, M.T.; Sun, J.Z.; Tamassia, R., Efficient tree-based revocation in groups of low-state devices, (), 511-527 · Zbl 1104.94021 [16] R. Canetti, O. Goldreich, S. Halevi, The random oracle methodology, revisited(preliminary version), in: Proceedings of the 13th Annual ACM Symposium on Theory of Computing—STOC’98, 1998, pp. 131-140 · Zbl 1027.68603 [17] Canetti, R.; Halevi, S.; Katz, J., Chosen-ciphertext security from identity-based encryption, (), 207-222 · Zbl 1122.94358
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.