Skip to main content

A Practical Implementation of Hierarchically Structured Key Predistribution System and Its Evaluation

  • Conference paper
  • First Online:
Information Security (ISW 2000)

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

Included in the following conference series:

Abstract

In Key Predistribution Scheme(KPS) and One-Time use Broadcast Encryption Schemes(OTBES) a Trusted Authority(TA) generates secret information and distributes part of it to users. It also has to observe users’ dishonest acts to prevent collusion attacks. However, these tasks can be heavy for a TA if there are a large number of users in the system. In this paper, we propose Hierarchically Structured KPS(HS-KPS) as an effective solution for this problem. Then we evaluate its performance in terms of efficiency, security and memory size.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Matsumoto and H. Imai, “On the KEY PREDISTRIBUTION SYSTEM: A Practical Solution to the Key Distribution Problem,” Proc. of CRYPTO’87, LNCS 293, Springer-Verlag, pp.185–193, 1988.

    Google Scholar 

  2. R. Blom, “An Optimal Class of Symmetric Key Generation Systems,” Proc. of Eurocrypt’84, LNCS 209, Springer-Verlag, pp.335–338, 1985.

    Google Scholar 

  3. C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro and M. Yung, “Perfectly Secure Key Distribution for Dynamic Conferences,” Proc. of CRYPTO’ 92, LNCS 740, Springer-Verlag, pp.471–486, 1993.

    Google Scholar 

  4. C. Blundo, L.A. Frota Mattos and D.R. Stinson, “Trade-offs between Communication and Strage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution,” Proc. of CRYPTO’96, LNCS 1109, Springer-Verlag, pp. 387–400, 1996.

    Google Scholar 

  5. L. Gong and D. J. Wheeler, “A Matrix Key-Distribution Scheme,” Journal of Cryptology, vol. 2, pp.51–59, Springer-Verlag, 1993.

    MathSciNet  Google Scholar 

  6. W. A. Jackson, K. M. Martin, and C. M. O'Keefe, “Multisecret Threshold Schemes,” Proc. of CRYPTO’93, LNCS 773, pp.126–135, Springer-Verlag, 1994.

    Google Scholar 

  7. Y. Desmedt and V. Viswanathan, “Unconditionally Secure Dynamic Conference Key Distribution,” IEEE, ISIT’98, 1998.

    Google Scholar 

  8. A. Fiat and M. Naor, “Broadcast Encryption,” Proc. of CRYPTO’93, LNCS 773, Springer-Verlag, pp.480–491, 1994.

    Google Scholar 

  9. G. Hanaoka, T. Nishioka, Y. Zheng and H. Imai, “An Efficient Hierarchical Identity-based Key-Sharing Method Resistant against Collusion-Attacks,” Proc. of Asiacrypt’99, LNCS 1716, Springer-Verlag, pp.348–362, 1999.

    Google Scholar 

  10. G. Hanaoka, T. Nishioka, Y. Zheng and H. Imai, “Optimal Construction of Unconditionally Secure ID-Based Key Sharing Scheme for Large-Scale Networks,” Proc. of The Second International Conference on Information and Communication Security (ICICS’99), LNCS 1726, Springer-Verlag, pp.157–168, 1999.

    Google Scholar 

  11. K. Kurosawa, K. Okada, H. Saido and D. Stinson, “New Combimatorial Bounds for Authentication Codes and Key Predistribution Schemes,” Designs, Codes and Cryptography, 15, pp.87–100, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  12. K. Kurosawa, T. Yoshida, Y. Desmedt and M. Burmester, “Some Bounds and a Construction for Secure Broadcast Encryption,” Proc. of Asiacrypt’98, LNCS 1514, Springer-Verlag, pp. 420–433, 1998.

    Google Scholar 

  13. A. Beimel and B. Chor, “Communication in key destribution schemes,” IEEE Transactions on Information Theory, 42, pp.19–28, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  14. D. Stinson, “On Some Methods for Unconditionally Secure Key Distribution System and Broadcast Encryption,” Designs, Codes and Cryptography, 12, pp.215–243, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  15. Y. Shibuya, G. Hanaoka and H. Imai, “On the Hierarchical Structure of Trusted Authority for Unconditionally Secure Cryptography,” Proc. of Joint Workshop on Information Security and Cryptology 2000 (JWISC2000), pp.207–212, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nojiri, D., Hanaoka, G., Imai, H. (2000). A Practical Implementation of Hierarchically Structured Key Predistribution System and Its Evaluation. In: Goos, G., Hartmanis, J., van Leeuwen, J., Pieprzyk, J., Seberry, J., Okamoto, E. (eds) Information Security. ISW 2000. Lecture Notes in Computer Science, vol 1975. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44456-4_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-44456-4_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41416-2

  • Online ISBN: 978-3-540-44456-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics