Paper 2008/332

Efficient Key Distribution Schemes for Large Scale Mobile Computing Applications

Mahalingam Ramkumar

Abstract

In emerging networks consisting of large-scale deployments of mobile devices, efficient security mechanisms are required to facilitate cryptographic authentication. While computation and bandwidth overheads are expensive for mobile devices, the cost of storage resources continue to fall at a rapid rate. We propose a simple novel key predistribution scheme, \textit{key subset and symmetric certificates} (KSSC) which can take good advantage of inexpensive storage resources, and has many compelling advantages over other approaches for facilitating ad hoc establishment of pairwise secrets in mobile computing environments. We argue that a combination of KSSC with a variant of an elegant KDS proposed by Leighton and Micali is an appealing choice for securing large scale deployments of mobile devices.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Published elsewhere. Variant of a paper submitted to IEEE Trans. on Mobile Computing
Keywords
key predistributionprobabilistic schemes
Contact author(s)
ramkumar @ cse msstate edu
History
2008-08-03: received
Short URL
https://ia.cr/2008/332
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2008/332,
      author = {Mahalingam Ramkumar},
      title = {Efficient Key Distribution Schemes for Large Scale  Mobile Computing Applications},
      howpublished = {Cryptology ePrint Archive, Paper 2008/332},
      year = {2008},
      note = {\url{https://eprint.iacr.org/2008/332}},
      url = {https://eprint.iacr.org/2008/332}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.