A ramp model for distributed key distribution schemes

A key distribution center (KDC) of a network is a server enabling private communications within groups of users. The center provides the secret keys for encrypting and decrypting the messages. A distributed key distribution center (DKDC) is a set of servers that jointly realizes a KDC. In this paper...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Discrete Applied Mathematics Ročník 128; číslo 1; s. 47 - 64
Hlavní autori: Blundo, Carlo, D'Arco, Paolo, Padró, Carles
Médium: Journal Article Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: Lausanne Elsevier B.V 15.05.2003
Amsterdam Elsevier
New York, NY
Predmet:
Algebra
Applied sciences
Cryptography
Distributed systems
Exact sciences and technology
Information, signal and communications theory
Key distribution
Mathematics
Number theory
Protocols
Sciences and techniques of general use
Signal and communications theory
Telecommunications and information theory
Distributed systems
Protocols
Key distribution
Lower bound
Network protocols
Ramp model
Randomness
Information storage
Distributed system
Cryptography
Information theory
ISSN:0166-218X, 1872-6771
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:A key distribution center (KDC) of a network is a server enabling private communications within groups of users. The center provides the secret keys for encrypting and decrypting the messages. A distributed key distribution center (DKDC) is a set of servers that jointly realizes a KDC. In this paper we introduce a ramp model for unconditionally secure DKDC. In the ramp approach, the required resources (randomness, information storage, messages to be exchanged, etc.) can be reduced at the cost of a security degradation which depends on the size of the coalition of users who tries to break the scheme. We show lower bounds on the amount of information needed to setup and manage such a DKDC and describe a simple protocol meeting the bounds.
ISSN:0166-218X
1872-6771
DOI:10.1016/S0166-218X(02)00435-3