• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.5
• /
• pp.15-25
• /
• 2007

According to augmentation about interesting and demanding of privacy over the rest few years, researches that provide anonymity have been conducted in a number of applications. The ad hoc routing with providing anonymity protects privacy of nodes and also restricts collecting network information to malicious one. Until recently, quite a number of anonymous routing protocols have been proposed, many of them, however, do not make allowance for authentication. Thus, they should be able to have vulnerabilities which are not only modifying packet data illegally but also DoS(denial of service) attack. In this paper, we propose routing protocol with providing both anonymity and authentication in the mobile ad hoc network such as MANET, VANET, and more. This scheme supports all of the anonymity properties which should be provided in Ad Hoc network. In addition, based on the group signature, authentication is also provided for nodes and packets during route discovery phase. Finally, route discovery includes key-agreement between source and destination in order to transfer data securely.

• Convergence Security Journal
• /
• v.10 no.3
• /
• pp.29-41
• /
• 2010

Survelliance and Reconnaissance Sensor Network(SRSN) which can collect various tactical information within battlefield in real time plays an important role in NCW environment, of sensor to shooter architecture. However, due to the resource-limited characteristics of sensor nodes and the intrinsic attributes of sensor network such as wireless communication, the SRSN may be vulnerable to various attacks compared to traditional networks. Therefore, in this paper, we propose a new group key management scheme to guarantee confidentiality, integrity, availability, and authentication during the operation of the SRSN. Proposed scheme generates and distributes the group key based on the topological characteristic of the SRSN and the probabilistic key sharing. The communication cost for distributing the group key is O(logn).

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.782-785
• /
• 2006

셀 내의 모바일 노드들의 수가 많고 셀 간의 이동이 빈번한 고속 모바일 네트워크에서는 기존 802.11 프로토콜로는 좋은 성능을 보장할 수 없다. 셀 내에 새로 진입한 노드들은 네트워크에 참여하기 위해 자신의 존재 여부를 알려야 한다. 802.11 표준에서는 이러한 선행되어야 할 작업을 스캐닝, 인증, 결합의 3가지 단계로 규정한다. 이 등록 작업은 셀 내의 다른 데이터 패킷을 보내려는 노드들과의 경쟁을 통해 이루어진다. 그러므로 셀 내의 노드 수가 많을 경우 기본적인 통신을 위해 선행되어야 할 등록 작업이 지연될 수 있다. 802.11 표준에서는 DCF 방식을 기본 매체 접근 프로토콜로 한다. DCF는 BEB (Binary Exponential Backoff) 알고리즘을 기반으로 한다. BEB 알고리즘의 여러 문제점[5]으로 이를 대체할 알고리즘이 연구되어왔으며, 그룹화를 통해 경쟁하는 노드의 수를 줄이는 방법도 고려되었다. 본 논문에서는 802.11의 성능 평가를 위한 모델링에 Markov chain을 이용한 논문[1]을 기반으로 하나의 노드가 등록 작업에 소요하는 평균 시간을 해석적으로 계산하였다. 셀 내의 전체 노드 수에 증가함에 따라 등록 시간을 계산하고, 직접 시뮬레이션을 통해 수식으로 얻어진 결과와 비교하였다. 또한 그룹화를 시뮬레이션 하여 전체 노드 수에 따라서 적절한 그룹 수의 조정이 그룹화하지 않았을 경우보다 더 나은 성능을 보여줄 수 있다는 것을 보였다.

• Journal of Convergence for Information Technology
• /
• v.12 no.3
• /
• pp.38-45
• /
• 2022

Due to the development of fintech technology, financial transactions using smart phones are being activated. The password for user authentication during financial transactions is entered through the virtual keypad displayed on the screen of the smart phone. When the password is entered, the attacker can find out the password by capturing it with a high-resolution camera or spying over the shoulder. A virtual keypad with security applied to prevent such an attack is difficult to input on a small touch-screen, and there is still a vulnerability in peeping attacks. In this paper, the entire keypad is divided into several groups and displayed on a small screen, touching the group to which the character to be input belongs, and then touching the corresponding character within the group. The proposed method selects the group to which the character to be input belongs, and displays the keypad in the group on a small screen with no more than 10 keypads, so that the size of the keypad can be enlarged more than twice compared to the existing method, and the location is randomly placed, hence location of the touch attacks can be blocked.

• Journal of KIISE:Information Networking
• /
• v.31 no.6
• /
• pp.566-572
• /
• 2004

In this paper, we define the secure authentication model to provide a mobile node with global roaming service and integrate the Fast Handoff scheme with our approach to minimize the service latency. By starting the AAA(Authentication, Authorization and Account) procedure with Fast Handoff simultaneously when a roaming occurs, authentication latency is reduced significantly and provision of fast and seamless service is possible. The previous works such as IPsec(Internet Protocol Security), RR (Return Routability) and AAA define the procedures performed after the completion of Layer2 Handoff which leads us to study a way of providing the real time and QoS guaranteed service during this period. The proposed scheme is for this goal and when appling it to roaming environment it shows the cost reduction up to 55% and 17% for the case of the MN receiving the FBACK and not respectively before L2 Handoff occurs.

• Review of KIISC
• /
• v.26 no.4
• /
• pp.41-46
• /
• 2016

전통적으로 바이오인식기술은 출입국심사(전자여권, 승무원 승객 신원확인), 출입통제(도어락, 출입통제 근태관리), 행정(무인민원발급, 전자조달), 사회복지(미아찾기, 복지기금관리), 의료(원격의료, 의료진 환자 신원확인), 정보통신(휴대폰 PC 인터넷 인증), 금융(온라인 뱅킹, ATM 현금인출) 등 다방면에서 폭넓게 보급되어 실생활에서 널리 활용되고 있다. [그림1]은 신체적 특징(Physiological biometrics)과 행동적 특징(Behavioral biometrics)을 이용한 사용자 인증기술인 바이오인식기술의 유형과 함께 각 기술별 보안취약점(괄호 안 빨강색글자)을 나타내고 있다. 최근 들어, 모바일 지급결제서비스 ATM 인출기 인터넷전문은행 등과 같은 핀테크 분야에서 비대면 인증기술로 바이오인식기술이 각광을 받기 시작했다. 한편, 가짜지문 등 기존의 신체적 특징을 이용한 바이오인식기술의 위변조 위협에 대한 우려 존재함에 따라 뇌파 심전도 근전도 맥박 등 살아있는 사람의 행동적(신체의 기능적) 특징을 이용한 생체신호를 이용하여 비대면 인증기술로서 활용하기 위하여 주요 선진국에서 차세대 바이오인식 기술개발이 가속화되고 있는 추세이다.[1] 또한, 이러한 생체신호는 최근에 삼성전자, LG전자, 애플 등에서 스마트워치를 통해 심장박동수를 측정하고 스마트폰을 통하여 모바일 지급결제, 헬스케어 등과 같은 IoT 모바일 융복합 응용서비스에 활용될 전망이다. 본고에서는 뇌파 심전도(심박수)와 같은 생체신호를 측정하는 스마트워치 밴드형 의복형 또는 패치형태의 웨어러블 디바이스와 같은 생체신호센서, 생체신호 인증기술 및 관련표준화 동향을 고찰해 보기로 한다. 국내외 관련기술과 표준화 동향을 면밀히 분석하여 지난 2015년 5월29일에 발족한 국내외 전문가그룹인 KISA"모바일 생체신호 인증기술 표준연구회"(이하 KISA 표준연구회)가 구심점이 되어 한국형 생체신호를 이용한 차세대 텔레바이오인식기술에 대한 연구개발과 국내외 표준화 추진에 박차를 가할 계획이다.

• The Journal of Sustainable Design and Educational Environment Research
• /
• v.22 no.2
• /
• pp.1-16
• /
• 2023

This paper reports on three Delphi surveys based on draft evaluation items with the aim of deriving evaluation items prior to developing a BF certification index for school facilities in order to make the index safe and convenient. To this end, problems were formulated using content analysis and follow-up evaluation of existing BF certification indicators. Draft BF certification evaluation items for school facilities were proposed. The adequacy of each evaluation item was verified using a Delphi survey. Experts and working-level groups, such as university professors, architects, public officials, certification agencies, and organizations for disabled persons, provided feedback for all evaluation items for school facility BF, which was incorporated in the final evaluation items. As a result of the Delphi surveys, in addition to the existing 8 evaluation items, a total of 75 evaluation items were proposed as maintenance items, 12 as improvement review items, and 15 as new evaluation items.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.6
• /
• pp.75-85
• /
• 2010

This paper presents a robust 3D model hashing based on object feature vector for 3D content authentication. The proposed 3D model hashing selects the feature objects with highest area in a 3D model with various objects and groups the distances of the normalized vertices in the feature objects. Then we permute groups in each objects by using a permutation key and generate the final binary hash through the binary process with the group coefficients and a random key. Therefore, the hash robustness can be improved by the group coefficient from the distance distribution of vertices in each object group and th hash uniqueness can be improved by the binary process with a permutation key and a random key. From experimental results, we verified that the proposed hashing has both the robustness against various mesh and geometric editing and the uniqueness.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.97-106
• /
• 2015

Recently, research on database encryption for data protection and query result authentication methods has been performed more actively in the database outsourcing environment. Existing database encryption schemes are vulnerable to order matching and counting attack of intruders who have background knowledge of the original database domain. Existing query result integrity auditing methods suffer from the transmission overhead of verification object. To resolve these problems, we propose a group-order preserving encryption index and a query result authentication method based on the encryption index. Our group-order preserving encryption index groups the original data for data encryption and support query processing without data decryption. We generate group ids by using the Hilbert-curve so that we can protect the group information while processing a query. Finally, our periodic function based data grouping and query result authentication scheme can reduce the data size of the query result verification. Through performance evaluation, we show that our method achieves better performance than an existing bucket-based verification scheme, it is 1.6 times faster in terms of query processing time and produces verification data that is 20 times smaller.

• The Journal of Society for e-Business Studies
• /
• v.9 no.1
• /
• pp.209-220
• /
• 2004

If protocol has fast operations and short key length, it can be efficient user authentication protocol. Lenstra and Verheul proposed XTR. XTR have short key length and fast computing speed. Therefore, this can be used usefully in complex arithmetic. In this paper, to design efficient user authentication protocol we used a subgroup of Galois Field to problem domain. Proposed protocol does not use GF(p/sup 6/) that is existent finite field, and uses GF(p²) that is subgroup and solves problem. XTR-ElGamal based user authentication protocol reduced bit number that is required when exchange key by doing with upside. Also, proposed protocol provided easy calculation and execution by reducing required overhead when calculate. In this paper, we designed authentication protocol with y/sub i/ = g/sup b.p/sup 2(i-1)//ㆍv mol q, 1(equation omitted) 3 that is required to do user authentication.