Bounds and constructions for key distribution schemes

Yvo Desmedt; Niels Duif; Henk van Tilborg; Huaxiong Wang

doi:10.3934/amc.2009.3.273

Article Contents

2009, Volume 3, Issue 3: 273-293. Doi: 10.3934/amc.2009.3.273

This issue Previous Article A note on negacyclic and cyclic codes of length $p^s$ over a finite field of characteristic $p$ Next Article On the existence of extended perfect binary codes with trivial symmetry group

Bounds and constructions for key distribution schemes

1.
BT Chair of Information Security, Department of Computer Science, University College London, London
2.
Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven
3.
Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University

Received: February 28, 2009

Revised: May 31, 2009

Published: July 2009

Abstract Related Papers Cited by

Abstract

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).
We focus on two approaches. In the first approach, the goal is to minimize the number of keys per participant. An almost complete answer is presented. The second approach is to minimize the total number of keys that are needed in the network. The number of communication paths that are needed to guarantee secure communication becomes a relevant parameter. Our security relies on the random oracle model.

Keywords:

Mathematics Subject Classification: Primary: 94A60; Secondary: 11T71, 14G50.

Citation:

Article Metrics

HTML views() PDF downloads(110) Cited by(0)

Bounds and constructions for key distribution schemes

Abstract

Access History

Article Metrics

Access History

Other Articles By Authors

Catalog

Bounds and constructions for key distribution schemes

Abstract

Access History

SHARE

Article Metrics

Access History

Other Articles By Authors

Catalog

Export File

Citation

Format

Content