Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0166-218X(02)00435-3 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
protocols,simple protocol,secret key,private communication,ramp model,lower bound,distributed systems,key distribution scheme,ramp approach,required resource,security degradation,key distribution center,key distribution,information storage,distributed system | Key distribution,Information theory,Upper and lower bounds,Cryptography,Computer science,Server,Encryption,Key distribution center,Communications protocol,Distributed computing | Journal |
Volume | Issue | ISSN |
128 | 1 | Discrete Applied Mathematics |
Citations | PageRank | References |
3 | 0.38 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carlo Blundo | 1 | 1901 | 229.50 |
| Paolo D'Arco | 2 | 286 | 23.51 |
| Carles Padró | 3 | 490 | 32.23 |