Abstract
A Key Distribution Center of a network is a server enabling private communications within groups of users. A Distributed Key Distribution Center is a set of servers that jointly realizes a Key Distribution Center. In this paper we build a robust Distributed Key Distribution Center Scheme secure against active and mobile adversary. We consider a general access structure for the set of servers and for the adversary access structure. We also revise the unconditionally secure Verifiable Secret Sharing Schemes from [11],[10],[19],[22]proposing a modified version which is proactively secure.
The author was partially supported by NATO research fellowship and Concerted Research Action GOA-MEFISTO-666 of the Flemish Government.
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
G.R. Blakley, Safeguarding cryptographic keys, AFIPS Conference Proc. 48, 1979, pp. 313–317.
G.R. Blakley, G.A. Kabatianskii, Linear Algebra Approach to Secret Sharing Schemes, Springer Verlag LNCS 829, 1994, pp. 33–40.
C. Blundo, P. D’Arco, V. Daza, C. Padro, Bounds and Constructions for Unconditionally Secure Distributed Key Distribution Schemes for General Access Structures, Proc. of the Information Security Conference (ISC 2001), LNCS 2200, 2001, pp. 1–17.
C. Blundo, P. D’Arco, C. Padro, A ramp model for distributed key distribution schemes WCC 2001, pp. 92–102.
E. F. Brickell, Some ideal secret sharing schemes, J. of Comb. Math. and Comb. Computing 9, 1989, pp. 105–113.
B. Chor, S. Goldwasser, S. Micali, B. Awerbuch, Verifiable secret sharing and achieving simultaneity in the presence of faults, Proc. of the IEEE 26th Annual Symp. on Foundations of Computer Science 1985, pp. 383–395.
R. Cramer, Introduction to Secure Computation. In Lectures on Data Security-Modern Cryptology in Theory and Practice, LNCS 1561, 1999, pp. 16–62.
P. D’Arco, On the Distribution of a Key Distribution Center, Proc. of ICTCS 2001, LNCS 2202, 2001, pp. 357–369.
V. Daza, J. Herranz, C. Padro, G. Saez, A distributed and computationally secure key distribution scheme, Cryptology ePrint Archive, Report 2002/069.
P. D’Arco, D. Stinson, On Unconditionally Secure Proactive Secret Sharing Scheme and Distributed Key Distribution Centers, unpublished manuscript, May 2002.
P. D’Arco, D. Stinson, On Unconditionally Secure Robust Distributed Key Distribution Centers, to appear in ASIACRYPT 2002.
M. van Dijk, ALinear Construction of Secret Sharing Schemes, DCC 12, 1997, pp. 161–201.
S. Fehr, U. Maurer, Linear VSS and Distributed Commitments Based on Secret Sharing and Pirwise Checks, Proc. CRYPTO 2002, Springer Verlag LNCS 2442, pp. 565–580.
R. Gennaro, Y. Ishai, E. Kushlevitz, T. Rabin, The round complexity of Verifiable Secret Sharing and Secure Multicasting, Proc. STOC 2001.
A. Herzberg, S. Jarecki, H. Krawczyk, M. Yung, Proactive secret sharing or: How to cope with perpetual leakage, Proc. CRYPTO 1995, Springer Verlag LNCS 963, pp. 339–352.
M. Hirt, U. Maurer, Player Simulation and General Adversary Structures in Perfect Multiparty Computation, J. of Cryptology 13, 2000, pp. 31–60.
M. Karchmer, A. Wigderson, On Span Programs, Proc. of 8-th Annual Structure in Complexity Theory Conference, San Diego, California, 18–21 May 1993. IEEE Computer Society Press, pp. 102–111.
M. Naor, B. Pinkas and O. Reingold, Distributed Pseudo-random Functions and KDCs, EuroCrypt’99, LNCS 1592, 1999, pp. 327–346.
V. Nikov, S. Nikova, B. Preneel, 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, Universite Catolique de Lovain (UCL), Lovain-la-Neuve, Belgium, pp. 197–206, Cryptology ePrint Archive: Report 2002/141.
R. Ostrovsky, M. Yung, How to withstand mobile virus attack, ACM Symposium on principles of distributed computing, 1991, pp. 51–59. 423, 428
T. Rabin, M. Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority, Proc. of the 21st Annual ACM Symp. on Theory of Computing 1989, pp. 73–85.
D. R. Stinson, R. Wei, Unconditionally Secure Proactive Secret Sharing Scheme with combinatorial Structures, SAC’99, Springer Verlag LNCS 1758, pp. 200–214.
A. Shamir, How to share a secret, Communications of the ACM 22, 1979, pp. 612–613.
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
Nikov, V., Nikova, S., Preneel, B., Vandewalle, J. (2002). On Distributed Key Distribution Centers and Unconditionally Secure Proactive Verifiable Secret Sharing Schemes Based on General Access Structure. In: Menezes, A., Sarkar, P. (eds) Progress in Cryptology — INDOCRYPT 2002. INDOCRYPT 2002. Lecture Notes in Computer Science, vol 2551. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36231-2_33
Download citation
DOI: https://doi.org/10.1007/3-540-36231-2_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00263-5
Online ISBN: 978-3-540-36231-9
eBook Packages: Springer Book Archive