• Journal of Korea Multimedia Society
• /
• v.13 no.8
• /
• pp.1202-1211
• /
• 2010

The connection between devices in Ad-hoc network a network based on trust. Because a temporary device frequently join or leave, the authentication and security technology should be prepared for malicious device of a third-party attacks. The authentication scheme with the existing certification and ID, and the security technology using symmetric key and the public key is used. Therefore, in this paper we proposed two devices not having shared information use to generate each other's authentication ID. The use of authentication ID can establish the mutual trust and, provide security and efficiency for communication uses to generate a symmetric key.

• The Journal of the Korea Contents Association
• /
• v.5 no.5
• /
• pp.78-84
• /
• 2005

Various kinds of data broadcasting services can be offered using a return-channel in digital broadcasting TV compared to analog services. In these data broadcasting environments, several data(associated with TV broadcasting programs, or not) are provided to the TV audiences except for audio/video broadcasting data. In this paper, a structure of data manager for data/object carousel, based on data broadcasting protocols, was proposed for data broadcasting services using a return-channel, and were supported to the production technologies of DTV contents. These contents application techniques for DTV will be implemented with this data manager in MPEG2-TS data broadcasts using PID(Packet ID).

• Convergence Security Journal
• /
• v.6 no.2
• /
• pp.43-51
• /
• 2006

The existing electronic transaction protocol uses a cryptography algorithm that is not suitable for mobile environment because of limited memory and process ability. In this paper, we propose an efficient transaction protocol suitable for mobile embedded system. The proposed protocol reduces computation and process time by using ID-based cryptography algorithm and ECC (elliptic curve cryptosystem). It uses vendor authentication only in the first transaction, and from the second transaction, it requires transaction after authentication with session created by applying ECC technique. Therefore, the creation number of authentication for the vendor can be reduced from n to one. And it reduces process time because it provides the same security with 160 bits as with 1024 bits of RSA.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1477-1480
• /
• 2008

주민번호대체수단은 주민번호를 대체하기 위한 본인확인정보로서, 5 개의 민간기업이 운영하는 민간 i-PIN과 행정안전부가 운영하는 공공 i-PIN이 서비스를 제공하고 있다. 하지만 주민번호대체수단이 더욱 활성화되기 위해서는 기존에 제시된 보안성, 편의성 문제를 해결해야 한다. 본 논문은 신원 선택기를 추가하여, i-PIN의 프로토콜을 변경하지 않는 범위 이내에서 i-PIN의 단점으로 지적되는 로그인 번거로움, i-PIN 사이트 기억 문제, 피싱을 비롯한 보안 문제를 해결하는 방안을 제시하였다. 제안하는 방법은 사용자가 가입한 i-PIN 제공자에 접근하는 단계, i-PIN 제공자에 id 와 비밀번호를 입력하는 단계를 없애고, 신원 선택기를 통해 사용할 신원 정보를 선택하는 것만으로 처리되도록 하였다. 본 기술은 ETRI 에서 개발중인 전자 ID 지갑 솔루션을 통해 구현되었으며, 해당 서비스는 2009 년 중에 민간 i-PIN 제공자를 통해 시범 도입될 예정이다.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.419-424
• /
• 2003

Every CP has its own contents classification system for charging. Currently most classification system is based on the CPID and Service ID of the WAP. An service ID from a common CPID pool is provided to CP for each service. Then charges are computed for each service ID. But in this system CPID range must be changed whenever the CP adds a new service. Therefore all CPIDs of the existing services must be updated. Another problem is that when a CP provides several services, it has multiple CPIDS. Therefore with increasing number of services CPID would be exhausted in the future. In this paper, we proposes a new contents ,classification system. We remove CPID range and instead we propose a new CPID composed of a system n, service classification ID and a serial number. The new CPID is assigned to each service. By this scheme we improve the contents classification system.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.4
• /
• pp.733-744
• /
• 2012

Dynamic threshold public-key encryption provides dynamic setting of the group of all users, receivers and the threshold value. Over recent years, there are many studies on the construction of scheme, called ID-based dynamic threshold encryption, which combines the ID-based encryption with dynamic threshold encryption. In this paper, we analyze the ID-based dynamic threshold encryption proposed by Xing and Xu in 2011, and show that their scheme has a structural problem. We propose a conversion method from ID-based encryption which uses the bilinear map to ID-based dynamic threshold encryption. Additionally, we prove this converted scheme has CPA security under the full model.

• Journal of Internet Computing and Services
• /
• v.11 no.3
• /
• pp.139-148
• /
• 2010

In the sensor network security area, previous works were mainly concentrated on achieving authentication, confidentiality, integrity and availability. But the ID exposure issue is recently an increasing concern in research community. To protect the ID exposure from various attacks, the most common approach is to make use of a dynamic pseudonym rather than the real ID. However, if a node's secret key (or hash key) and the current pseudonym (such as a random number) are exposed, the attacker can easily generate the previous/next pseudonyms. In this paper, we propose a security infra-structure scheme for enabling strong anonymity of sensor nodes. Our scheme ensures that the probability being able to generate a pseudonym is very low even if a sensor node has been compromised with an attacker. Security analyses have proven that our scheme is suitable for sensor network environments in terms of preserving of forward anonymity as well as backward anonymity.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.04a
• /
• pp.71-75
• /
• 2000

본 논문에서는 실생활에서 개인이 관리해야 하는 다수의 패스워드를 효율적으로 관리하고 가상공간에서 패스워드 분실 및 변경을 효과적으로 수행하기 위한 Pseudopia 라는 패스워드 전용관리 함수를 제안한다. 제안 방안은 인터넷 접속에 사용되는 사용자 id나 패스워드를 일 방향 함수를 이용하여 웹사이트마다 다르게 제공함으로써, 사용자 id를 통한 패스워드 유추또는 신분 노출의 문제점을 방지해주고, 주요 패스워드의 분실시 기존 방식인 사용자와 관리자의 면대면 신분확인 방식을 개선해줌으로써 인터넷 사용자에게 보다 편리하고 안전한 환경을 제공할 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.151-154
• /
• 2007

최근 인터넷 상의 개인정보의 유출로 인한 피해가 급증하면서, 인터넷 상에서 사용하는 사용자 정보 관리 문제가 크게 대두되고 있다. 이들을 해결하기 위하여 여러 Identity 관리 시스템이 등장했다. 이들 중 OpenID는 사용자 중심의 Identity 관리 기술이며, url을 기반으로 하는 사용자 정보 제공 시스템이다. 기존의 웹 서비스는 입력된 사용자의 정보를 각각 저장하여 관리하는 반면, OpenID는 OpenID를 지원하는 특정 사이트를 지정함으로써 그곳에서 사용자의 정보를 제공하는 것이 특징이다. 하지만 이런 분산화된 사용자의 정보는 웹서비스에서 필요하는 사용자에 정보에 따라 각각 다른 url를 입력해야 한다. 이와 같은 방법은 기존의 각 사이트마다의 아이디와 패스워드를 알아야 하는 것과 같은 현상을 초래할 수 있다. 본 논문을 통해 구현한 서비스는 웹 서비스에서 요구하는 사용자의 정보에 따라 동적으로 사용자 정보제공자를 선택하거나 필요한 정보만을 요청함으로써 하나의 url만으로 원하는 모든 웹 서비스를 이용할 수 있도록 한다.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.11
• /
• pp.101-107
• /
• 2010

As digital environment rapidly changes, various identification infrastructures have been introduced. It inevitably caused the Interoperability issue between the identifiers. Especially, Interoperability issue between the same kinds of identifiers raised the problems such as decreasing usefulness and cost overhead for making bridge system. In this paper, we resolve this issue by suggesting ID mashup service based on XRI. Although both UCI and ICN are the dominant identification infrastructures in the soundsource domain, the modification of identifiers or the requirement of complex system are essential for Interoperability. The ID mashup service suggested in the paper is able to provide interoperable functions to outer world without modifying the structures and resolution service of both identification infrastructures.