http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
그룹키를 이용한 보안 멀티캐스트 시스템에서 최소 비용을 위한 Rekey Interval 할당에 관한 연구
이구연,이용,Lee, Goo-Yeon,Lee, Yong 대한전자공학회 2003 電子工學會論文誌-TC (Telecommunications) Vol.40 No.1
본 논문에서는 그룹키를 이용하는 보안 멀티캐스트 환경에서 그룹키 노출로 인한 정보손실과 그룹키 재분배의 과정에 대하여 연관지어 설명한다. 또한 손실된 정보에 대한 비용과 키 갱신에 소요되는 비용의 과제를 결합하여 최소의 비용을 갖는 최적의 rekey interval을 분석한다. 본 분석의 결과를 이용하면 그룹키 재분배에 있어서 비용적인 면을 효율성의 척도로 하여, 회원수, 회원의 보안 능력 및 탈퇴율등을 반영하여 rekey interval을 구함으로서 최소비용으로 그룹을 관리할 수 있다. 이러한 효율적인 rekey interval 할당에 대한 연구는 지금까지 크게 중요시되지 않던 부분이었으나 rekey interval 할당에 대한 문제를 현재보다 개선하고 보완한다면, 보안 멀티캐스트 그룹의 활강성과 활용성을 증가시킬 수 있을 것이다. In this paper, we investigate a rekey mechanism for a secure multicast group communications and relate the mechanism to the loss of information from group key exposal. We also combine cost for the information loss and cost for group key updates and analyze the optimum rekey interval. Using the results of the analysis in this paper, we can manage a secure multicast group efficiently with the minimal cost on the bases of number of group members, each member's security level and withdrawal rates.
이구연(Goo Yeon Lee),김화종(Hwa-Jong Kim) 한국정보기술학회 2018 한국정보기술학회논문지 Vol.16 No.7
In this paper, we study a performance analysis of a surveillance camera system with image recognition server based on frame discard rate and server utilization. The states of surveillance cameras are divided into recognition and silence states to analyze the parameters such as the optimal number of image frames and cameras based on processing capacity of the recognition server. Also, we define the value function that reflects the number of image frames transmitted through the network, the operation rate of the server, and the surveillance effect, and conducts an optimal system design study based on the defined value function. The result of the analysis can provide the bases that can derive the optimal design parameters according to various cost factors of the service domain and it will be useful for effective operation of the evolving surveillance camera systems.
이구연(Lee Goo Yeon),김화종(Kim Hwa Jong),정충교(Jeong Choong Kyo),이용(Lee Yong) 강원대학교 산업기술연구소 2004 産業技術硏究 Vol.24 No.1
In this paper, we introduce a packet diversity scheme to increase uplink channel utilization in a wireless network where forward error correction is used. The packet diversity allows neighbor base stations to receive uplink packets from a mobile terminal in order to increase the utilization of the uplink channel. By allowing multiple base stations to receive the same packets, we can improve the error correction capability in an uplink channel. By incorporating the packet diversity we can reduce the parity overhead of each packet for a given tolerable loss probability, which improves the link efficiency.
IoT 환경에서 GDPR에 부합하는 개인정보수집 동의 절차
이구연(Goo Yeon Lee),방준일(Junil Bang),차경진(Kyung Jin Cha),김화종(Hwa Jong Kim) 한국정보기술학회 2019 한국정보기술학회논문지 Vol.17 No.5
Many IoT devices like sensors lack screen and input devices, thus making them hard to meet the consent conditions that GDPR requires. This is acting as a legal barrier for further advancement in the business field. In this paper, we designed the process for consent of personal information collection that meets the legal conditions. In this design, user’s personal data is received in an encrypted form by data collecting server first. The encrypted personal data can be decrypted after associating with user agent based on the consent procedure of the collection of personal information. During the consent procedure, user agent understands the privacy policy about personal information collection and offers the key to decrypt the data. This kind of personal information collection agreement procedure will satisfy the transparent and freely given consent requirements of GDPR. Thus, we can speculate from here that the proposed procedure will contribute to the evolution of IoT business area dealing with personal information.
이구연(Goo Yeon Lee) 한국정보기술학회 2017 한국정보기술학회논문지 Vol.15 No.4
In this research, we consider an improvement of end-to-end message transfer delay by using erasure coding in networks with binomial transfer time. And we propose a scheme in which a message is fragmented into several packets which are erasure-coded generating additional redundancy packets, resulting in increased number of transmitted packets. Increased number of packets can reduce the message transfer time to destination. For the proposed scheme, we investigate the optimal numbers of fragmented packets and redundancy packets considering reduction of transfer delay and additional transmission cost generated by erasure coding. From the investigation results, we see that the proposed scheme is very effective in networks with binomial transfer time, and is practical and useful especially when expedited deliveries of messages are needed.
전송시간의 변화가 큰 네트워크에서 네트워크 코딩을 적용한 전송 지연시간 개선 방법 및 성능 분석
이구연(Goo Yeon Lee),이용(Yong Lee) 대한전자공학회 2012 전자공학회논문지 Vol.49 No.11
본 논문에서는 전송시간의 변화가 큰 네트워크 환경에서 네트워크 코딩을 이용한 종단간 메시지 지연 단축 스킴을 제안한다. 제안된 스킴에서는 메시지를 여러개의 패킷(g개의 패킷)으로 분할하고, 이에 대하여 네트워크 코딩을 수행함으로서 리던던시 패킷(r개의 패킷)을 포함하여 만들어진 패킷들(g+r개의 패킷)을 전송한다. g+r개의 패킷 중에서 g개의 패킷이 도착하면 메시지가 복구되므로 전체적인 메시지 전송지연은 단축된다. 일반적으로 네트워크는 전송하는 패킷의 최대 크기 제한을 두고 있으므로, 이러한 환경에서 본 논문에서 제안한 스킴에서의 지연 단축 효과 및 전송 비용을 고려하여 최적의 패킷 분할 수 및 리던던시 패킷의 수에 대한 분석을 수행한다. 분석 결과로부터 제안된 스킴은 전송시간의 변화가 큰 네트워크에서 큰 효과를 내며, 특히 긴급한 메시지의 전송이 필요할 때 유용함을 알 수 있다. In this paper, we focus on end-to-end transfer delay improvement by using network coding and propose a scheme where a message is divided into several packets which are network coded generating additional redundancy with the results that the number of transmitted packets increases. In networks with high coefficient of variation of transfer time, increased number of packets could reduce the transfer time of the message to a destination. For the proposed scheme, we investigate the optimum number of divided packets and redundancy considering transfer delay reduction and additional transmission cost caused by using network coding under the restriction of maximum transmission packet size. From the results of the investigation, we see that the proposed scheme is effective in networks having high variability of transfer time and would be very useful and practical especially for the case that expedited deliveries of messages are needed.
이구연(Goo-Yeon Lee),이용(Yong Lee),김화종(Hwa-Jong Kim),정충교(Choong-Kyo Jeong),이동은(Dong-Eun Lee) 한국정보보호학회 2005 정보보호학회논문지 Vol.15 No.4
We propose and implement a flexible secure peer-to-peer(P2P) file sharing scheme which can be used for data sharing among closed user group (CUG) members. When a member wants to share data, notification messages are sent to the members with whom the member wants to share data. Each notification message includes one-time password encrypted with the receiver's public key. A member who received the notification message can download the data by using the one-time password. The proposed scheme provides selective sharing, download confirmation and efficient storage management. In terms of security, the proposed scheme supports authentication, entity privacy, replay attack protection and disguise prevention. We also implement the proposed system and find that the system is very useful among P2P service of closed user groups.