Recipient Revocable Broadcast Encryption Schemes Without Random Oracles

  • Kamalesh Acharya
  • Ratna Dutta
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10779)


Public key broadcast encryption system is a fundamental cryptographic primitive that enables a broadcaster to transmit encrypted content to a set of users allowing only a privileged subset of users to decrypt the content. Traditionally, it is not possible to remove any receiver from the encrypted content without decryption. Recipient revocable broadcast encryption (RRBE) is an useful cryptographic primitive whereby a trusted third party can revoke a set of users from the encrypted content without having the ability to decrypt it. This property is not achievable in traditional broadcast encryption (BE) schemes. However, the currently existing RRBE schemes are secure only in the random oracle model. In this paper, we propose two new constructions for RRBE with constant number of pairing, linear exponentiation operations and analyze their security in the standard model. Our first construction achieves adaptive security in the standard model with constant communication cost as opposed to the existing adaptively secure RRBE schemes all of which use random oracles and have linear communication cost. The storage and computation complexity are linear to the total number of users and the number of subscribed users respectively.

Our second construction attains selective security in the standard model with constant size public parameter and secret key. The communication and computation overhead are linear to the number of revoked users. We emphasize that, this scheme is flexible in a sense that constant size public parameter allows to encrypt any number of users in the system.

The proposed constructions are highly comparable with the existing similar schemes, exhibits better performance over them and practically more efficient.


Recipient revocable broadcast encryption Chosen plaintext attack Adaptive security 


  1. 1.
    Acharya, K., Dutta, R.: Secure and efficient construction of broadcast encryption with dealership. In: Chen, L., Han, J. (eds.) ProvSec 2016. LNCS, vol. 10005, pp. 277–295. Springer, Cham (2016). Google Scholar
  2. 2.
    Acharya, K., Dutta, R.: Adaptively secure broadcast encryption with dealership. In: Hong, S., Park, J.H. (eds.) ICISC 2016. LNCS, vol. 10157, pp. 161–177. Springer, Cham (2017). CrossRefGoogle Scholar
  3. 3.
    Acharya, K., Dutta, R.: Enhanced outsider-anonymous broadcast encryption with subset difference revocation. IACR Cryptol. ePrint Arch. 2017, 265 (2017)Google Scholar
  4. 4.
    Acharya, K., Dutta, R.: Provable secure constructions for broadcast encryption with personalized messages. In: Okamoto, T., Yu, Y., Au, M.H., Li, Y. (eds.) ProvSec 2017. LNCS, vol. 10592, pp. 329–348. Springer, Cham (2017). CrossRefGoogle Scholar
  5. 5.
    Attrapadung, N., Libert, B., de Panafieu, E.: Expressive key-policy attribute-based encryption with constant-size ciphertexts. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 90–108. Springer, Heidelberg (2011). CrossRefGoogle Scholar
  6. 6.
    Boneh, D., Boyen, X., Goh, E.-J.: Hierarchical identity based encryption with constant size ciphertext. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 440–456. Springer, Heidelberg (2005). CrossRefGoogle Scholar
  7. 7.
    Boneh, D., Gentry, C., Waters, B.: Collusion resistant broadcast encryption with short ciphertexts and private keys. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 258–275. Springer, Heidelberg (2005). CrossRefGoogle Scholar
  8. 8.
    Boneh, D., Waters, B., Zhandry, M.: Low overhead broadcast encryption from multilinear maps. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 206–223. Springer, Heidelberg (2014). CrossRefGoogle Scholar
  9. 9.
    Boneh, D., Zhandry, M.: Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 480–499. Springer, Heidelberg (2014). CrossRefGoogle Scholar
  10. 10.
    Delerablée, C.: Identity-based broadcast encryption with constant size ciphertexts and private keys. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 200–215. Springer, Heidelberg (2007). CrossRefGoogle Scholar
  11. 11.
    Fiat, A., Naor, M.: Broadcast encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 480–491. Springer, Heidelberg (1994). CrossRefGoogle Scholar
  12. 12.
    Lai, J., Mu, Y., Guo, F., Chen, R.: Fully privacy-preserving ID-based broadcast encryption with authorization. Comput. J. 60(12), 1809–1821 (2017)CrossRefGoogle Scholar
  13. 13.
    Lai, J., Mu, Y., Guo, F., Susilo, W., Chen, R.: Anonymous identity-based broadcast encryption with revocation for file sharing. In: Liu, J.K., Steinfeld, R. (eds.) ACISP 2016. LNCS, vol. 9723, pp. 223–239. Springer, Cham (2016). CrossRefGoogle Scholar
  14. 14.
    Lai, J., Mu, Y., Guo, F., Susilo, W., Chen, R.: Fully privacy-preserving and revocable ID-based broadcast encryption for data access control in smart city. Pers. Ubiquitous Comput. 2017, 855–868 (2017)CrossRefGoogle Scholar
  15. 15.
    Lewko, A., Sahai, A., Waters, B.: Revocation systems with very small private keys. In: IEEE Symposium on Security and Privacy, pp. 273–285 (2010)Google Scholar
  16. 16.
    Ren, Y., Wang, S., Zhang, X.: Non-interactive dynamic identity-based broadcast encryption without random oracles. In: Chim, T.W., Yuen, T.H. (eds.) ICICS 2012. LNCS, vol. 7618, pp. 479–487. Springer, Heidelberg (2012). CrossRefGoogle Scholar
  17. 17.
    Susilo, W., Chen, R., Guo, F., Yang, G., Mu, Y., Chow, Y.-W.: Recipient revocable identity-based broadcast encryption: how to revoke some recipients in IBBE without knowledge of the plaintext. In: Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, ASIA CCS 2016, pp. 201–210 (2016)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of MathematicsIndian Institute of Technology KharagpurKharagpurIndia

Personalised recommendations