An efficient key predistribution scheme for ad hoc network security

Mahalingam Ramkumar, Nasir Memon

    Research output: Contribution to journalArticle

    Abstract

    We introduce hashed random preloaded subsets (HARPS), a highly scalable key predistribution (KPD) scheme employing only symmetric cryptographic primitives. HARPS is ideally suited for resource constrained nodes that need to operate for extended periods without active involvement of a trusted authority (TA), as is usually the case for nodes forming ad hoc networks (AHNs). HARPS, a probabilistic KPD scheme, is a generalization of two other probabilistic KPDs. The first, random preloaded subsets (RPSs), is based on random intersection of keys preloaded in nodes. The second, proposed by Leighton and Micali (LM) is a scheme employing repeated applications of a cryptographic hash function. We investigate many desired properties of HARPS like scalability, computational and storage efficiency, flexibility in deployment modes, renewability, ease of extension to multicast scenarios, ability to cater for broadcast authentication, broadcast encryption, etc., to support its candidacy as an enabler for ad hoc network security. We analyze and compare the performance of the three schemes and show that HARPS has significant advantages over other KPDs, and in particular, over RPS and LM.

    Original languageEnglish (US)
    Pages (from-to)611-621
    Number of pages11
    JournalIEEE Journal on Selected Areas in Communications
    Volume23
    Issue number3
    DOIs
    StatePublished - Mar 2005

    Fingerprint

    Network security
    Ad hoc networks
    Hash functions
    Authentication
    Cryptography
    Scalability

    Keywords

    • Key distribution
    • Key predistribution
    • Mobile ad hoc network (MANET) security

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Electrical and Electronic Engineering

    Cite this

    An efficient key predistribution scheme for ad hoc network security. / Ramkumar, Mahalingam; Memon, Nasir.

    In: IEEE Journal on Selected Areas in Communications, Vol. 23, No. 3, 03.2005, p. 611-621.

    Research output: Contribution to journalArticle

    Ramkumar, Mahalingam ; Memon, Nasir. / An efficient key predistribution scheme for ad hoc network security. In: IEEE Journal on Selected Areas in Communications. 2005 ; Vol. 23, No. 3. pp. 611-621.
    @article{b34ccf3e87b84deb8d24559f5a708e82,
    title = "An efficient key predistribution scheme for ad hoc network security",
    abstract = "We introduce hashed random preloaded subsets (HARPS), a highly scalable key predistribution (KPD) scheme employing only symmetric cryptographic primitives. HARPS is ideally suited for resource constrained nodes that need to operate for extended periods without active involvement of a trusted authority (TA), as is usually the case for nodes forming ad hoc networks (AHNs). HARPS, a probabilistic KPD scheme, is a generalization of two other probabilistic KPDs. The first, random preloaded subsets (RPSs), is based on random intersection of keys preloaded in nodes. The second, proposed by Leighton and Micali (LM) is a scheme employing repeated applications of a cryptographic hash function. We investigate many desired properties of HARPS like scalability, computational and storage efficiency, flexibility in deployment modes, renewability, ease of extension to multicast scenarios, ability to cater for broadcast authentication, broadcast encryption, etc., to support its candidacy as an enabler for ad hoc network security. We analyze and compare the performance of the three schemes and show that HARPS has significant advantages over other KPDs, and in particular, over RPS and LM.",
    keywords = "Key distribution, Key predistribution, Mobile ad hoc network (MANET) security",
    author = "Mahalingam Ramkumar and Nasir Memon",
    year = "2005",
    month = "3",
    doi = "10.1109/JSAC.2004.842555",
    language = "English (US)",
    volume = "23",
    pages = "611--621",
    journal = "IEEE Journal on Selected Areas in Communications",
    issn = "0733-8716",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "3",

    }

    TY - JOUR

    T1 - An efficient key predistribution scheme for ad hoc network security

    AU - Ramkumar, Mahalingam

    AU - Memon, Nasir

    PY - 2005/3

    Y1 - 2005/3

    N2 - We introduce hashed random preloaded subsets (HARPS), a highly scalable key predistribution (KPD) scheme employing only symmetric cryptographic primitives. HARPS is ideally suited for resource constrained nodes that need to operate for extended periods without active involvement of a trusted authority (TA), as is usually the case for nodes forming ad hoc networks (AHNs). HARPS, a probabilistic KPD scheme, is a generalization of two other probabilistic KPDs. The first, random preloaded subsets (RPSs), is based on random intersection of keys preloaded in nodes. The second, proposed by Leighton and Micali (LM) is a scheme employing repeated applications of a cryptographic hash function. We investigate many desired properties of HARPS like scalability, computational and storage efficiency, flexibility in deployment modes, renewability, ease of extension to multicast scenarios, ability to cater for broadcast authentication, broadcast encryption, etc., to support its candidacy as an enabler for ad hoc network security. We analyze and compare the performance of the three schemes and show that HARPS has significant advantages over other KPDs, and in particular, over RPS and LM.

    AB - We introduce hashed random preloaded subsets (HARPS), a highly scalable key predistribution (KPD) scheme employing only symmetric cryptographic primitives. HARPS is ideally suited for resource constrained nodes that need to operate for extended periods without active involvement of a trusted authority (TA), as is usually the case for nodes forming ad hoc networks (AHNs). HARPS, a probabilistic KPD scheme, is a generalization of two other probabilistic KPDs. The first, random preloaded subsets (RPSs), is based on random intersection of keys preloaded in nodes. The second, proposed by Leighton and Micali (LM) is a scheme employing repeated applications of a cryptographic hash function. We investigate many desired properties of HARPS like scalability, computational and storage efficiency, flexibility in deployment modes, renewability, ease of extension to multicast scenarios, ability to cater for broadcast authentication, broadcast encryption, etc., to support its candidacy as an enabler for ad hoc network security. We analyze and compare the performance of the three schemes and show that HARPS has significant advantages over other KPDs, and in particular, over RPS and LM.

    KW - Key distribution

    KW - Key predistribution

    KW - Mobile ad hoc network (MANET) security

    UR - http://www.scopus.com/inward/record.url?scp=15244360279&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=15244360279&partnerID=8YFLogxK

    U2 - 10.1109/JSAC.2004.842555

    DO - 10.1109/JSAC.2004.842555

    M3 - Article

    VL - 23

    SP - 611

    EP - 621

    JO - IEEE Journal on Selected Areas in Communications

    JF - IEEE Journal on Selected Areas in Communications

    SN - 0733-8716

    IS - 3

    ER -