research-article

A Comparative Study on the Scalability of Dynamic Group Key Agreement Protocols

Authors:

Orhan Ermiş,

Şerif Bahtiyar,

Emin Anarim,

M. Ufuk ÇağlayanAuthors Info & Claims

ARES '17: Proceedings of the 12th International Conference on Availability, Reliability and Security

Article No.: 62, Pages 1 - 6

https://doi.org/10.1145/3098954.3104048

Published: 29 August 2017 Publication History

Get Access

Abstract

With the pervasive use of communications technologies, security of multiparty communication systems becomes crucial more than ever. However, providing a secure communication in distributed and dynamic networks is a challenging issue. Dynamic group key agreement protocols are one of the best candidates to overcome this issue. In dynamic group key agreement protocols, each participant in a group involves into the key computation. Moreover, dynamic group key agreement protocols provide auxiliary dynamic group operations for updating the group key when the set of participants is updated. In this paper, a comparative study on the scalability of dynamic group key agreement protocols is presented to show the best possible group key agreement protocol for specific-sized networks. Furthermore, we present simulations for scalability analysis of dynamic group key agreement protocols. Finally, we analyze and compare the performance of protocols regarding computational and communications costs.

References

[1]

Joseph A. Akinyele, Christina Garman, Ian Miers, Matthew W. Pagano, Michael Rushanan, Matthew Green, and Aviel D. Rubin. 2013. Charm: a framework for rapidly prototyping cryptosystems. Journal of Cryptographic Engineering 3, 2 (2013), 111--128.

Crossref

Google Scholar

[2]

Dan Boneh and Matthew K. Franklin. 2001. Identity-Based Encryption from the Weil Pairing. In Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology (CRYPTO '01). Springer-Verlag, London, UK, UK, 213--229.

Digital Library

Google Scholar

[3]

Mike Burmester and Yvo Desmedt. 1994. A Secure and Efficient Conference Key Distribution System (Extended Abstract). In Advances in Cryptology -- EURO-CRYPT'94: Workshop on the Theory and Application of Cryptographic Techniques. 275--286.

Google Scholar

[4]

Orhan Ermis, Serif Bahtiyar, Emin Anarim, and M. Ufuk Çaglayan. 2013. An improved fault-tolerant conference-key agreement protocol with forward secrecy. In SIN13: The 6th International Conference on Security of Information and Networks Aksaray Turkey. 306--310.

Digital Library

Google Scholar

[5]

Orhan Ermis, Serif Bahtiyar, Emin Anarim, and M. Ufuk Caglayan. 2015. An improved conference-key agreement protocol for dynamic groups with efficient fault correction. Security and Communication Networks 8 (2015), 1347--1359.

Crossref

Google Scholar

[6]

Mingchu Li, Xiaodong Xu, Cheng Guo, and Xing Tan. 2016. AD-ASGKA authenticated dynamic protocols for asymmetric group key agreement. Security and Communication Networks (2016), 1340--1352.

Digital Library

Google Scholar

[7]

Yuh-Min Tseng. 2007. A communication-efficient and fault-tolerant conference-key agreement protocol with forward secrecy. The Journal of Systems and Software 80 (2007), 1091--1101.

Digital Library

Google Scholar

[8]

Wen-Guey Tzeng. 2000. A Practical and Secure Fault-Tolerant Conference-Key Agreement Protocol. In Public Key Cryptography: Third International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Melbourne, Victoria, Australia.

Digital Library

Google Scholar

[9]

Qianhong Wu, Yi Mu, Willy Susilo, Bo Qin, and Josep Domingo-Ferrer. 2009. Asymmetric Group Key Agreement. In Advances in Cryptology - EUROCRYPT, 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques. 153--170.

Google Scholar

[10]

Lei Zhang, Qianhong Wu, J. Domingo-Ferrer, Bo Qin, and Zheming Dong. 2015. Round-Efficient and Sender-Unrestricted Dynamic Group Key Agreement Protocol for Secure Group Communications. Information Forensics and Security, IEEE Transactions on 10, 11 (2015), 2352--2364.

Google Scholar

Cited By

View all

Cantali GErmis OÇağlayan MErsoy C(2019)Analytical Models for the Scalability of Dynamic Group-key Agreement Protocols and Secure File Sharing SystemsACM Transactions on Privacy and Security10.1145/334299822:4(1-36)Online publication date: 25-Sep-2019
https://dl.acm.org/doi/10.1145/3342998

Index Terms

A Comparative Study on the Scalability of Dynamic Group Key Agreement Protocols
1. Networks
  1. Network performance evaluation
    1. Network simulations
2. Security and privacy
  1. Cryptography
    1. Key management
    2. Public key (asymmetric) techniques
      1. Public key encryption

Recommendations

Constant round group key agreement protocols: A comparative study

The scope of this paper is to review and evaluate all constant round Group Key Agreement (GKA) protocols proposed so far in the literature. We have gathered all GKA protocols that require 1,2,3,4 and 5 rounds and examined their efficiency. In particular,...
Collusive attacks to "circle-type" multi-party quantum key agreement protocols

We find that existing multi-party quantum key agreement (MQKA) protocols designed for fairness of the key are, in fact, unfair. Our analysis shows that these protocols are sensitive to collusive attacks; that is, dishonest participants can collaborate ...
Modeling Key Compromise Impersonation Attacks on Group Key Exchange Protocols
Irvine: Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09

A key exchange protocol allows a set of parties to agree upon a secret session key over a public network. Two-party key exchange (2PKE) protocols have been rigorously analyzed under various models considering different adversarial actions. However, the ...

Comments

Information & Contributors

Information

Published In

ARES '17: Proceedings of the 12th International Conference on Availability, Reliability and Security

August 2017

853 pages

ISBN:9781450352574

DOI:10.1145/3098954

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 August 2017

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

ARES '17

ARES '17: International Conference on Availability, Reliability and Security

August 29 - September 1, 2017

Reggio Calabria, Italy

Acceptance Rates

ARES '17 Paper Acceptance Rate 100 of 191 submissions, 52%;

Overall Acceptance Rate 228 of 451 submissions, 51%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
85
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cantali GErmis OÇağlayan MErsoy C(2019)Analytical Models for the Scalability of Dynamic Group-key Agreement Protocols and Secure File Sharing SystemsACM Transactions on Privacy and Security10.1145/334299822:4(1-36)Online publication date: 25-Sep-2019
https://dl.acm.org/doi/10.1145/3342998

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Constant round group key agreement protocols: A comparative study

Collusive attacks to "circle-type" multi-party quantum key agreement protocols

Modeling Key Compromise Impersonation Attacks on Group Key Exchange Protocols

Comments

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Constant round group key agreement protocols: A comparative study

Collusive attacks to "circle-type" multi-party quantum key agreement protocols

Modeling Key Compromise Impersonation Attacks on Group Key Exchange Protocols

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations