계층적 키 트리를 사용한 모바일 환경에 효율적인 그룹키 합의 프로토콜
An Efficient Group Key Agreement Using Hierarchical Key Tree in Mobile Environment
0
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
In this paper, the author proposes an efficient group key agreement scheme in a mobile environment where group members frequently join and leave. This protocol consists of basic protocols and general ones and is expected to be suitable for communications between a mobile device with limited computing capability and a key distributing center (or base station) with sufficient computing capability. Compared with other schemes, the performance of the proposed protocol is a bit more efficient in the aspects of the overall cost for both communication and computation where the computational efficiency of the scheme is achieved by using exclusive or operations and a one-way hash function. Also, in the aspect of security, it guarantees both forward and backward secrecy based on the computational Diffie-Hellman (CDH) assumption so that secure group communication can be made possible. Furthermore, the author proves its security against a passive adversary in the random oracle model.
Abstract
In this paper, the author proposes an efficient group key agreement scheme in a mobile environment where group members frequently join and leave. This protocol consists of basic protocols and general ones and is expected to be suitable for communications between a mobile device with limited computing capability and a key distributing center (or base station) with sufficient computing capability. Compared with other schemes, the performance of the proposed protocol is a bit more efficient in the aspects of the overall cost for both communication and computation where the computational efficiency of the scheme is achieved by using exclusive or operations and a one-way hash function. Also, in the aspect of security, it guarantees both forward and backward secrecy based on the computational Diffie-Hellman (CDH) assumption so that secure group communication can be made possible. Furthermore, the author proves its security against a passive adversary in the random oracle model.
참고문헌 (18)
- B. Bhargava, "Digital Library Services in Mobile Computing", ACM SIGMOD Record, 24(4), pp.34~39 (1995)
- Y. Huang., "Publish", Subscribe in a Mobile Environment, 2001, 27~34
- T. Phan, "Challenge: Integrating Mobile Wireless Devices into the Computational Grid", Proc. of the 8th ACM Conference on Mobile Computing and Networking(MOBICOM 2002), pp.271~278 (2002)
- Sung-Hwa Lim, "Real-time broadcast algorithm for mobile computing", Journal of Systems and Software, 69(1-2), pp.173~181 (2004), Elsevier BV[DOI]
- W. Diffie, "New Directions in Cryptography", IEEE Transactions on Information Theory, IT-22(6), pp.644~654 (1976)
- Y. Kim, "Group key agreement efficient in communication", IEEE Transactions on Computers, 53(7), pp.905~921 (2004), Institute of Electrical and Electronics Engineers (IEEE)[DOI]
- Sangwon Lee, "An Efficient Tree-Based Group Key Agreement Using Bilinear Map", ACNS 2003, pp.357~371 (2003)
- Sandro Rafaeli, "EHBT: An Efficient Protocol for Group Key Management", NGC(Networked Group Communication) 2001, pp.159~171 (2001)
- Lijun Liao, "Tree-based group key agreement framework for mobile ad-hoc networks", Future Generation Computer Systems, 23(6), pp.787~803 (2007)[DOI]
- 이상원, "Pairing을 이용한 트리 기반 그룹키 합의 프로토콜", 정보보호학회논문지, 13(3), pp.101~110 (2003), 한국정보보호학회
- Abhimanyu Kumar, "Ternary Tree Based Group Key Agreement Protocol Over Elliptic Curve for Dynamic Group", International Journal of Computer Applications(0975-888), 86(7), pp.17~25 (2014)
- Yvo Desmedt, "Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups", FC 2007 and USEC 2007, pp.104~118 (2007)
- Junghyun Nam, "Infringing Key Authentication of an ID-Based Group Key Exchange Protocol Using Binary Key Trees", KES 2007, 2007, 672~679
- Minghui Zheng, "Scalable Group Key Management Protocol Based on Key Material Transmitting Tree", ISPEC 2007, pp.301~313 (2007)
- K. Becker, "Communication Complexity of Group Key Distribution", Proc. of the 5th ACM Conference on Computer and Communication Security(CCS 1998), pp.1~6 (1998)
- P.S.L.M. Barreto, "Efficient Algorithms for Pairing-Based Cryptosystems", Advances in Cryptology-Crypto 2002, pp.354~368 (2002)
- Alfred J. Menezes, "Handbook of Applied Cryptography", pp.113~ (1997), CRC Press
- M. Bellare, "Random Oracles are Practical: A Paradigm for Designing Efficient Protocols", Proc. of the 1st ACM Conference on Computer and Communication Security(CCS 1993), pp.62~73 (1993)