Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Journal of Mathematical Cryptology

Managing Editor: Magliveras, Spyros S. / Steinwandt, Rainer / Trung, Tran

Editorial Board: Blackburn, Simon R. / Blundo, Carlo / Burmester, Mike / Cramer, Ronald / Dawson, Ed / Gilman, Robert / Gonzalez Vasco, Maria Isabel / Grosek, Otokar / Helleseth, Tor / Kim, Kwangjo / Koblitz, Neal / Kurosawa, Kaoru / Lauter, Kristin / Lange, Tanja / Menezes, Alfred / Nguyen, Phong Q. / Pieprzyk, Josef / Rötteler, Martin / Safavi-Naini, Rei / Shparlinski, Igor E. / Stinson, Doug / Takagi, Tsuyoshi / Williams, Hugh C. / Yung, Moti

4 Issues per year


CiteScore 2017: 1.43

SCImago Journal Rank (SJR) 2017: 0.293
Source Normalized Impact per Paper (SNIP) 2017: 1.117

Mathematical Citation Quotient (MCQ) 2017: 0.51

Online
ISSN
1862-2984
See all formats and pricing
More options …
Volume 9, Issue 4

Issues

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

Maura B. Paterson
  • Department of Economics, Mathematics and Statistics, Birkbeck, University of London, Malet Street, London WC1E 7HX, UK
  • Email
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
/ Douglas R. Stinson
Published Online: 2014-10-09 | DOI: https://doi.org/10.1515/jmc-2014-0031

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.

Keywords: Key predistribution; communication graph

MSC: 94A60

About the article

Received: 2014-09-08

Accepted: 2014-09-24

Published Online: 2014-10-09

Published in Print: 2015-12-01


Funding Source: NSERC

Award identifier / Grant number: discovery grant 203114-11


Citation Information: Journal of Mathematical Cryptology, Volume 9, Issue 4, Pages 215–225, ISSN (Online) 1862-2984, ISSN (Print) 1862-2976, DOI: https://doi.org/10.1515/jmc-2014-0031.

Export Citation

© 2015 by De Gruyter.Get Permission

Comments (0)

Please log in or register to comment.
Log in