Ontology type: schema:Chapter Open Access: True
2008
AUTHORSRosario Gennaro , Shai Halevi , Hugo Krawczyk , Tal Rabin , Steffen Reidt , Stephen D. Wolthusen
ABSTRACTKey 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... »
PAGES49-65
Computer Security - ESORICS 2008
ISBN
978-3-540-88312-8
978-3-540-88313-5
http://scigraph.springernature.com/pub.10.1007/978-3-540-88313-5_4
DOIhttp://dx.doi.org/10.1007/978-3-540-88313-5_4
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1007597070
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
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