Strongly-Resilient and Non-interactive Hierarchical Key-Agreement in MANETs View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2008

AUTHORS

Rosario Gennaro , Shai Halevi , Hugo Krawczyk , Tal Rabin , Steffen Reidt , Stephen D. Wolthusen

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. More... »

PAGES

49-65

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-540-88313-5_4

DOI

http://dx.doi.org/10.1007/978-3-540-88313-5_4

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1007597070


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0804", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Data Format", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "T.J. Watson Research Center, IBM, NY 10532, Hawthorne, USA", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "T.J. Watson Research Center, IBM, NY 10532, Hawthorne, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Gennaro", 
        "givenName": "Rosario", 
        "id": "sg:person.013573255563.35", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013573255563.35"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "T.J. Watson Research Center, IBM, NY 10532, Hawthorne, USA", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "T.J. Watson Research Center, IBM, NY 10532, Hawthorne, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Halevi", 
        "givenName": "Shai", 
        "id": "sg:person.015100320721.93", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015100320721.93"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "T.J. Watson Research Center, IBM, NY 10532, Hawthorne, USA", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "T.J. Watson Research Center, IBM, NY 10532, Hawthorne, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Krawczyk", 
        "givenName": "Hugo", 
        "id": "sg:person.013004021661.30", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013004021661.30"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "T.J. Watson Research Center, IBM, NY 10532, Hawthorne, USA", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "T.J. Watson Research Center, IBM, NY 10532, Hawthorne, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Rabin", 
        "givenName": "Tal", 
        "id": "sg:person.015473523512.58", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015473523512.58"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Royal Holloway, Department of Mathematics, Royal Holloway, University of London, United Kingdom", 
          "id": "http://www.grid.ac/institutes/grid.4970.a", 
          "name": [
            "Royal Holloway, Department of Mathematics, Royal Holloway, University of London, United Kingdom"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Reidt", 
        "givenName": "Steffen", 
        "id": "sg:person.013474772247.84", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013474772247.84"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Royal Holloway, Department of Mathematics, Royal Holloway, University of London, United Kingdom", 
          "id": "http://www.grid.ac/institutes/grid.4970.a", 
          "name": [
            "Royal Holloway, Department of Mathematics, Royal Holloway, University of London, United Kingdom"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Wolthusen", 
        "givenName": "Stephen D.", 
        "id": "sg:person.014146415751.52", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014146415751.52"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2008", 
    "datePublishedReg": "2008-01-01", 
    "description": "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.", 
    "editor": [
      {
        "familyName": "Jajodia", 
        "givenName": "Sushil", 
        "type": "Person"
      }, 
      {
        "familyName": "Lopez", 
        "givenName": "Javier", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-540-88313-5_4", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-88312-8", 
        "978-3-540-88313-5"
      ], 
      "name": "Computer Security - ESORICS 2008", 
      "type": "Book"
    }, 
    "keywords": [
      "secret key", 
      "key agreement", 
      "key agreement scheme", 
      "mobile network environment", 
      "own secret key", 
      "security functionality", 
      "pair of nodes", 
      "pairwise communication", 
      "network environment", 
      "tactical networks", 
      "intermediate nodes", 
      "energy constraints", 
      "implementation aspects", 
      "significant bandwidth", 
      "nodes", 
      "prior knowledge", 
      "MANET", 
      "scheme", 
      "key", 
      "threshold number", 
      "hierarchy", 
      "environment", 
      "network", 
      "rigorous analysis", 
      "upper level", 
      "functionality", 
      "communication", 
      "work", 
      "bandwidth", 
      "constraints", 
      "number", 
      "compromise", 
      "knowledge", 
      "limitations", 
      "properties", 
      "aspects", 
      "pairs", 
      "characteristics", 
      "literature", 
      "analysis", 
      "identity", 
      "levels", 
      "agreement", 
      "leaves", 
      "number of leaves", 
      "children", 
      "such children"
    ], 
    "name": "Strongly-Resilient and Non-interactive Hierarchical Key-Agreement in MANETs", 
    "pagination": "49-65", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1007597070"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-540-88313-5_4"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-540-88313-5_4", 
      "https://app.dimensions.ai/details/publication/pub.1007597070"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:45", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/chapter/chapter_288.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-540-88313-5_4"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-88313-5_4'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-88313-5_4'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-88313-5_4'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-88313-5_4'


 

This table displays all metadata directly associated to this object as RDF triples.

150 TRIPLES      23 PREDICATES      73 URIs      66 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-540-88313-5_4 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N159edb4850974a6093922bcb333b307d
4 schema:datePublished 2008
5 schema:datePublishedReg 2008-01-01
6 schema:description 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.
7 schema:editor Ne770ded2aa5c4b1ca3650fa86a8e098d
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf Na89cb17319dd465080fa011dc2cc3cc8
12 schema:keywords MANET
13 agreement
14 analysis
15 aspects
16 bandwidth
17 characteristics
18 children
19 communication
20 compromise
21 constraints
22 energy constraints
23 environment
24 functionality
25 hierarchy
26 identity
27 implementation aspects
28 intermediate nodes
29 key
30 key agreement
31 key agreement scheme
32 knowledge
33 leaves
34 levels
35 limitations
36 literature
37 mobile network environment
38 network
39 network environment
40 nodes
41 number
42 number of leaves
43 own secret key
44 pair of nodes
45 pairs
46 pairwise communication
47 prior knowledge
48 properties
49 rigorous analysis
50 scheme
51 secret key
52 security functionality
53 significant bandwidth
54 such children
55 tactical networks
56 threshold number
57 upper level
58 work
59 schema:name Strongly-Resilient and Non-interactive Hierarchical Key-Agreement in MANETs
60 schema:pagination 49-65
61 schema:productId N396b76f72afb4dc4bcb23b6c04269b77
62 N4fbb390a6beb4b99b2f1a34028883117
63 schema:publisher Nc275bf621ed943278b9a57447d4d5807
64 schema:sameAs https://app.dimensions.ai/details/publication/pub.1007597070
65 https://doi.org/10.1007/978-3-540-88313-5_4
66 schema:sdDatePublished 2022-05-20T07:45
67 schema:sdLicense https://scigraph.springernature.com/explorer/license/
68 schema:sdPublisher Nde4507d3dde5433fa67e00ece4fd608e
69 schema:url https://doi.org/10.1007/978-3-540-88313-5_4
70 sgo:license sg:explorer/license/
71 sgo:sdDataset chapters
72 rdf:type schema:Chapter
73 N10cf7b4cea98467c8d2838f6eb38f4a9 rdf:first sg:person.013004021661.30
74 rdf:rest Nfb6b5f1255a84096910d754f5224cf32
75 N151958d73a9e438aa288f733d364e0a2 rdf:first sg:person.014146415751.52
76 rdf:rest rdf:nil
77 N159edb4850974a6093922bcb333b307d rdf:first sg:person.013573255563.35
78 rdf:rest N58748a0eb0d9460587189994942ac5cf
79 N2686c8bc40d949b2972f88f7346fae50 schema:familyName Lopez
80 schema:givenName Javier
81 rdf:type schema:Person
82 N396b76f72afb4dc4bcb23b6c04269b77 schema:name dimensions_id
83 schema:value pub.1007597070
84 rdf:type schema:PropertyValue
85 N3ca97f83412b4c7ea452323a437e2b86 rdf:first N2686c8bc40d949b2972f88f7346fae50
86 rdf:rest rdf:nil
87 N4fbb390a6beb4b99b2f1a34028883117 schema:name doi
88 schema:value 10.1007/978-3-540-88313-5_4
89 rdf:type schema:PropertyValue
90 N58748a0eb0d9460587189994942ac5cf rdf:first sg:person.015100320721.93
91 rdf:rest N10cf7b4cea98467c8d2838f6eb38f4a9
92 N683e56cb1d14424984ba9351d54e188b rdf:first sg:person.013474772247.84
93 rdf:rest N151958d73a9e438aa288f733d364e0a2
94 Na89cb17319dd465080fa011dc2cc3cc8 schema:isbn 978-3-540-88312-8
95 978-3-540-88313-5
96 schema:name Computer Security - ESORICS 2008
97 rdf:type schema:Book
98 Na93e755faf3643ffb6d6d38fc6671496 schema:familyName Jajodia
99 schema:givenName Sushil
100 rdf:type schema:Person
101 Nc275bf621ed943278b9a57447d4d5807 schema:name Springer Nature
102 rdf:type schema:Organisation
103 Nde4507d3dde5433fa67e00ece4fd608e schema:name Springer Nature - SN SciGraph project
104 rdf:type schema:Organization
105 Ne770ded2aa5c4b1ca3650fa86a8e098d rdf:first Na93e755faf3643ffb6d6d38fc6671496
106 rdf:rest N3ca97f83412b4c7ea452323a437e2b86
107 Nfb6b5f1255a84096910d754f5224cf32 rdf:first sg:person.015473523512.58
108 rdf:rest N683e56cb1d14424984ba9351d54e188b
109 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
110 schema:name Information and Computing Sciences
111 rdf:type schema:DefinedTerm
112 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
113 schema:name Data Format
114 rdf:type schema:DefinedTerm
115 sg:person.013004021661.30 schema:affiliation grid-institutes:grid.481554.9
116 schema:familyName Krawczyk
117 schema:givenName Hugo
118 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013004021661.30
119 rdf:type schema:Person
120 sg:person.013474772247.84 schema:affiliation grid-institutes:grid.4970.a
121 schema:familyName Reidt
122 schema:givenName Steffen
123 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013474772247.84
124 rdf:type schema:Person
125 sg:person.013573255563.35 schema:affiliation grid-institutes:grid.481554.9
126 schema:familyName Gennaro
127 schema:givenName Rosario
128 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013573255563.35
129 rdf:type schema:Person
130 sg:person.014146415751.52 schema:affiliation grid-institutes:grid.4970.a
131 schema:familyName Wolthusen
132 schema:givenName Stephen D.
133 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014146415751.52
134 rdf:type schema:Person
135 sg:person.015100320721.93 schema:affiliation grid-institutes:grid.481554.9
136 schema:familyName Halevi
137 schema:givenName Shai
138 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015100320721.93
139 rdf:type schema:Person
140 sg:person.015473523512.58 schema:affiliation grid-institutes:grid.481554.9
141 schema:familyName Rabin
142 schema:givenName Tal
143 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015473523512.58
144 rdf:type schema:Person
145 grid-institutes:grid.481554.9 schema:alternateName T.J. Watson Research Center, IBM, NY 10532, Hawthorne, USA
146 schema:name T.J. Watson Research Center, IBM, NY 10532, Hawthorne, USA
147 rdf:type schema:Organization
148 grid-institutes:grid.4970.a schema:alternateName Royal Holloway, Department of Mathematics, Royal Holloway, University of London, United Kingdom
149 schema:name Royal Holloway, Department of Mathematics, Royal Holloway, University of London, United Kingdom
150 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...