BIROn - Birkbeck Institutional Research Online

Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs

Paterson, Maura B. and Stinson, D.R. (2015) Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs. Journal of Mathematical Cryptology 9 (4), pp. 215-225. ISSN 1862-2976.

[img]
Preview
Text
179.pdf - Author's Accepted Manuscript

Download (268kB) | Preview

Abstract

We study a method for key predistribution in a network of n users where pairwise keys are computed by hashing users’ IDs along with secret information that has been (pre)distributed to the network users by a trusted entity. A communication graph G can be specified to indicate which pairs of users should be able to compute keys. We determine necessary and sufficient conditions for schemes of this type to be secure. We also consider the problem of minimizing the storage requirements of such a scheme; we are interested in the total storage as well as the maximum storage required by any user. Minimizing the total storage is NP-hard, whereas minimizing the maximum storage required by a user can be computed in polynomial time.

Metadata

Item Type: Article
Keyword(s) / Subject(s): Key predistribution, communication graph
School: Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User: Maura Paterson
Date Deposited: 08 May 2015 08:23
Last Modified: 10 Jun 2025 12:52
URI: https://eprints.bbk.ac.uk/id/eprint/12069

Statistics

6 month trend
0Downloads
6 month trend
0Hits

Additional statistics are available via IRStats2.

Archive Staff Only (login required)

Edit/View Item
Edit/View Item