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. (2014) Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs. Working Paper. Birkbeck, University of London, London, UK.

    [img]
    Preview
    Text
    26717.pdf - Draft Version

    Download (984kB) | 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: Monograph (Working Paper)
    Additional Information: Birkbeck Pure Mathematics Preprint Series #2
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Economics, Mathematics and Statistics
    Research Centre: Applied Macroeconomics, Birkbeck Centre for
    Depositing User: Administrator
    Date Deposited: 22 Mar 2019 13:18
    Last Modified: 28 Jul 2019 16:11
    URI: http://eprints.bbk.ac.uk/id/eprint/26717

    Statistics

    Downloads
    Activity Overview
    42Downloads
    56Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item