On unconditionally secure robust distributed key distribution centers

22Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A Key Distribution Center enables secure communications among groups of users in a network by providing common keys that can be used witha symmetric encryption algorithm to encrypt and decrypt messages the users wishto send to eachoth er. 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. Sucha 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 withth e proactive version of that scheme, and present a modified version which is proactively.

Cite

CITATION STYLE

APA

D’Arco, P., & Stinson, D. R. (2002). On unconditionally secure robust distributed key distribution centers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2501, pp. 346–363). Springer Verlag. https://doi.org/10.1007/3-540-36178-2_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free