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", 
      "key management problem", 
      "processing requirements", 
      "group key management", 
      "hierarchical binary tree", 
      "binary tree", 
      "rekey messages", 
      "Tree Protocol", 
      "group manager", 
      "membership changes", 
      "leave operation", 
      "key management", 
      "management problems", 
      "binary tree protocol", 
      "new key", 
      "efficient protocol", 
      "protocol", 
      "key", 
      "requirements", 
      "HBT scheme", 
      "trees", 
      "messages", 
      "storage", 
      "information", 
      "operation", 
      "scheme", 
      "managers", 
      "size", 
      "management", 
      "members", 
      "changes", 
      "problem", 
      "paper", 
      "new efficient hierarchical binary tree (EHBT) protocol", 
      "efficient hierarchical binary tree (EHBT) protocol", 
      "hierarchical binary tree (EHBT) protocol", 
      "EHBT", 
      "newkeys", 
      "EHBT protocol"
    ], 
    "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-01-01T19:11", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/chapter/chapter_182.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.

119 TRIPLES      23 PREDICATES      65 URIs      58 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 Ne33d84ceb21943e0afdfd85c5c1044d1
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 N5e70b7f49bdb42488744c344ef0b8a52
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf Nb6ebafe4a05e463eb6bc82634189c950
12 schema:keywords EHBT
13 EHBT protocol
14 HBT scheme
15 Tree Protocol
16 binary tree
17 binary tree protocol
18 changes
19 efficient hierarchical binary tree (EHBT) protocol
20 efficient protocol
21 group key management
22 group key management problem
23 group manager
24 hierarchical binary tree
25 hierarchical binary tree (EHBT) protocol
26 information
27 key
28 key management
29 key management problem
30 leave operation
31 management
32 management problems
33 managers
34 members
35 membership changes
36 message size
37 messages
38 new efficient hierarchical binary tree (EHBT) protocol
39 new key
40 newkeys
41 operation
42 paper
43 problem
44 processing requirements
45 protocol
46 rekey messages
47 requirements
48 scheme
49 size
50 storage
51 trees
52 schema:name EHBT: An Efficient Protocol for Group Key Management
53 schema:pagination 159-171
54 schema:productId N25b0dc0ec18f4611a98e554cd7b877ea
55 N73d7e44703484c2d9833cfa3e876b977
56 schema:publisher Nffa3dc50f5e04866b617a5f1c1ff0336
57 schema:sameAs https://app.dimensions.ai/details/publication/pub.1035273632
58 https://doi.org/10.1007/3-540-45546-9_12
59 schema:sdDatePublished 2022-01-01T19:11
60 schema:sdLicense https://scigraph.springernature.com/explorer/license/
61 schema:sdPublisher N46c2b0dea029402d8f10bff078c947a3
62 schema:url https://doi.org/10.1007/3-540-45546-9_12
63 sgo:license sg:explorer/license/
64 sgo:sdDataset chapters
65 rdf:type schema:Chapter
66 N127af3f63caf443e90f0f550bef8d0d6 rdf:first Ne5427f694f3c42eeac02357ee5d8324c
67 rdf:rest rdf:nil
68 N25b0dc0ec18f4611a98e554cd7b877ea schema:name doi
69 schema:value 10.1007/3-540-45546-9_12
70 rdf:type schema:PropertyValue
71 N46c2b0dea029402d8f10bff078c947a3 schema:name Springer Nature - SN SciGraph project
72 rdf:type schema:Organization
73 N5e70b7f49bdb42488744c344ef0b8a52 rdf:first Nfe7e719074a34cd38fd9f93b4f5b072c
74 rdf:rest N127af3f63caf443e90f0f550bef8d0d6
75 N73d7e44703484c2d9833cfa3e876b977 schema:name dimensions_id
76 schema:value pub.1035273632
77 rdf:type schema:PropertyValue
78 Na3e59551841e498a9fa09f82d4765f03 rdf:first sg:person.012636622347.55
79 rdf:rest rdf:nil
80 Na4f4358a1fdb4d339bdd8414cb268cee rdf:first sg:person.07521073620.46
81 rdf:rest Na3e59551841e498a9fa09f82d4765f03
82 Nb6ebafe4a05e463eb6bc82634189c950 schema:isbn 978-3-540-42824-4
83 978-3-540-45546-2
84 schema:name Networked Group Communication
85 rdf:type schema:Book
86 Ne33d84ceb21943e0afdfd85c5c1044d1 rdf:first sg:person.010310347175.64
87 rdf:rest Na4f4358a1fdb4d339bdd8414cb268cee
88 Ne5427f694f3c42eeac02357ee5d8324c schema:familyName Hofmann
89 schema:givenName Markus
90 rdf:type schema:Person
91 Nfe7e719074a34cd38fd9f93b4f5b072c schema:familyName Crowcroft
92 schema:givenName Jon
93 rdf:type schema:Person
94 Nffa3dc50f5e04866b617a5f1c1ff0336 schema:name Springer Nature
95 rdf:type schema:Organisation
96 anzsrc-for:07 schema:inDefinedTermSet anzsrc-for:
97 schema:name Agricultural and Veterinary Sciences
98 rdf:type schema:DefinedTerm
99 anzsrc-for:0705 schema:inDefinedTermSet anzsrc-for:
100 schema:name Forestry Sciences
101 rdf:type schema:DefinedTerm
102 sg:person.010310347175.64 schema:affiliation grid-institutes:None
103 schema:familyName Rafaeli
104 schema:givenName Sandro
105 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010310347175.64
106 rdf:type schema:Person
107 sg:person.012636622347.55 schema:affiliation grid-institutes:None
108 schema:familyName Hutchison
109 schema:givenName David
110 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012636622347.55
111 rdf:type schema:Person
112 sg:person.07521073620.46 schema:affiliation grid-institutes:None
113 schema:familyName Mathy
114 schema:givenName Laurent
115 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07521073620.46
116 rdf:type schema:Person
117 grid-institutes:None schema:alternateName Computing Department, Lancaste University, LA1 4YR, Lancaste, UK
118 schema:name Computing Department, Lancaste University, LA1 4YR, Lancaste, UK
119 rdf:type schema:Organization
 




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


...