Bounds and constructions for key distribution schemes
Yvo Desmedt - BT Chair of Information Security, Department of Computer Science, University College London, London, United Kingdom (email)
Key distribution schemes play a significant role in key assignment schemes which allow participants
in a network to communicate by means of symmetric cryptography in a secure way without the need of a unique key for every pair of participants.
It is assumed that an adversary can eavesdrop on all communication and can corrupt up to $t$ vertices in the network.
It follows that, in general, the sender needs to transmit at least $t+1$ shares of the message over different paths to the intended receiver
and that each participant needs to possess at least $t+1$ encryption keys.
We do assume that vertices in the network will forward messages correctly
(but only the corrupted vertices will collude with the adversary to retrieve the message).
Keywords: Key distribution, secure communication, ad hoc networks, privacy, graph theory, block designs, Steiner systems, combinatorics.
Received: March 2009; Revised: June 2009; Available Online: August 2009.
2015 Impact Factor.631