EHBT: An Efficient Protocol for Group Key Management View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2001-10-19

AUTHORS

Sandro Rafaeli , Laurent Mathy , David Hutchison

ABSTRACT

Several protocols have been proposed to deal with the group key management problem. The most promising are those based on hierarchical binary trees. A hierarchical binary tree of keys reduces the size of the rekey messages, reducing also the storage and processing requirements. In this paper, we describe a new efficient hierarchical binary tree (EHBT) protocol. Using EHBT, a group manager can use keys already in the tree to derive new keys. Using previously known keys saves information to be transmitted to members when a membership change occurs and newkeys have to be created or updated. EHBT can achieve (I.log2n) message size (I is the size of a key index)for join operations and (K.log2n) message size (K is the size of a key)for leave operations. We also show that the EHBT protocol does not increase the storage and processing requirements when compared to other HBT schemes. More... »

PAGES

159-171

Book

TITLE

Networked Group Communication

ISBN

978-3-540-42824-4
978-3-540-45546-2

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-45546-9_12

DOI

http://dx.doi.org/10.1007/3-540-45546-9_12

DIMENSIONS

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


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/07", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Agricultural and Veterinary Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0705", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Forestry Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Computing Department, Lancaste University, LA1 4YR, Lancaste, UK", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Computing Department, Lancaste University, LA1 4YR, Lancaste, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Rafaeli", 
        "givenName": "Sandro", 
        "id": "sg:person.010310347175.64", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010310347175.64"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Computing Department, Lancaste University, LA1 4YR, Lancaste, UK", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Computing Department, Lancaste University, LA1 4YR, Lancaste, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Mathy", 
        "givenName": "Laurent", 
        "id": "sg:person.07521073620.46", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07521073620.46"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Computing Department, Lancaste University, LA1 4YR, Lancaste, UK", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Computing Department, Lancaste University, LA1 4YR, Lancaste, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Hutchison", 
        "givenName": "David", 
        "id": "sg:person.012636622347.55", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012636622347.55"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2001-10-19", 
    "datePublishedReg": "2001-10-19", 
    "description": "Several protocols have been proposed to deal with the group key management problem. The most promising are those based on hierarchical binary trees. A hierarchical binary tree of keys reduces the size of the rekey messages, reducing also the storage and processing requirements. In this paper, we describe a new efficient hierarchical binary tree (EHBT) protocol. Using EHBT, a group manager can use keys already in the tree to derive new keys. Using previously known keys saves information to be transmitted to members when a membership change occurs and newkeys have to be created or updated. EHBT can achieve (I.log2n) message size (I is the size of a key index)for join operations and (K.log2n) message size (K is the size of a key)for leave operations. We also show that the EHBT protocol does not increase the storage and processing requirements when compared to other HBT schemes.", 
    "editor": [
      {
        "familyName": "Crowcroft", 
        "givenName": "Jon", 
        "type": "Person"
      }, 
      {
        "familyName": "Hofmann", 
        "givenName": "Markus", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-45546-9_12", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-42824-4", 
        "978-3-540-45546-2"
      ], 
      "name": "Networked Group Communication", 
      "type": "Book"
    }, 
    "keywords": [
      "message size", 
      "group key management problem", 
      "processing requirements", 
      "key management problem", 
      "group key management", 
      "binary tree", 
      "rekey messages", 
      "key management", 
      "hierarchical binary tree", 
      "leave operation", 
      "membership changes", 
      "Tree Protocol", 
      "group manager", 
      "management problems", 
      "new key", 
      "efficient protocol", 
      "key", 
      "protocol", 
      "requirements", 
      "binary tree protocol", 
      "trees", 
      "messages", 
      "operation", 
      "storage", 
      "scheme", 
      "information", 
      "managers", 
      "management", 
      "size", 
      "members", 
      "changes", 
      "problem", 
      "paper"
    ], 
    "name": "EHBT: An Efficient Protocol for Group Key Management", 
    "pagination": "159-171", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1035273632"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-45546-9_12"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-45546-9_12", 
      "https://app.dimensions.ai/details/publication/pub.1035273632"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:41", 
    "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_0.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-45546-9_12"
  }
]
 

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/3-540-45546-9_12'

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/3-540-45546-9_12'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-45546-9_12'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-45546-9_12'


 

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

112 TRIPLES      23 PREDICATES      58 URIs      51 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-45546-9_12 schema:about anzsrc-for:07
2 anzsrc-for:0705
3 schema:author N2181545e69cd4c9aa600fe34dbbabffb
4 schema:datePublished 2001-10-19
5 schema:datePublishedReg 2001-10-19
6 schema:description Several protocols have been proposed to deal with the group key management problem. The most promising are those based on hierarchical binary trees. A hierarchical binary tree of keys reduces the size of the rekey messages, reducing also the storage and processing requirements. In this paper, we describe a new efficient hierarchical binary tree (EHBT) protocol. Using EHBT, a group manager can use keys already in the tree to derive new keys. Using previously known keys saves information to be transmitted to members when a membership change occurs and newkeys have to be created or updated. EHBT can achieve (I.log2n) message size (I is the size of a key index)for join operations and (K.log2n) message size (K is the size of a key)for leave operations. We also show that the EHBT protocol does not increase the storage and processing requirements when compared to other HBT schemes.
7 schema:editor Nb9c84c7713084dd7b3994e334089c62b
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf Nd6a45c6ed9554b1fbb721ced7f275c1e
12 schema:keywords Tree Protocol
13 binary tree
14 binary tree protocol
15 changes
16 efficient protocol
17 group key management
18 group key management problem
19 group manager
20 hierarchical binary tree
21 information
22 key
23 key management
24 key management problem
25 leave operation
26 management
27 management problems
28 managers
29 members
30 membership changes
31 message size
32 messages
33 new key
34 operation
35 paper
36 problem
37 processing requirements
38 protocol
39 rekey messages
40 requirements
41 scheme
42 size
43 storage
44 trees
45 schema:name EHBT: An Efficient Protocol for Group Key Management
46 schema:pagination 159-171
47 schema:productId N2be23fda7c7c4641887bfd4bcfd2dca5
48 N4465a03de1ba4dc5951550afc7d134bd
49 schema:publisher Nd21e0d5dd28c42df9263f7ca5ca2f9de
50 schema:sameAs https://app.dimensions.ai/details/publication/pub.1035273632
51 https://doi.org/10.1007/3-540-45546-9_12
52 schema:sdDatePublished 2022-05-20T07:41
53 schema:sdLicense https://scigraph.springernature.com/explorer/license/
54 schema:sdPublisher Ncacf38d9efbb45e3b24f68a55bd5a0a2
55 schema:url https://doi.org/10.1007/3-540-45546-9_12
56 sgo:license sg:explorer/license/
57 sgo:sdDataset chapters
58 rdf:type schema:Chapter
59 N2181545e69cd4c9aa600fe34dbbabffb rdf:first sg:person.010310347175.64
60 rdf:rest N7d8a4a99e6554061b7f432a27dc90686
61 N2be23fda7c7c4641887bfd4bcfd2dca5 schema:name dimensions_id
62 schema:value pub.1035273632
63 rdf:type schema:PropertyValue
64 N324758dcc1fb4f8d802380513b8f5259 schema:familyName Crowcroft
65 schema:givenName Jon
66 rdf:type schema:Person
67 N32e9f698400c4c16ba65d8e7feb06afc rdf:first Nc0f47a78176c433497ca5f90d6dfb3d4
68 rdf:rest rdf:nil
69 N4465a03de1ba4dc5951550afc7d134bd schema:name doi
70 schema:value 10.1007/3-540-45546-9_12
71 rdf:type schema:PropertyValue
72 N7d8a4a99e6554061b7f432a27dc90686 rdf:first sg:person.07521073620.46
73 rdf:rest Ncc07bc11baa64f93be9e43c764e2d692
74 Nb9c84c7713084dd7b3994e334089c62b rdf:first N324758dcc1fb4f8d802380513b8f5259
75 rdf:rest N32e9f698400c4c16ba65d8e7feb06afc
76 Nc0f47a78176c433497ca5f90d6dfb3d4 schema:familyName Hofmann
77 schema:givenName Markus
78 rdf:type schema:Person
79 Ncacf38d9efbb45e3b24f68a55bd5a0a2 schema:name Springer Nature - SN SciGraph project
80 rdf:type schema:Organization
81 Ncc07bc11baa64f93be9e43c764e2d692 rdf:first sg:person.012636622347.55
82 rdf:rest rdf:nil
83 Nd21e0d5dd28c42df9263f7ca5ca2f9de schema:name Springer Nature
84 rdf:type schema:Organisation
85 Nd6a45c6ed9554b1fbb721ced7f275c1e schema:isbn 978-3-540-42824-4
86 978-3-540-45546-2
87 schema:name Networked Group Communication
88 rdf:type schema:Book
89 anzsrc-for:07 schema:inDefinedTermSet anzsrc-for:
90 schema:name Agricultural and Veterinary Sciences
91 rdf:type schema:DefinedTerm
92 anzsrc-for:0705 schema:inDefinedTermSet anzsrc-for:
93 schema:name Forestry Sciences
94 rdf:type schema:DefinedTerm
95 sg:person.010310347175.64 schema:affiliation grid-institutes:None
96 schema:familyName Rafaeli
97 schema:givenName Sandro
98 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010310347175.64
99 rdf:type schema:Person
100 sg:person.012636622347.55 schema:affiliation grid-institutes:None
101 schema:familyName Hutchison
102 schema:givenName David
103 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012636622347.55
104 rdf:type schema:Person
105 sg:person.07521073620.46 schema:affiliation grid-institutes:None
106 schema:familyName Mathy
107 schema:givenName Laurent
108 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07521073620.46
109 rdf:type schema:Person
110 grid-institutes:None schema:alternateName Computing Department, Lancaste University, LA1 4YR, Lancaste, UK
111 schema:name Computing Department, Lancaste University, LA1 4YR, Lancaste, UK
112 rdf:type schema:Organization
 




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


...