Skip to main content

On the Distribution of a Key Distribution Center

  • Conference paper
  • First Online:
Theoretical Computer Science (ICTCS 2001)

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

Included in the following conference series:

Abstract

A Key Distribution Center of a network is a server who generates and distributes secret keys used by groups of users to securely communicate. A Distributed Key Distribution Center is a set of servers that jointly realizes a Key Distribution Center. In this paper we study Distributed Key Distribution Centers, pointing out the advantages of this approach to Key Distribution. We propose an information theoretic model of Distributed Key Distribution Center, and present bounds holding on the model. Moreover, we show that a protocol described in [5], which uses Shamir’s secret sharing schemes, meets the bounds and is, hence, optimal with respect to information storage, communication complexity, and randomness as well.

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. C. Blundo, and P. D’Arco, An Information Theoretic Model for Distributed Key Distribution, Proceedings of the 2000 IEEE International Symposium on Information Theory, pp. 270, 2000.

    Google Scholar 

  2. C. Blundo, A. De Santis, and U. Vaccaro, Randomness in Distribution Protocols, Information and Computation, vol. 131, no. 2, pp. 111–139, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  3. Cover T. M. and Thomas J. A., Elements of Information Theory, John Wiley & Sons, 1991.

    Google Scholar 

  4. Knuth D. E. and Yao A. C., The Complexity of Nonuniform Random Number Generation, Algorithms and Complexity, Academic Press, pp. 357–428, 1976.

    Google Scholar 

  5. M. Naor, B. Pinkas, and O. Reingold, Distributed Pseudo-random Functions and KDCs, Advances in Cryptology — Eurocrypt 99, Lecture notes in Computer Science, vol. 1592, pp. 327–346, 1999.

    Google Scholar 

  6. R. M. Needham and M. D. Schroeder, Using Encryption for Authentication in Large Networks of Computers, Communications of ACM, vol. 21, pp. 993–999, 1978.

    Article  MATH  Google Scholar 

  7. B. C. Neuman and T. Tso, Kerberos: An Authentication Service for Computer Networks, IEEE Transaction on Communications, vol. 32, pp. 33–38, 1994.

    Google Scholar 

  8. A. Shamir, How to Share a Secret, Communications of ACM, vol. 22, n. 11, pp. 612–613, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  9. D. R. Stinson, On Some Methods for Unconditional Secure Key Distribution and Broadcast Encryption, Design, Codes and Cryptography, vol. 12, pp. 215–243, 1997.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

D’Arco, P. (2001). On the Distribution of a Key Distribution Center. In: Theoretical Computer Science. ICTCS 2001. Lecture Notes in Computer Science, vol 2202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45446-2_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-45446-2_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42672-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics