Efficient Group Key Agreement Protocol (EGKAP) using Queue Structure
Sunghyuck Hong · Journal of Digital Convergence · 2012
Abstract Group communication on the Internet is exploding in popularity. Video conferencing, Enterprise IM, desktop sharing, and numerous forms of e-commerce are but a few examples of the ways in which the Internet is being used for business. The growing use of group communication has highlighted the need for advances in security. There are several approaches to securing user identities and other information transmitted over the Internet. One of the foundations of secure communication is key management, a building block for encryption, authentication, access control, and authorization. Key Words : key management, key agreement, secure group communication, network security, secure group key * 백석대학교 정보통신학부 조교수논문접수: 2012년 4월 30일, 1차 수정을 거쳐, 심사완료: 2012년 5월 11일 1. Introduction Key management and member authentication processes take place at the beginning of group communication. To establish a secure group, all members are authenticated, then generate and use a common group key (GK) to encrypt and decrypt messages [3]. To achieve a high level of security, the GK should be changed after any member joins or leaves so that former group members have no access to current communications and new members have no access to previous communications [2]. One problem inherent in this process is that the computation of GKs often takes a significant amount of time – even when a group’s size is relatively small. To address this problem, a recent focus in key management is the efficient generation of GKs [1][8][9]. It is this need for efficient key generation that we address.I describe a new approach to GK generation, the Efficient Group Key Agreement Protocol (EGKAP) with using Queue structure. EGKAP provides a queue-based divide and conquer algorithm that is more efficient than the Tree-based Group Diffie-Hellman (TGDH) protocol that is currently the most efficient group key generation protocol [9]. I describe the EGKAP protocol in detail below. Then, to demonstrate how the EGKAP provides an efficient way to determine high-performance members without additional computational overhead, I contrast its’ efficiency with the TGDH protocol in several experimental tasks. Our