Abstract
A Key Distribution Center enables secure communications among groups of users in a network by providing common keys that can be used with a symmetric encryption algorithm to encrypt and decrypt messages the users wish to send to each other. A Distributed Key Distribution Center is a set of servers of a network that jointly realize a Key Distribution Center. In this paper we propose an unconditionally secure scheme to set up a robust Distributed Key Distribution Center. Such a distributed center keeps working even if some minority of the servers malfunction or misbehave under the control of a mobile adversary. Our scheme for a distributed key distribution center is constructed using unconditionally secure proactive verifiable secret sharing schemes. We review the unconditionally secure verifiable secret sharing scheme described by Stinson and Wei, discuss a problem with the proactive version of that scheme, and present a modified version which is proactively secure.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Bellare and P. Rogaway, Provably Secure Session Key Distribution: The Three Party Case, Proc. of the 27th Annual Symposium on the Theory of Computing (STOC’ 95), ACM, pp. 57–66, 1995.
C. Blundo, and P. D’Arco, Unconditionally Secure Distributed Key Distribution Schemes, submitted for publication.
C. Blundo and P. D’Arco, The Key Establishment Problem, Lecture Notes in Computer Science, FOSAD 2001 (Tutorial), to appear.
C. Blundo, P. D’Arco, V. Daza and C. Padrò. Bounds and Constructions for Unconditionally Secure Distributed Key Distribution Schemes for General Access Structures, Proc. of the Information Security Conference (ISC 2001), Lecture Notes in Computer Science, vol. 2200, pp. 1–17, 2001.
B. Chor, S. Goldwasser, S. Micali, and B. Awerbach. Verifiable Secret Sharing and Achieving Simultaneity in Presence of Faults, Proc. of the 26-th Annual Symposium on the Foundations of Computer Science, IEEE, pp. 383–395, 1985.
P. D’Arco, On the Distribution of a Key Distribution Center (extended abstract), Proc. of the Italian Conference on Theoretical Computer Science (ICTCS’ 01), Lecture Notes in Computer Science, vol. 2202, pp. 357–369, 2001.
P. D’Arco and D. R. Stinson, On Unconditionally Secure Proactive Verifiable Secret Sharing Schemes and Distributed Key Distribution Centers, unpublished manuscript, May 2002.
R. Gennaro, Y. Ishai, E. Kushilevitz, and T. Rabin, The Round Complexity of Verifiable Secret Sharing and Secure Multicast, Proc. of the 33-rd Annual Symposium on the Theory of Computing (STOC’ 01), ACM, pp. 580–589, 2001.
A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung. Proactive Secret Sharing or: How to Cope with Perpetual Leakage, Advances in Cryptology-Crypto’ 95, Lecture Notes in Computer Science, vol. 963, pp. 339–352, 1995.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correct ing Codes, North-Holland, Amsterdam, 1981.
A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996.
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.
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.
V. Nikov, S. Nikova, B. Preneel and J. Vandewalle. Applying General Access Structure to Proactive Secret Sharing Schemes. Proc. of the 23rd Symposium on Information Theory in the Benelux, May 29-31, 2002, Université Catholique de Louvain (UCL), Louvain-la-Neuve, Belgium.
V. Nikov, S. Nikova, B. Preneel and J. Vandewalle. On Distributed Key Distribution Centers and Unconditionally Secure Proactive Verifiable Secret Sharing Schemes Based on General Access Structures, preprint, August 2002.
R. Ostrovsky and M. Yung, How to Withstand Mobile Virus Attacks, Symposium on Principles of Distributed Computing (PODC’ 91), ACM, pp. 51–59, 1991.
R. S. Rees, D. R. Stinson, R. Wei, and G. H. J. van Rees, An Application of Covering Designs: Determining the Maximum Consistent Set of Shares in a Threshold Scheme, Ars Combinatoria 53, 225–237, 1999.
D.R. Stinson, Cryptography: Theory and Practice, CRC Press, 1995 (2nd Edition, 2002).
D. R. Stinson. On Some Methods for Unconditional Secure Key Distribution and Broadcast Encryption, Designs, Codes and Cryptography, vol. 12, pp. 215–243, 1997.
D. Stinson and R. Wei, Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures, SAC’99. Lecture Notes in Computer Science, vol. 1758, pp. 200–214, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
D’Arco, P., Stinson, D.R. (2002). On Unconditionally Secure Robust Distributed Key Distribution Centers. In: Zheng, Y. (eds) Advances in Cryptology — ASIACRYPT 2002. ASIACRYPT 2002. Lecture Notes in Computer Science, vol 2501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36178-2_22
Download citation
DOI: https://doi.org/10.1007/3-540-36178-2_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00171-3
Online ISBN: 978-3-540-36178-7
eBook Packages: Springer Book Archive