Skip to main content

A Novel Hierarchical Key Management Scheme Based on Quadratic Residues

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3358))

Abstract

In 1997, Lin [1] proposed a dynamic key management scheme using user hierarchical structure. After that, Lee [2] brought to two comments on Lin’s method. In 2002, Lin [3] proposed a more efficient hierarchical key management scheme based on Elliptic Curve. Lin’s efficient scheme solves the weaknesses appearing in Lee’s scheme in [1]. In this paper, we further use Quadratic Residues (Q.R.) theorem to reduce the computing complexity of Lin’s method.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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. Lin, C.H.: Dynamic key management schemes for access control in a hierarchy. Computer Communications 20, 1381–1385 (1997)

    Article  Google Scholar 

  2. Lee, N.Y., Hwang, T.: Research note Comments on ‘dynamic key management schemes for access control in a hierarchy’. Computer Communications 22, 87–89 (1999)

    Article  Google Scholar 

  3. Lin, C.H., Lee, J.H.: An Efficient Hierarchical Key Management Scheme Based on Elliptic Curves. Journal of Interdisciplinary Mathematics 5(3), 293–301 (2002)

    MATH  MathSciNet  Google Scholar 

  4. Chang, C.C., Tsu, S.M.: Remote scheme for password authentication based on theory of quadratic residues. Computer Communications 18, 936–942 (1995)

    Article  Google Scholar 

  5. Rosen, K.H.: Elementary Number Theory and Its Applications. Addison-Wesley, Reading (1988)

    MATH  Google Scholar 

  6. Tan, K.J., Zhu, H.W.: Research note A conference key distribution scheme based on the theory of quadratic residues. Computer Communications 22, 735–738 (1999)

    Article  Google Scholar 

  7. Koblitz, N., Menezes, A., Vanstone, S.: The State of Elliptic curve Cryptography. Design, Codes and Cryptography 19, 173–193 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Draft FIPS 180-2, Secure Hash Standard (SHS), U.S. Doc/NIST, May 30 (2001)

    Google Scholar 

  9. Koblitz, N.: A Course in Number Theory and Cryptography, 2nd edn. Springer, New York (1994)

    Book  MATH  Google Scholar 

  10. Menezes, A.: Elliptic curve Public Key Cryptosystems. Kluwer Academic Publishers, Dordrecht (1993)

    MATH  Google Scholar 

  11. Harn, L., Lin, L.Y.: A Cryptographic Key Generation Scheme for Multi-Level Data Security. Computer and Security 9, 539–546 (1990)

    Article  Google Scholar 

  12. Patterson, W.: Mathematical Cryptology for Computer Scientists and Mathematicians. Rowman (1987)

    Google Scholar 

  13. Fan, C.I., Lei, C.L.: Low Computation Partially Blind Signatures for Electronic Cash. IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences E81-A(5) (1998) (to appear)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chou, JS., Lin, CH., Lee, TY. (2004). A Novel Hierarchical Key Management Scheme Based on Quadratic Residues. In: Cao, J., Yang, L.T., Guo, M., Lau, F. (eds) Parallel and Distributed Processing and Applications. ISPA 2004. Lecture Notes in Computer Science, vol 3358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30566-8_99

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30566-8_99

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24128-7

  • Online ISBN: 978-3-540-30566-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics