Skip to main content

An Efficient Solution for Time-Bound Hierarchical Key Assignment Scheme

  • Conference paper
  • First Online:
  • 1611 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 388))

Abstract

Time-bound hierarchical key assignment (TBHKA) scheme is a cryptographic method. It can assign encryption keys depending on time to a set of security classes in a partially ordered hierarchy. Only the authorized user can compute the encryption key to access the subscribing class (including lower down class) according to the hierarchy. In 2005, Yeh firstly proposed a RSA-based TBHKA scheme supporting discrete time period. However, it had been proved insecure against user colluding attacks. Up to now, there are less study for TBHKA scheme supporting discrete time period. In this paper, we propose a secure and efficient TBHKA scheme. Our scheme is based on pairing-based public key cryptosystem and supports discrete time period. The security analysis is demonstrated that our scheme is secure against outside adversary and malicious user. Finally, we make comparisons between recently proposed two TBHKA schemes and our scheme. It will show the advantages of our scheme.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akl, S.G., Taylor, P.D.: Cryptographic solution to a problem of access control in a hierarchy. ACM Transactions on Computer Systems (TOCS) 1(3), 239–248 (1983)

    Article  Google Scholar 

  2. Ateniese, G., De Santis, A., Ferrara, A.L., Masucci, B.: Provably-secure time-bound hierarchical key assignment schemes. In: Proceedings of the 13th ACM Conference on Computer and Communications security, pp. 288–297. ACM (2006)

    Google Scholar 

  3. Ateniese, G., De Santis, A., Ferrara, A.L., Masucci, B.: Provably-secure time-bound hierarchical key assignment schemes. Journal of Cryptology 25(2), 243–270 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  4. Blanton, M., Fazio, N., Frikken, K.B.: Dynamic and efficient key management for access hierarchies. In: Proceedings of the ACM Conference on Computer and Communications Security (2005)

    Google Scholar 

  5. Chen, C.M., Wu, T.Y., He, B.Z., Sun, H.M.: An efficient time-bound hierarchical key management scheme without tamper-resistant devices. In: 2012 International Conference on Computing, Measurement, Control and Sensor Network (CMCSN), pp. 285–288. IEEE (2012)

    Google Scholar 

  6. Chen, Y.-R., Chu, C.-K., Tzeng, W.-G., Zhou, J.: Cloudhka: a cryptographic approach for hierarchical access control in cloud computing. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 37–52. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  7. Cheng, Z.: Implementing pairing-based cryptosystems in usb tokens. IACR Cryptology ePrint Achieve 2014(71) (2014)

    Google Scholar 

  8. Chien, H.Y.: Efficient time-bound hierarchical key assignment scheme. IEEE Transactions on Knowledge and Data Engineering 16(10), 1301–1304 (2004)

    Article  MathSciNet  Google Scholar 

  9. He, B.Z., Chen, C.M., Wu, T.Y., Sun, H.M.: An efficient solution for hierarchical access control problem in cloud environment. Mathematical Problems in Engineering 2014, Article ID 569397, p. 8 (2014)

    Google Scholar 

  10. Jiang, T., Zheng, S., Liu, B.: Key distribution based on hierarchical access control for conditional access system in dtv broadcast. IEEE Transactions on Consumer Electronics 50(1), 225–230 (2004)

    Article  Google Scholar 

  11. Tseng, Y.M., Yu, C.H., Wu, T.Y.: Towards scalable key management for secure multicast communication. Information Technology And Control 41(2), 173–182 (2012)

    Article  Google Scholar 

  12. Tzeng, W.G.: A time-bound cryptographic key assignment scheme for access control in a hierarchy. IEEE Transactions on Knowledge and Data Engineering 14(1), 182–188 (2002)

    Article  MathSciNet  Google Scholar 

  13. Wang, S.Y., Laih, C.S.: Merging: an efficient solution for a time-bound hierarchical key assignment scheme. IEEE Transactions on Dependable and Secure Computing 3(1), 91–100 (2006)

    Article  Google Scholar 

  14. Wu, T.Y., Tseng, Y.M.: An id-based mutual authentication and key exchange protocol for low-power mobile devices. The Computer Journal 53(7), 1062–1070 (2010)

    Article  Google Scholar 

  15. Wu, T.-Y., Zhou, C., Wang, E.K., Pan, J.-S., Chen, C.-M.: Towards time-bound hierarchical key management in cloud computing. In: Pan, J.-S., Snasel, V., Corchado, E.S., Abraham, A., Wang, S.-L. (eds.) Intelligent Data Analysis and Its Applications, Volume I. AISC, vol. 297, pp. 31–38. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  16. Yeh, J.H.: A secure time-bound hierarchical key assignment scheme based on rsa public key cryptosystem. Information Processing Letters 105(4), 117–120 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  17. Yi, X.: Security of chien’s efficient time-bound hierarchical key assignment scheme. IEEE Transactions on Knowledge and Data Engineering 17(9), 1298–1299 (2005)

    Article  Google Scholar 

  18. Yi, X., Ye, Y.: Security of tzeng’s time-bound key assignment scheme for access control in a hierarchy. IEEE Transactions on Knowledge and Data Engineering 15(4), 1054–1055 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tsu-Yang Wu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Pan, JS., Wu, TY., Chen, CM., Wang, E.K. (2016). An Efficient Solution for Time-Bound Hierarchical Key Assignment Scheme. In: Zin, T., Lin, JW., Pan, JS., Tin, P., Yokota, M. (eds) Genetic and Evolutionary Computing. GEC 2015. Advances in Intelligent Systems and Computing, vol 388. Springer, Cham. https://doi.org/10.1007/978-3-319-23207-2_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23207-2_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23206-5

  • Online ISBN: 978-3-319-23207-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics