• 한국통신학회논문지
• /
• 제28권7C호
• /
• pp.733-742
• /
• 2003

유니캐스트와는 달리 멀티캐스트 환경에는 상당히 많은 전송 링크가 존재하기 때문에 그 만큼 보안을 위협하는 요소들이 많이 존재한다. 따라서 안전한 멀티캐스트 통신을 위해서는 멀티캐스트 트래픽을 보호하는 메커니즘이 필수적이고 이러한 메커니즘의 핵심적인 요소 기술은 그룹키를 효율적으로 그룹 구성원들에게 분배하는 것이다. 멀티캐스트 환경에서 보안성을 제공하기 위해 최근가지 진행되어 오고 있는 연구들은 대부분 그룹키 분배에 관련된 것들이다. 본 논문에서는 멀티캐스트 환경에서 키 서버의 트래픽 집중을 효율적으로 분산시킬 수 있는 그룹키 관리 구조를 제안하였다. 제안한 프로토콜은 분산된 키 관리 구조와 서브 그룹 단위로 그룹키를 갱신한다. 시뮬레이션을 통하여 제안한 멀티캐스트 그룹키 관리 프로토콜을 기존의 연구들과 비교한 결과 가입 및 탈퇴 지연시간과 데이터 전송 지연 시간 측면에서 향상된 성능을 나타냄을 알 수 있었다.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2001년도 춘계종합학술대회
• /
• pp.152-156
• /
• 2001

인터넷의 활성화에 힘입어 멀티캐스트 응용을 위한 다양한 연구가 진행되어져오고 있다. 본 논문에서는 OFT(One-way Function Trees)를 사용한 안전한 멀티캐스트 키분배 프로토콜을 제안한다. 제안하는 프로토콜은 DKMP(Distributed Key Management Protocol)방식과 CKMF(Centralized Key Management Protocol)방식 각각의 특성 및 장점을 살린 혼합 방식으로, DKMP의 특성인 그룹 키 생성시 모든 멤버의 참여를 보장하는 측면과 CKMP의 특성인 키 관리 및 프로토콜 설계의 용이성을 고려하여 설계하였다. 또한 제안된 프로토콜은 그룹 비밀키 생성시 해쉬 함수와 비트단위 XOR 연산만을 이용하기 때문에 멤버들의 연산 오버헤드를 줄일 수 있어, 멤버의 가입 및 탈퇴가 빈번히 발생하는 동적인 환경에 효율적으로 활용될 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권12호
• /
• pp.3352-3365
• /
• 2012

Group key agreement (GKA) is a cryptographic primitive allowing two or more users to negotiate a shared session key over public networks. Wu et al. recently introduced the concept of asymmetric GKA that allows a group of users to negotiate a common public key, while each user only needs to hold his/her respective private key. However, Wu et al.'s protocol can not resist active attacks, such as fabrication. To solve this problem, Zhang et al. proposed an authenticated asymmetric GKA protocol, where each user is authenticated during the negotiation process, so it can resist active attacks. Whereas, Zhang et al.'s protocol needs a partially trusted certificate authority to issue certificates, which brings a heavy certificate management burden. To eliminate such cost, Zhang et al. constructed another protocol in identity-based setting. Unfortunately, it suffers from the so-called key escrow problem. In this paper, we propose the certificateless authenticated asymmetric group key agreement protocol which does not have certificate management burden and key escrow problem. Besides, our protocol achieves known-key security, unknown key-share security, key-compromise impersonation security, and key control security. Our simulation based on the pairing-based cryptography (PBC) library shows that this protocol is efficient and practical.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.256-259
• /
• 2003

This paper presents mutual authentication scheme between user and network on mobile communications using public key scheme based on counter, and simultaneously shows key agreement between user and user using random number for secure communications. This is also a range of possible solutions to authentication and key agreement problem-authentication and key agreement protocol based on nonce and count, and secure end-to-end protocol based on the function Y=f(.)$\^$1/, C$\^$i/ is count of user I, and f(.) is one way function.

• 중소기업융합학회논문지
• /
• 제4권4호
• /
• pp.19-23
• /
• 2014

Group communication is becoming increasingly popular in Internet applications such as videoconferences, online chatting programs, games, and gambling. For secure communications, the integrity of messages, member authentication, and confidentiality must be provided among group members. To maintain message integrity, all group members use the Group Key (GK) for encrypting and decrypting messages while providing enough security to protect against passive attacks. Tree-based Group Diffie-Hellman (TGDH) is an efficient group key agreement protocol to generate the GK. TGDH assumes all members have an equal computing power. One of the characteristics of distributed computing and grid environments is heterogeneity; the member can be at a workstation, a laptop or even a mobile computer. Member reordering in the TDGH protocol could potentially lead to an improved protocol; such reordering should capture the heterogeneity of the network as well as latency. This research investigates dynamic reordering mechanisms to consider not only the overhead involved but also the scalability of the proposed protocol.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권1호
• /
• pp.149-165
• /
• 2013

Current group key agreement protocols, which are often tree-based, have unnecessary delays that are caused when members with low-performance computer systems join a group key computation process. These delays are caused by the computations necessary to balance a key tree after membership changes. An alternate approach to group key generation that reduces delays is the dynamic prioritizing mechanism of queue-based group key generation. We propose an efficient group key agreement protocol and present the results of performance evaluation tests of this protocol. The queue-based approach that we propose is scalable and requires less computational overhead than conventional tree-based protocols.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권7호
• /
• pp.1737-1753
• /
• 2013

Current group key agreement protocols, which are often tree-based, have unnecessary delays that are caused when members with low-performance computer systems join a group key computation process. These delays are caused by the computations necessary to balance a key tree after membership changes. An alternate approach to group key generation that reduces delays is the dynamic prioritizing mechanism of queue-based group key generation. We propose an efficient group key agreement protocol and present the results of performance evaluation tests of this protocol. The queue-based approach that we propose is scalable and requires less computational overhead than conventional tree-based protocols.

• 디지털융복합연구
• /
• 제10권6호
• /
• pp.247-251
• /
• 2012

인터넷 응용프로그램을 통해 그룹 통신의 사용이 증가하면서 보안의 대한 요구사항인 메시지 무결성, 사용자 인증, 기밀성이 중요시 되고 있다. 보안 요구 사항을 위해서 그룹 통신 시에 암호 키를 생성하여 메시지 기밀성을 유지하는데, 키 생성을 효율적이면서도 안전하게 키 생성 트리를 이용하여 모바일 컴퓨팅 환경의 사용자도 쉽게 키를 생성하도록 사용자 재배치를 통해 키 생성 효율을 증대 시키기 위해 본 연구의 목표가 있다.

• 한국컴퓨터정보학회논문지
• /
• 제21권9호
• /
• pp.73-78
• /
• 2016

In 2014, Wuu et al. proposed a group key management scheme based on (2,2) secret sharing. They asserted that their scheme satisfies security requirements and mutual authentication. But this paper pointed out that their scheme does not satisfy mutual authentication and impersonating attack. In this paper, we describe the reasons and processes that a malicious group member can impersonate the Group Key Distributor. To fill the gaps, we discuss the problems, and propose an improved protocol.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권2호
• /
• pp.178-194
• /
• 2009

Current group key agreement protocols(often tree-based) involve unnecessary delays because members with low-performance computer systems can join group key computation. These delays are caused by the computations needed to balance a key tree after membership changes. An alternate approach to group key generation that reduces delays is the dynamic prioritizing mechanism of filtering low performance members in group key generation. This paper presents an efficient tree-based group key agreement protocol and the results of its performance evaluation. The proposed approach to filtering of low performance members in group key generation is scalable and it requires less computational overhead than conventional tree-based protocols.