Skip to main content
SpringerLink
Log in

Efficient revocable hierarchical identity-based encryption using cryptographic accumulators

  • Regular Contribution
  • Published:
International Journal of Information Security Aims and scope Submit manuscript

Abstract

Hierarchical identity-based encryption is an important extension from IBE and has found many applications in the network world. Private key revocation is a crucial requirement for any public key system. In this paper, we propose a novel revocation method for the hierarchical identity-based encryption. Existing revocable hierarchical identity-based encryption schemes have several disadvantages: the key update size increases logarithmically with the number of users in the system, the public information of key update received by each user is different and always related to the level of the identity hierarchy and the security proof of the revocable scheme is very complex. In our scheme, cryptographic accumulators are used to compress hierarchical levels and revoked users’ information into constant values. So we achieve almost constant size of private key update which is irrelevant with the user number in the system. Because of the compression of hierarchical information we can use simple dual system encryption techniques to prove our scheme to be fully secure under several common assumptions without resorting to complex nested dual system encryption techniques.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  1. Shamir, A.: Identity-based cryptosystems and signature schemes. In: Advances in Cryptology—Crypto 1984. Lecture Notes in Computer Science, vol. 196, pp. 47–53, Springer, Berlin (1984)

  2. Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Advances in Cryptology—CRYPTO 2001, pp. 213–229. Springer, Berlin (2001)

  3. Li, J., Li, J., Chen, X., Jia, C., Lou, W.: Identity-based encryption with outsourced revocation in cloud computing. IEEE Trans. Comput. (2015). doi:10.1109/TC.2013.208

  4. Lim, H.W., Paterson, K.G.: Identity-based cryptography for grid security. In: Proceedings of the e-Science, pp. 395–404 (2005)

  5. Su, L., Lim, H.W., Ling, S., et al.: Revocable IBE systems with almost constant-size key update. In: International Conference on Pairing-Based Cryptography Pairing 2013, pp. 168–185. Springer, Berlin (2014)

  6. Abdalla, M., Kiltz, E., Neven, G.: Generalised key delegation for hierarchical identity-based encryption. IET Inf. Secur. 2(3), 67–78 (2008)

    Article  Google Scholar 

  7. Seo, J.H., Emura, K.: Efficient delegation of key generation and revocation functionalities in identity-based encryption. CT-RSA 2013, 343–358 (2013)

    MathSciNet  MATH  Google Scholar 

  8. Tsai, T.-T., Tseng, Y.-M., Wu, T.-Y.: RHIBE: constructing revocable hierarchical ID-based encryption from HIBE. Informatica 25(2), 299–326 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  9. Ryu, G., Lee, K., Park, S., Lee, D.H.: Unbounded hierarchical identity-based encryption with efficient revocation. https://eprint.iacr.org/2015/827.pdf

  10. Bellare, M., Waters, B., Yilek, S.: Identity-based encryption secure against selective opening attack. TCC 2011, 235–252 (2011)

    MathSciNet  MATH  Google Scholar 

  11. Boneh, D., Boyen, X.: Efficient selective-id identity based encryption without random oracles. In: Advances in cryptology-EUROCRYPT 2004. LNCS, vol. 3027, pp. 223–238. Springer, Berlin (2004)

  12. Boldyreva, A., Goyal, V., Kumar, V.: Identity-based encryption with efficient revocation. In: Proceedings of the 15th ACM Conference on Computer and Communications Security, ACM, pp. 417–426 (2008)

  13. Naor, D., Naor, M., Lotspiech, J.: Revocation and tracing schemes for stateless receivers. In: Advances in Cryptology—CRYPTO 2001. LNCS, vol. 2139, pp. 41–62. Springer, Berlin (2001)

  14. Camenisch, J., Kohlweiss, M., Soriente, C.: An accumulator based on bilinear maps and efficient revocation for anonymous credentials. In: International Workshop on Public Key Cryptography—PKC 2009, pp. 481–500. Springer, Berlin (2009)

  15. Waters, B.: Dual system encryption: realizing fully secure IBE and HIBE under simple assumptions. In: Advances in Cryptology—Crypto09. LNCS, vol. 5677, pp. 619–636 (2009)

  16. Lewko, A., Waters, B.: Unbounded HIBE and attribute-based encryption. In Advances in Cryptology—Eurocrypt11. LNCS, vol. 6632, pp. 547–567 (2011)

Download references

Acknowledgements

This work is sponsored by the National Basic Research Program of China (973 Program) under Grant No. 2012CB315901.

Author information

Authors and Affiliations

  1. State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou, China

    Hongyong Jia, Yue Chen, Kaixiang Huang & Jun Wang

  2. China National Digital Switching System Engineering and Technological Research Centre, Zhengzhou, China

    Julong Lan

Authors
  1. Hongyong Jia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yue Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Julong Lan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kaixiang Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jun Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hongyong Jia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jia, H., Chen, Y., Lan, J. et al. Efficient revocable hierarchical identity-based encryption using cryptographic accumulators. Int. J. Inf. Secur. 17, 477–490 (2018). https://doi.org/10.1007/s10207-017-0387-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10207-017-0387-8

Keywords

Search

Navigation