• Journal of Digital Convergence
• /
• v.10 no.6
• /
• pp.247-251
• /
• 2012

Tree-based Group Diffie-Hellman (TGDH) is one of the efficient group key agreement protocols to generate the GK. TGDH assumes all members have an equal computing power. As one of the characteristics of distributed computing is heterogeneity, the member can be at a workstation, a laptop or even a mobile computer. Therefore, the group member sequence should be reordered in terms of the member's computing power to improve performance. This research proposes a reordering of members in the group key generation tree to enhance the efficiency of the group key generation.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.597-604
• /
• 2002

Changing group key is necessary for the remaining members when a new member joins or a member leaves the group in multicast communications. It is required to guarantee perfect forward and backward confidentiality. Unfortunately, in large groups with frequent membership changes, key changes become the primary bottleneck for scalable group. In this paper, we propose a novel approach for providing efficient group key distribution in large and dynamic groups. Unlike existing secure multicast protocols, our protocol is scalable to large groups because both the frequency and computational overhead of re-keying is determined by the size of a subgroup instead of the size of the whole group, and offers mechanism to prevent the subgroup managers with group access control from having any access to the multicast data that are transfered by sender. It also provides security service for preserving privacy in wireless computing environments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.10
• /
• pp.2481-2490
• /
• 2015

The issue of PHR is maintained on the server will be in the hospital. PHR information stored on the server, such as a patient's illness and treatment is very sensitive information. Therefore, patients should be guaranteed the protection of privacy. In addition, the PHR should be allowed to group access of it's approach. Therefore, in this paper the proposed group signature using hierarchical identity-based encryption schemes into can guarantee the PHR data privacy. The session key generated by group signature, it is use a tiered approach. The generated session keys safe PHR data transmission is possible. The proposed method is average 80% than the PKI encryption and ID-based encryption rather than average 50% the algorithm processing is more efficient

• The Safety technology
• /
• no.148
• /
• pp.15-17
• /
• 2010

충북 진천군 초평면 용정리에 위치하고 있는 넥상스코리아는 2001년 대성전선과 전력케이블 전문 기업인 넥상스그룹이 합병하면서 설립된 외국인 투자기업이다. 주요생산품으로는 전력케이블, 동통신케이블, 광통신케이블 및 자동차전선을 생산하고 있으며, 안전을 최우선으로 근로자의 건강은 물론 친환경제품생산으로 글로벌 기업으로 도약해 나가고 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.367-370
• /
• 2001

컴퓨터의 보급과 통신의 발전은 인터넷과 같은 공개 네트워크 상에서 그룹 기반 통신 응용 서비스에 관한 요구를 증가시키고 있다. 이에 따라 멀티캐스트 기반 구조에 관한 연구가 활발히 진행되고 있지만, 멀티캐스트 구조에 대한 안전성과 효율성 및 확장성 부분에 대한 해결책은 아직 미비한 상태이다. 본 연구에서는 기존의 대표적인 멀티캐스트 키 관리 구조를 고찰함과 동시에 안전성 및 확장성을 분석한다. 이에 기초해 확장성을 제공하는 안전한 멀티캐스트 키 관리 구조를 제안하고 기존의 그룹 키 분배 방식들을 적용해 봄으로서 기존 멀티캐스트 키 관리 구조와 비교 분석한다.

• The KIPS Transactions:PartC
• /
• v.17C no.6
• /
• pp.441-450
• /
• 2010

Recently, a lot of interest is increased in sensor network which gathers various data through many sensor nodes deployed in wired and wireless network environment. However, because of the limitation in memory, computation, and energy of the sensor nodes, security problem is very important issue. In sensor network, not only the security problem, but also computing power should be seriously considered. In this paper, considering these characteristics, we make the sensor network consist of normal sensor nodes and clusterheaders with enough space and computing power, and propose a group key rekeying scheme adopting PCGR(Predistribution and local Collaborationbased Group Rekeying) for secure group communication. In our proposal, we enhance the security by minimizing the risk to safety of the entire network through verifying the new key value from clusterheader by sensor nodes. That is, to update the group keys, clusterheaders confirm sensor nodes through verifying the information from sensor nodes and send the new group keys back to authentic member nodes. The group keys sent back by the clusterheaders are verified again by sensor nodes. Through this mutual authentication, we can check if clusterheaders are compromised or not. Qualnet simulation result shows that our scheme not only guarantees secure group key rekeying but also decreasesstorage and communication overhead.

• Journal of Korea Multimedia Society
• /
• v.7 no.7
• /
• pp.922-933
• /
• 2004

In recent years, peer-to-peer network have a greate deal of attention for distributed computing or collaborative application, and work of ID-based public key systems have been focusing on the area of cryptography. In this paper, we propose ID-based group key management protocols for secure communication in autonomous peer group. Each member obtains his public/private key pair derived from his identification string from Private Key Generator. No central server participates in group key management protocol instead, all group members share the burden of group key management by the collaboration of themselves, so that our scheme avoids the single point of failure problem. In addition, our scheme considers the nature of dynamic peer group such as frequent joining and leaving of a member.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.9
• /
• pp.3495-3501
• /
• 2010

Because the application simultaneously to transmit large amounts of data (Video conferencing, Internet broadcasting, Online games etc.) to multiple users increases, the importance and utilization of group communication was greater. So the security was recognized as a important issue. To provide security in multicast environment, A study of single group management server using protocol based on Key Tree Scheme was proposed. But the paper proposes secure group key management scheme to be a relatively low-overhead. Therefore proposed paper is demonstrated to be excellent by comparing the effectiveness of existing and proposed group key management scheme.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.1
• /
• pp.436-444
• /
• 2011

As practical use degree of multicasting increase, security for multicast is recognized as an important issue. Previous research in the area of secure multicast has mainly focused on group key management. The most important thing about the security of multicast is that only authorized members of this group will be able to access the data. The member of access to multicast communication is to use cryptography with a common shared session encryption key. We propose decentralized group key management based on agent for dynamic multicast with large groups and frequent joins or leaves in this paper. Whole group divide to several subgroup using agent technology and each agent manage members of each subgroup. Also, when rekeying updates that using one-way hash function can prevent the key exposure, and reduce the key distribution delay.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.955-958
• /
• 2006

초고속인터넷이 널리 보급되면서 최근 메신저 서비스(Messenger Service)를 이용하는 사용자가 폭발적으로 증가하고, 해킹 기술의 발달로 인하여 메신저를 통하여 전달되는 메시지들이 악의의 사용자에게 쉽게 노출될 수 있는 가증서도 커지고 있다. 본 논문에서는 인스턴트 메신저의 안전한 통신을 위해 인증서를 이용한 인스턴트 메신저 프로토콜에 대해 설계하였다. 또한 메신저 서비스에서의 메시지 보안을 구현함에 있어서 공개키 암호 알고리즘의 연산수행시간을 단축하기 위해 ElGamal 방식의 ECC(Elliptic Curve Cryptography) 알고리즘을 사용하고, 사용자 그룹 단위의 암호화를 위해 그룹별로 타원곡선과 그 위에 있는 임의의 점을 선택하여 다른 그룹과 구별하였다.