Abstract
In this paper we investigate the issues concerning with the use of a single server across a network, the Key Distribution Center, to enable private communications within groups of users. After providing several motivations, showing the advantages related to the distribution of the task accomplished by this server, we describe a model for such a distribution, and present bounds on the amount of resources required in a real-world implementation: random bits, memory storage, and messages to be exchanged. Moreover, we introduce a linear algebraic approach to design optimal schemes distributing a Key Distribution Center and we show that some known previous constructions belong to the proposed framework.
The work of the third and the fourth authors was partially supported by Spanish Ministerio de Ciencia y Tecnología under project TIC 2000-1044.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Bellare and P. Rogaway. Provably Secure Session Key Distribution: The Three Party Case. Proc. 27th Annual Symposium on the Theory of Computing, ACM, 1995.
J. Benaloh and J. Leichter, Generalized Secret Sharing and Monotone Functions. Lecture Notes in Comput. Sci., 403, 27–35, 1990.
G.R. Blakley. Safeguarding Cryptographic Keys. Proceedings of AFIPS 1979 National Computer Conference, Vol. 48, pp. 313–317, 1979.
R. Blom. An Optimal Class of Symmetric Key Generation Systems. Advances in Cryptology-Eurocrypt’84, Lecture Notes in Comput. Sci., vol. 209, pp. 335–338, 1984.
C. Blundo, and P. D’Arco. Unconditionally Secure Distributed Key Distribution Schemes. Available at http://www.dia.unisa.it/paodar.dir
C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro and M. Yung. Perfectly-Secure Key Distribution for Dynamic Conferences. Information and Computation, vol. 146, no. 1, pp. 1–23, 1998.
E.F. Brickell. Some ideal secret sharing schemes. J. Combin. Math. and Combin. Comput., 9, 105–113, 1989.
R.M. Capocelli, A. De Santis, L. Gargano and U. Vaccaro. On the Size of the Shares in Secret Sharing Schemes. Advances in cryptology-CRYPTO’91, Lecture Notes in Comput. Sci., 576, 101–113, 1992.
R. Canetti, J. Garey, G.Itkins, D. Micciaccio, M. Naor and B. Pinkas. Issues in Multicast Security: A Taxonomy and Efficient Constructions. Proceedings of INFOCOM’ 99, vol. 2, pp. 708–716, 1999.
R. Canetti, T. Malkin and K. Nissim. Efficient Communication-Storage Tradeoffs for Multicast Encryption. Advances in Cryptology-Eurocrypt’99, Lecture Notes in Comput. Sci., vol. 1592, pp. 459–474, 1999.
B. Chor, A. Fiat, and M. Naor. Tracing Traitors. Advances in Cryptology-Eurocrypt’ 94, Lecture Notes in Comput. Sci., vol. 950 pp. 257–270, 1994.
T.M. Cover and J.A. Thomas. Elements of Information Theory. John Wiley & Sons, 1991.
A. Fiat and M. Naor. Broadcast Encryption. Advances in Cryptology-Crypto 92, Lecture Notes in Comput. Sci., vol. 773, pp. 480–491, 1993.
M. Ito, A. Saito and T, Nishizeki. Secret sharing scheme realizing any access structure. Proc. IEEE Globecom’87, 99–102, 1987.
W. Jackson and K. Martin. Geometric Secret Sharing Schemes and Their Duals. Des. Codes Cryptogr., 4, 83–95, 1994.
M. Just, E. Kranakis, D. Krizanc, P. Van Oorschot. Key Distribution via True Broadcasting. Proceedings of the 2nd ACM Conference on Computer and Communications Security, pp. 81–88, 1994.
M. Karchmer, A. Wigderson. On span programs. Proc. of Structure in Complexity’ 93, 102–111, 1993.
T. Matsumoto and H. Imai. On the Key Predistribution System: A Practical Solution to the Key Distribution Problem. Advances in Cryptology-Eurocrypt’87, Lecture Notes in Comput. Science, vol. 239, pp. 185–193, 1987.
M. Naor, B. Pinkas, and O. Reingold. Distributed Pseudo-random Functions and KDCs. Advances in Cryptology-Eurocrypt’99, Lecture Notes in Comput. Sci., vol. 1592, pp. 327–346, 1999.
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.
B. C. Neuman and T. Tso. Kerberos: An Authentication Service for Computer Networks. IEEE Transactions on Communications, vol. 32, pp. 33–38, 1994.
R. Poovendran, J.S. Baras. An Information Theoretic Approach for Design and Analysis of Rooted-Tree Based Multicast Key Management Schemes. Advances in Cryptology-Crypto’99, Lecture Notes in Comput. Sci., vol. 1666, pp. 624–638, 1999.
A. Shamir. How to Share a Secret. Communications of ACM, vol. 22, n. 11, pp. 612–613, 1979.
G.J. Simmons. How to (really) share a secret. Advances in Cryptology, CRYPTO 88, Lecture Notes in Comput. Sci., 403, 390–448, 1990.
G.J. Simmons, W. Jackson and K. Martin. The geometry of secret sharing schemes. Bull. of the ICA, 1, 71–88, 1991.
D.R. Stinson. An explication of secret sharing schemes. Des. Codes Cryptogr., 2, 357–390, 1992.
D.R. Stinson. Decomposition Constructions for Secret-Sharing Schemes. IEEE Trans. on Information Theory, 40, 118–125, 1994.
D. R. Stinson. On Some Methods for Unconditional Secure Key Distribution and Broadcast Encryption. Designs, Codes and Cryptography, vol. 12, pp. 215–243, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blundo, C., D’Arco, P., Daza, V., Padró, C. (2001). Bounds and Constructions for Unconditionally Secure Distributed Key Distribution Schemes for General Access Structures. In: Davida, G.I., Frankel, Y. (eds) Information Security. ISC 2001. Lecture Notes in Computer Science, vol 2200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45439-X_1
Download citation
DOI: https://doi.org/10.1007/3-540-45439-X_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42662-2
Online ISBN: 978-3-540-45439-7
eBook Packages: Springer Book Archive