On the performance of group key agreement protocols

Author:

Amir Yair1,Kim Yongdae2,Nita-Rotaru Cristina3,Tsudik Gene4

Affiliation:

1. Johns Hopkins University, Baltimore, MD

2. University of Minnesota, Twin Cities, MN

3. Purdue University, West Lafayette, IN

4. University of California, Irvine, CA

Abstract

Group key agreement is a fundamental building block for secure peer group communication systems. Several group key management techniques were proposed in the last decade, all assuming the existence of an underlying group communication infrastructure to provide reliable and ordered message delivery as well as group membership information. Despite analysis, implementation, and deployment of some of these techniques, the actual costs associated with group key management have been poorly understood so far. This resulted in an undesirable tendency: on the one hand, adopting suboptimal security for reliable group communication, while, on the other hand, constructing excessively costly group key management protocols.This paper presents a thorough performance evaluation of five notable distributed key management techniques (for collaborative peer groups) integrated with a reliable group communication system. An in-depth comparison and analysis of the five techniques is presented based on experimental results obtained in actual local- and wide-area networks. The extensive performance measurement experiments conducted for all methods offer insights into their scalability and practicality. Furthermore, our analysis of the experimental results highlights several observations that are not obvious from the theoretical analysis.

Publisher

Association for Computing Machinery (ACM)

Subject

Safety, Risk, Reliability and Quality,General Computer Science

Reference52 articles.

1. Amir Y. Danilov C. Miskin-Amir M. Schultz J. and Stanton J. 2004. The Spread Toolkit: Architecture and Performance. Tech. rep. CNDS-2004-1 Johns Hopkins University.]] Amir Y. Danilov C. Miskin-Amir M. Schultz J. and Stanton J. 2004. The Spread Toolkit: Architecture and Performance. Tech. rep. CNDS-2004-1 Johns Hopkins University.]]

2. Secure group communication using robust contributory key agreement

Cited by 44 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. An Experience Report on the Suitability of a Distributed Group Encryption Scheme for an IoT Use Case;2022 IEEE 95th Vehicular Technology Conference: (VTC2022-Spring);2022-06

2. Secure lightweight multi‐party key agreement based on hyperelliptic curve Diffie–Hellman for constraint networks;Concurrency and Computation: Practice and Experience;2022-03-12

3. Towards a Group Encryption Scheme Benchmark: A View on Centralized Schemes with Focus on IoT;Proceedings of the ACM/SPEC International Conference on Performance Engineering;2021-04-09

4. Tree and elliptic curve based efficient and secure group key agreement protocol;Journal of Information Security and Applications;2020-12

5. Research on Self-Adaptive Group Key Management in Deep Space Networks;Wireless Personal Communications;2020-06-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3