Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures

5Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we investigate the issues concerning with theuse 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.

Cite

CITATION STYLE

APA

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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2200, pp. 1–17). Springer Verlag. https://doi.org/10.1007/3-540-45439-x_1

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