Invitation-oriented TGDH: Key management for dynamic groups in an asynchronous communication model

István Lám, Szilveszter Szebeni, L. Buttyán

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

In this paper, we propose a suite of group key management protocols that allows a group of users to agree on a shared group key, which can be used to protect a shared file system stored remotely in the cloud. Our protocols support the refreshment of the group key at each group membership modification. Compared to other similar solutions, the key novelty of our protocols is that they require asynchronous communication channels, and only constant number of exponentiations on average, worst case logarithmic number of exponentiations even if membership modifications are controlled by arbitrary user. Moreover, our scheme is fully decentralized, and its design is led by a practical, invitation-oriented approach.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Parallel Processing Workshops
Pages269-276
Number of pages8
DOIs
Publication statusPublished - 2012
Event41st International Conference on Parallel Processing Workshops, ICPPW 2012 - Pittsburgh, PA, United States
Duration: Sep 10 2012Sep 13 2012

Other

Other41st International Conference on Parallel Processing Workshops, ICPPW 2012
CountryUnited States
CityPittsburgh, PA
Period9/10/129/13/12

Fingerprint

Asynchronous Communication
Key Management
Communication
Exponentiation
Model
File System
Communication Channels
Decentralized
Logarithmic
Arbitrary

Keywords

  • dynamic groups
  • group-key agreement
  • self-balancing key-tree

ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Hardware and Architecture

Cite this

Lám, I., Szebeni, S., & Buttyán, L. (2012). Invitation-oriented TGDH: Key management for dynamic groups in an asynchronous communication model. In Proceedings of the International Conference on Parallel Processing Workshops (pp. 269-276). [6337490] https://doi.org/10.1109/ICPPW.2012.40

Invitation-oriented TGDH : Key management for dynamic groups in an asynchronous communication model. / Lám, István; Szebeni, Szilveszter; Buttyán, L.

Proceedings of the International Conference on Parallel Processing Workshops. 2012. p. 269-276 6337490.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lám, I, Szebeni, S & Buttyán, L 2012, Invitation-oriented TGDH: Key management for dynamic groups in an asynchronous communication model. in Proceedings of the International Conference on Parallel Processing Workshops., 6337490, pp. 269-276, 41st International Conference on Parallel Processing Workshops, ICPPW 2012, Pittsburgh, PA, United States, 9/10/12. https://doi.org/10.1109/ICPPW.2012.40
Lám I, Szebeni S, Buttyán L. Invitation-oriented TGDH: Key management for dynamic groups in an asynchronous communication model. In Proceedings of the International Conference on Parallel Processing Workshops. 2012. p. 269-276. 6337490 https://doi.org/10.1109/ICPPW.2012.40
Lám, István ; Szebeni, Szilveszter ; Buttyán, L. / Invitation-oriented TGDH : Key management for dynamic groups in an asynchronous communication model. Proceedings of the International Conference on Parallel Processing Workshops. 2012. pp. 269-276
@inproceedings{ed6e8012eac0490ca898c987412c7697,
title = "Invitation-oriented TGDH: Key management for dynamic groups in an asynchronous communication model",
abstract = "In this paper, we propose a suite of group key management protocols that allows a group of users to agree on a shared group key, which can be used to protect a shared file system stored remotely in the cloud. Our protocols support the refreshment of the group key at each group membership modification. Compared to other similar solutions, the key novelty of our protocols is that they require asynchronous communication channels, and only constant number of exponentiations on average, worst case logarithmic number of exponentiations even if membership modifications are controlled by arbitrary user. Moreover, our scheme is fully decentralized, and its design is led by a practical, invitation-oriented approach.",
keywords = "dynamic groups, group-key agreement, self-balancing key-tree",
author = "Istv{\'a}n L{\'a}m and Szilveszter Szebeni and L. Butty{\'a}n",
year = "2012",
doi = "10.1109/ICPPW.2012.40",
language = "English",
isbn = "9780769547954",
pages = "269--276",
booktitle = "Proceedings of the International Conference on Parallel Processing Workshops",

}

TY - GEN

T1 - Invitation-oriented TGDH

T2 - Key management for dynamic groups in an asynchronous communication model

AU - Lám, István

AU - Szebeni, Szilveszter

AU - Buttyán, L.

PY - 2012

Y1 - 2012

N2 - In this paper, we propose a suite of group key management protocols that allows a group of users to agree on a shared group key, which can be used to protect a shared file system stored remotely in the cloud. Our protocols support the refreshment of the group key at each group membership modification. Compared to other similar solutions, the key novelty of our protocols is that they require asynchronous communication channels, and only constant number of exponentiations on average, worst case logarithmic number of exponentiations even if membership modifications are controlled by arbitrary user. Moreover, our scheme is fully decentralized, and its design is led by a practical, invitation-oriented approach.

AB - In this paper, we propose a suite of group key management protocols that allows a group of users to agree on a shared group key, which can be used to protect a shared file system stored remotely in the cloud. Our protocols support the refreshment of the group key at each group membership modification. Compared to other similar solutions, the key novelty of our protocols is that they require asynchronous communication channels, and only constant number of exponentiations on average, worst case logarithmic number of exponentiations even if membership modifications are controlled by arbitrary user. Moreover, our scheme is fully decentralized, and its design is led by a practical, invitation-oriented approach.

KW - dynamic groups

KW - group-key agreement

KW - self-balancing key-tree

UR - http://www.scopus.com/inward/record.url?scp=84871131905&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84871131905&partnerID=8YFLogxK

U2 - 10.1109/ICPPW.2012.40

DO - 10.1109/ICPPW.2012.40

M3 - Conference contribution

AN - SCOPUS:84871131905

SN - 9780769547954

SP - 269

EP - 276

BT - Proceedings of the International Conference on Parallel Processing Workshops

ER -