Skip to main content
Springer Nature Link
Log in

Towards Time-Bound Hierarchical Key Assignment for Secure Data Access Control

  • Conference paper
Multidisciplinary Social Networks Research (MISNC 2014)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 473))

Included in the following conference series:

  • International Conference, MISNC

  • 1120 Accesses

Abstract

Time-bound hierarchical key assignment (TBHKA) scheme is a cryptographic method to assign encryption keys to a set of security classes in a partially ordered hierarchy. Only the authorized subscriber who holds the corresponding key can access the encrypted resources. In 2005, Yeh proposed a RSA-based TBHKA scheme which is suitable for discrete time period. However, it had been proved insecure against colluding attacks. Up to now, no such TBHKA schemes were proposed. In this paper, we fuse pairing-based cryptography and RSA key construction to propose a secure TBHKA scheme. In particular, our scheme is suitable for discrete time period. The security analysis is demonstrated that our scheme is secure against outsider and insider attacks (including colluding attacks). Finally, the performance analysis and comparisons are given to demonstrate our advantage.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

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. Journal of Cryptology 25(2), 243–270 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  3. 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 

  4. Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. SIAM Journal on Computing 32(3), 586–615 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chen, C.M., Lin, Y.H., Lin, Y.C., Sun, H.M.: Rcda: recoverable concealed data aggregation for data integrity in wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems 23(4), 727–734 (2012)

    Article  Google Scholar 

  6. Chen, C.M., Wang, K.H., Wu, T.Y., Pan, J.S., Sun, H.M.: A scalable transitive human-verifiable authentication protocol for mobile devices. IEEE Transactions on Information Forensics and Security 8(8), 1318–1330 (2013)

    Article  Google Scholar 

  7. 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 

  8. 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 

  9. 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 

  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. Kayem, A.V., Martin, P., Akl, S.G.: Heuristics for improving cryptographic key assignment in a hierarchy. In: 21st International Conference on Advanced Information Networking and Applications Workshops, AINAW 2007, vol. 1, pp. 531–536. IEEE (2007)

    Google Scholar 

  12. Lenstra, A.K.: Integer factoring. Designs, Codes and Cryptography 19, 101–128 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lin, C.W., Hong, T.P., Chang, C.C., Wang, S.L.: A greedy-based approach for hiding sensitive itemsets by transaction insertion. Journal of Information Hiding and Multimedia Signal Processing 4(4), 201–227 (2013)

    Google Scholar 

  14. Lin, C.W., Hong, T.P., Hsu, H.C.: Reducing side effects of hiding sensitive itemsets in privacy preserving data mining. The Scientific World Journal 2014, Article ID 235837, 12 pages (2014)

    Google Scholar 

  15. Menezes, A.J., Van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography. CRC Press (2010)

    Google Scholar 

  16. Naor, D., Naor, M., Lotspiech, J.: Revocation and tracing schemes for stateless receivers. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 41–62. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  17. Sandhu, R.S., Samarati, P.: Access control: principle and practice. IEEE Communications Magazine 32(9), 40–48 (1994)

    Article  Google Scholar 

  18. Sui, Y., Maino, F., Guo, Y., Wang, K., Zou, X.: An efficient time-bound access control scheme for dynamic access hierarchy. In: 5th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2009, pp. 279–286. IEEE (2009)

    Google Scholar 

  19. 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 

  20. 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 

  21. 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 

  22. Wu, T.Y., Tsai, T.T., Tseng, Y.M.: A revocable id-based signcryption scheme. Journal of Information Hiding and Multimedia Signal Processing 3(3), 240–251 (2012)

    MathSciNet  Google Scholar 

  23. 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 

  24. 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 

  25. 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 

  26. 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 

  27. 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

  1. Shenzhen Graduate School, Harbin Institute of Technology, Shenzhen, 518055, China

    Tsu-Yang Wu, Chengxiang Zhou, Chien-Ming Chen, Eric Ke Wang & Jeng-Shyang Pan

  2. Shenzhen Key Laboratory of Internet Information Collaboration, Shenzhen, 518055, China

    Tsu-Yang Wu, Chien-Ming Chen, Eric Ke Wang & Jeng-Shyang Pan

Authors
  1. Tsu-Yang Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chengxiang Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chien-Ming Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Eric Ke Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jeng-Shyang Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. National University of Kaohsiung, Taiwan

    Leon Shyue-Liang Wang

  2. Chung-Ang University, Seoul, Korea

    Jason J. June

  3. Dept of Electrical Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung, Taiwan

    Chung-Hong Lee

  4. Osaka University, Japan

    Koji Okuhara

  5. National University of Kaohsiung, Dept of Information Management, Kaohsiung, Taiwan

    Hsin-Chang Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, TY., Zhou, C., Chen, CM., Wang, E.K., Pan, JS. (2014). Towards Time-Bound Hierarchical Key Assignment for Secure Data Access Control. In: Wang, L.SL., June, J.J., Lee, CH., Okuhara, K., Yang, HC. (eds) Multidisciplinary Social Networks Research. MISNC 2014. Communications in Computer and Information Science, vol 473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45071-0_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-45071-0_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-45070-3

  • Online ISBN: 978-3-662-45071-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation