**Strongly-Resilient and Non-interactive Hierarchical Key-Agreement in MANETs.** / Gennaro, Rosario; Halevi, Shai; Krawczyk, Hugo ; Rabin, Tal; Reidt, Steffen; Wolthusen, Stephen D.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Published

**Strongly-Resilient and Non-interactive Hierarchical Key-Agreement in MANETs.** / Gennaro, Rosario; Halevi, Shai; Krawczyk, Hugo ; Rabin, Tal; Reidt, Steffen; Wolthusen, Stephen D.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Gennaro, R, Halevi, S, Krawczyk, H, Rabin, T, Reidt, S & Wolthusen, SD 2008, Strongly-Resilient and Non-interactive Hierarchical Key-Agreement in MANETs. in *Computer Security - ESORICS 2008: Proc. 13th European Symposium on Research in Computer Security.* Springer-Verlag, pp. 49-65. https://doi.org/10.1007/978-3-540-88313-5_4

Gennaro, R., Halevi, S., Krawczyk, H., Rabin, T., Reidt, S., & Wolthusen, S. D. (2008). Strongly-Resilient and Non-interactive Hierarchical Key-Agreement in MANETs. In *Computer Security - ESORICS 2008: Proc. 13th European Symposium on Research in Computer Security *(pp. 49-65). Springer-Verlag. https://doi.org/10.1007/978-3-540-88313-5_4

Gennaro R, Halevi S, Krawczyk H, Rabin T, Reidt S, Wolthusen SD. Strongly-Resilient and Non-interactive Hierarchical Key-Agreement in MANETs. In Computer Security - ESORICS 2008: Proc. 13th European Symposium on Research in Computer Security. Springer-Verlag. 2008. p. 49-65 https://doi.org/10.1007/978-3-540-88313-5_4

@inproceedings{34351d9b4ba64493b50db917840c9734,

title = "Strongly-Resilient and Non-interactive Hierarchical Key-Agreement in MANETs",

abstract = "Key agreement is a fundamental security functionality by which pairs of nodes agree on shared keys to be used for protecting their pairwise communications. In this work we study key-agreement schemes that are well-suited for the mobile network environment. Specifically, we describe schemes with the following characteristics:• Non-interactive: any two nodes can compute a unique shared secret key without interaction;• Identity-based: to compute the shared secret key, each node only needs its own secret key and the identity of its peer;• Hierarchical: the scheme is decentralized through a hierarchy where intermediate nodes in the hierarchy can derive the secret keys for each of its children without any limitations or prior knowledge on the number of such children or their identities;• Resilient: the scheme is fully resilient against compromise of any number of leaves in the hierarchy, and of a threshold number of nodes in each of the upper levels of the hierarchy.Several schemes in the literature have three of these four properties, but the schemes in this work are the first to possess all four. This makes them well-suited for environments such as MANETs and tactical networks which are very dynamic, have significant bandwidth and energy constraints, and where many nodes are vulnerable to compromise. We provide rigorous analysis of the proposed schemes and discuss implementations aspects.",

author = "Rosario Gennaro and Shai Halevi and Hugo Krawczyk and Tal Rabin and Steffen Reidt and Wolthusen, {Stephen D.}",

year = "2008",

month = oct,

day = "6",

doi = "10.1007/978-3-540-88313-5_4",

language = "English",

isbn = "978-3-540-88313-5",

pages = "49--65",

booktitle = "Computer Security - ESORICS 2008",

publisher = "Springer-Verlag",

}

TY - GEN

T1 - Strongly-Resilient and Non-interactive Hierarchical Key-Agreement in MANETs

AU - Gennaro, Rosario

AU - Halevi, Shai

AU - Krawczyk, Hugo

AU - Rabin, Tal

AU - Reidt, Steffen

AU - Wolthusen, Stephen D.

PY - 2008/10/6

Y1 - 2008/10/6

N2 - Key agreement is a fundamental security functionality by which pairs of nodes agree on shared keys to be used for protecting their pairwise communications. In this work we study key-agreement schemes that are well-suited for the mobile network environment. Specifically, we describe schemes with the following characteristics:• Non-interactive: any two nodes can compute a unique shared secret key without interaction;• Identity-based: to compute the shared secret key, each node only needs its own secret key and the identity of its peer;• Hierarchical: the scheme is decentralized through a hierarchy where intermediate nodes in the hierarchy can derive the secret keys for each of its children without any limitations or prior knowledge on the number of such children or their identities;• Resilient: the scheme is fully resilient against compromise of any number of leaves in the hierarchy, and of a threshold number of nodes in each of the upper levels of the hierarchy.Several schemes in the literature have three of these four properties, but the schemes in this work are the first to possess all four. This makes them well-suited for environments such as MANETs and tactical networks which are very dynamic, have significant bandwidth and energy constraints, and where many nodes are vulnerable to compromise. We provide rigorous analysis of the proposed schemes and discuss implementations aspects.

AB - Key agreement is a fundamental security functionality by which pairs of nodes agree on shared keys to be used for protecting their pairwise communications. In this work we study key-agreement schemes that are well-suited for the mobile network environment. Specifically, we describe schemes with the following characteristics:• Non-interactive: any two nodes can compute a unique shared secret key without interaction;• Identity-based: to compute the shared secret key, each node only needs its own secret key and the identity of its peer;• Hierarchical: the scheme is decentralized through a hierarchy where intermediate nodes in the hierarchy can derive the secret keys for each of its children without any limitations or prior knowledge on the number of such children or their identities;• Resilient: the scheme is fully resilient against compromise of any number of leaves in the hierarchy, and of a threshold number of nodes in each of the upper levels of the hierarchy.Several schemes in the literature have three of these four properties, but the schemes in this work are the first to possess all four. This makes them well-suited for environments such as MANETs and tactical networks which are very dynamic, have significant bandwidth and energy constraints, and where many nodes are vulnerable to compromise. We provide rigorous analysis of the proposed schemes and discuss implementations aspects.

U2 - 10.1007/978-3-540-88313-5_4

DO - 10.1007/978-3-540-88313-5_4

M3 - Conference contribution

SN - 978-3-540-88313-5

SP - 49

EP - 65

BT - Computer Security - ESORICS 2008

PB - Springer-Verlag

ER -