• ETRI Journal
• /
• 제30권3호
• /
• pp.483-485
• /
• 2008

A micro-sensor network is comprised of a large number of small sensors with limited memory capacity. Current key-establishment schemes for symmetric encryption require too much memory for micro-sensor networks on a large scale. In this paper, we propose a memory-efficient hypercube key establishment scheme that only requires logarithmic memory overhead.

• 한국정보처리학회논문지
• /
• 제6권11호
• /
• pp.3046-3059
• /
• 1999

Kailar Accountability Logic proposed for the accountability analysis of communication protocols that require accountability and use asymmetric key digital signature is extended for protocols that use symmetric key digital signature. A proposed electronic micropayment protocol that uses symmetric key digital signature is analyzed to illustrate the use of the extend logic in detecting its lack f accountability and suggesting changes to enhance its accountability.

• 정보처리학회논문지C
• /
• 제16C권6호
• /
• pp.669-680
• /
• 2009

무선으로 대상물의 고유정보를 인식함으로 대상물을 관리할 수 있게 하는 RFID(Radio Frequency Identification)기술은 유비쿼터스 시대의 핵심기술이다. RFID에서 정보는 공간상에서 쉽게 노출될 수 있음으로 보안 및 프라이버시 문제가 항시 존재한다. 본 논문에서는 저가형 태그의 구현에 적합한 대칭키 기반의 상호인증 프로토콜을 제안한다. 제안한 프로토콜은 대칭키를 사용하여 하드웨어 자원을 최소화할 수 있으며, 해쉬 함수로 암호화한 태그 ID를 사용하고 PUF(Physically Unclonable Function)의 Challenge-Response값을 공유 대칭키로 활용하기 때문에 키 노출 위험이 없는 안전한 프로토콜이다.

• 한국멀티미디어학회논문지
• /
• 제6권7호
• /
• pp.1277-1285
• /
• 2003

본 논문은 IMT-2000환경에서 대수학적 방법을 적용하여 회의용 키 인증 메커니즘을 제안한다. 이를 위해서 symmetric balanced incomplete block design 기법을 응용하여 회의용 키를 생성하고, 참여한 사용자들에 생성된 키를 분배한다. 회의용 키 생성 기술과 ID 정보를 기반으로 하여 수행된 상호 인증을 통하여 통신 프로토콜은 설계한다. 제안된 프로토콜에서 회의용 전송키를 생성하기 위한 통신 복잡도를 최소화시키며, 특별한 경우에 복잡도는 O(equation omitted)이 되는데 여기에서 v는 참여자의 수이다. 보안 시스템의 구축에 있어서 중요한 문제인 본 프로토콜의 안전도는 이산 대수를 찾아내는 것은 hard 문제이기 때문에 보장할 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권5호
• /
• pp.2203-2217
• /
• 2016

To prevent structured peer to peer (P2P) overlay networksfrom being attacked by malicious nodes, a symmetric lookup-based routing algorithm referred to as Symmetric-Chord is proposed in this paper. The proposed algorithm determines the precision of routing lookup by constructing multiple paths to the destination. The selective routing algorithm is used to acquire information on the neighbors of the root. Authenticity of the root is validated via consistency shown between the information ascertained from the neighbors and information from the yet-to-be-verified root, resulting in greater efficiency of resource lookup. Simulation results demonstrate that Symmetric-Chordhas the capability of detecting malicious nodes both accurately and efficiently, so as to identify which root holds the correct key, and provides an effective approach to the routing security for the P2P overlay network.

• 한국산업정보학회논문지
• /
• 제13권1호
• /
• pp.68-75
• /
• 2008

Ad hoc 네트워크는 구성이 변하기 쉬운 환경이므로 불법 노드가 네트워크 자원소비 및 경로방해 등의 동작이 용이하므로 라우팅 프로토콜 보호가 필요하다. 본 논문에서는 대칭키 암호화 방식을 이용하여 효율적이고 안전한 경로발견 프로토콜을 제안한다. 제안한 프로토콜은 대칭키 암호화 방식을 이용하여 각 홉에서 처리하는 연산량을 줄이며 경로응답 시 암/복호화 과정이 있어 정당한 홉을 가장한 active 공격에 강하다.

• 한국정보기술응용학회:학술대회논문집
• /
• 한국정보기술응용학회 2005년도 6th 2005 International Conference on Computers, Communications and System
• /
• pp.277-280
• /
• 2005

With the proliferation of mobile terminals, use of the Internet in mobile environments is becoming more common. To support mobility in these terminals, Mobile IPv4 is proposed and represents the standard in IPv4 environments. Authentication should be mandatory, because mobile terminals can utilize Internet services in any foreign domain. Mobile IPv4 provides symmetric key based authentication using the default HMAC-MD5. However, symmetric key based authentication creates a key distribution problem. To solve this problem, public key based authentication mechanisms have been proposed. In this paper, the performance of each of these mechanisms is evaluated. The results present that, among these mechanisms, partial certificate based authentication has superior performance, and certificate based authentication has the worst performance. Although current public key based authentication mechanisms have lower performance than symmetric key based authentication, this paper presents the possibility that public key based authentication mechanisms may be used for future mobile terminal authentication.

• 한국산업정보학회논문지
• /
• 제2권1호
• /
• pp.161-175
• /
• 1997

In this ppaer, we present a Authenticatino System for IC-card using symmetric key algorithm. And we anlayzed previsous articles and solved a problem of key management which is one of difficulties in using symmetric key algorithm. This presented protocal is strong to different attacks.

• Journal of Communications and Networks
• /
• 제14권6호
• /
• pp.682-691
• /
• 2012

Key agreement protocol is a fundamental protocol in cryptography whereby two or more participants can agree on a common conference key in order to communicate securely among themselves. In this situation, the participants can securely send and receive messages with each other. An adversary not having access to the conference key will not be able to decrypt the messages. In this paper, we propose a novel identity-based authenticated multi user key agreement protocol employing a symmetric balanced incomplete block design. Our protocol is built on elliptic curve cryptography and takes advantage of a kind of bilinear map called Weil pairing. The protocol presented can provide an identification (ID)-based authentication service and resist different key attacks. Furthermore, our protocol is efficient and needs only two rounds for generating a common conference key. It is worth noting that the communication cost for generating a conference key in our protocol is only O($\sqrt{n}$) and the computation cost is only O($nm^2$), where $n$ implies the number of participants and m denotes the extension degree of the finite field $F_{p^m}$. In addition, in order to resist the different key attack from malicious participants, our protocol can be further extended to provide the fault tolerant property.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(2)
• /
• pp.341-344
• /
• 2002

The importance of protection for information is increasing by the rapid development of information communication and network. Asymmetric crypto-system is the mainstream in encryption system rather than symmetric cryptosystem by above reasons. But asymmetric cryptosystem is restricted in applying to application fields by the reason it takes more times to process than symmetric cryptosystem. In this paper, the proposed cryptosystem uses an algorithm that combines block cipherment with stream ciphcrment. Proposed cryptosystem has a high stability in aspect of secret rate by means of transition of key sequence according to the information of plaintext while asymmetric /symmetric cryptosystern conducts encipherment/decipherment using a fixed key Consequently, it is very difficult to crack although unauthenticator acquires the key information. So, the proposed encryption system which has a certification function of asymmetric cryptosystcm and a processing time equivalent to symmetric cryptosystcm will be highly useful to authorize data or exchange important information.