Earticle

디지털 영상매체의 특성상 데이터 접근 용이성에 따른 복제 및 변형, 손상, 휘발성 등의 위험이 발생하고 있어 안전하게 보존하는 방법에 대한 연구가 필요하다. 단방향암호화 해시함수를 활용하여 뉴미디어 영상작품의 무결성검증방법 적용연구를 진행하였으며, 이를 바탕으로 영상 장기 보존의 기초자료를 구축하고자 하였다. 해시함수는 임의의 길이를 가진 데이터를 입력받아 고정된 길이의 값, 즉 해시값을 생성하는 함수를 의미하며 데이터에 따라 해시값이 달라지는 특징이 있다. 이를 활용하여 초기값과 현재의 값을 비교하여 데이터 생성 이후 위변조 없이 그대로의 상태를 유지 하고 있는 무결성을 판단하는 데 활용할 수 있다. Microsoft가 개발한 기본 프로그램인 Windows Powershell을 이용하여 해시값을 생성하였으며 해시함수로 SHA(Secure Hash Algorithm)-256을 사용 하였다. 해시함수 적용 여부를 판단하기 위해 실험을 진행하였으며, 실험결과, 변형 및 손상유형에 따른 해시값 변화, 해시 생성시간, 다수의 파일 해시값 생성 결과를 통해 작품 적용 가능성을 확인할 수 있었고 빠르게 손상 여부 판단이 가능하였다. 추후 주기적인 검사를 통해 해시값을 비교하면 무결성검증 뿐만 아니라 파일 포맷 또는 저장매체의 상태변화까지 확인할 수 있을 것으로 기대된다.

Due to the characteristic of digital video media, there are risk of copying, deformation, damage, and volatility due to ease of access to data, so research on how to safely preserve it is necessary. A study was conducted to apply integrity verification method of new media video using one-way encryption hash function, and based on this, basic data for long-term image preservation were established. The hash function refers to a function that generates data with any length of a fixed length, and the hash value of a fixed length, and the hash value is different depending on data. This can be used to compare the initial value with the current value to determine the integrity of maintaining the state without forgery and alteration after data generation. The hash value was generated using Windows Powershell, a basic program developed by Microsoft, and SHA (Secure Hash Algorithm)-256, was used as a hash function. An experiment was conducted to determine whether the hash function was applied. As a result of the experiment, the applicability of the work was confirmed through hash value changes according to deformation and damage type, hash generation time, and multiple file hash value generation results, and it was possible to quickly determine whether or not there was damage. By comparing hash values through periodic inspection in the future, it is expected that not only integrity verification but also changes in the status of the file format or storage medium can be confirmed.

기존의 웹 인증방식은 주민등록번호를 이용하여 신용평가회사의 실명확인 데이터베이스를 통해서 인증 방식 과 주민등록번호를 이용한 인증 방식을 개선한 대체인증 수단인 아이핀 인증방식 등이 있다. 기존 인증 방식을 개선 하여 모든 웹에서 이용할 수 있는 통합 ID 인증 프로토콜을 제안한다. 제안한 인증 방식은 안전성을 높이기 위해서 사용자 검증값을 암호화하여 인증기관의 데이터베이스에 고유 식별번호로 저장한다. 그리고 해당 웹에 로그인하기 위 해 필요한 패스워드는 일회용 난수를 인증기관으로부터 수신하기 때문에 사용자가 패스워드를 따로 기억할 필요가 없고 스마트폰을 사용하여 난수를 수신한다. 웹은 데이터베이스에 사용자의 개인정보를 저장하지 않기 때문에 개인정 보 관리가 용이하며 사용자에게는 통합 ID 하나만 기억하고 매번 일회성 난수를 패스워드로 발급받아 여러 ID와 패 스워드를 기억하고 관리하지 않아도 되는 편리성을 제공해 준다.

Existing Web authentication method utilizes the resident registration number by credit rating agencies separating i-PIN authentication method which has been improved authentication using resident registration number via the real name confirmation database. By improving the existing authentication method, and it provides the available integrated ID authentication on Web. In order to enhance safety, the proposed authentication method by encrypting the user of the verification value, and stores the unique identifier in the database of the certificate authority. Then, the password required to log in to the Web is for receiving a disposable random from the certificate authority, the user does not need to remember a separate password and receives the random number by using the smart phone. It does not save the user's personal information in the database, and it is easy to management of personal information. Only the integration ID needs to be remembered with random number on every time. It doesn’t need to use various IDs and passwords if you use this proposed authentication methods.

인터넷을 이용한 전자상거래 및 금융 분야가 활성화되어 사용자와 서비스 제공자들 간의 상호 인증이 매우 중요해졌다. ID와 패스워드 기반의 인증은 보안성이 낮기 때문에 일회용 패스워드 인증방식이 많이 사용되고 있다. 기존의 일회용 패스워드 인증방식인 S/Key 인증방식은 평문 전송 외에 여러 문제점이 있고, 김홍기 등의 방식은 세 션 키의 생성 및 분배 방법에 관한 제시가 없다는 문제점이 있다. 본 논문에서는 이러한 문제점을 해결하기 위한 프 로토콜을 제안하였다.

With the active Internet e-commerce and the financial sector, mutual authentication between users and service providers has become very important. Because ID- and password-based authentication is of low security, one-time password authentication methods are widely used. The existing one-time password authentication scheme of S/Key authentication method is fraught with a number of issues in addition to plain text transmission, and the method of Kim Gong-ki et al. does not offer suggestions for session key generation and distribution method. Proposed in this paper is a protocol that solves these problems.

방문 측정 방식은 많은 방문자, 서버들 그리고 서버들에 의해 처리되는 방문자의 정보를 수집하는 감사 기 관으로 구성된다. 많은 효율적이고 안전한 방문 측정 방식들이 문헌상에 제안되어 있지만, 이들은 방문자의 프라이버 시 문제를 고려하고 있지 않다. 관련 연구에서의 이러한 제약을 완화하기 위하여, 인터넷상의 방문자의 프라이버시를 보호하는 방문 측정 방식을 제안하고자 한다. 좀 더 구체적으로, 방문자와의 감사 기관 사이에 RSA 기반 blind signature를 적용하였다. 만일 방문자가 2회 이상의 방문 정보를 서버에 보내게 되는 경우, 서버나 감사 기관에 의해 방문자의 신분은 드러나게 된다.

Metering scheme is composed of servers, clients, and an audit agency who collects the information for the clients which have been processed by servers. Although many efficient and secure metering schemes have been proposed in the literature, they do not consider the client privacy issue. To mitigate this limitation of the related work, we propose a metering scheme to protect the privacy of clients in internet. More specifically, we apply RSA based blind signature to the interaction between client and audit agency. If a client spends metering information to the server more than twice, the identity of the client is revealed by the server or audit agency.

A new hash algorithm with private key is proposed based on chaotic‐mapping, by reshaping a piece‐wise linear chaotic mapping. This algorithm based on the cipher block chain mode makes the iteration initial point as the private key, encrypts arbitrary length plaintext data to 128 bits hash value. The proposed algorithm encrypts multi‐bit at one time, which reduces the chaotic iterating times and improves the encryption speed. Through theoretical analysis and simulation results, the proposed hash function could satisfy the requirements of unidirectionality, initial value and key sensitivity, anti‐collision and real time, which could be applied to the identity authentication conveniently, safely and efficiently.

RFID 태그 검색 프로토콜에서는 모바일 리더가 특정 태그를 찾기 위해 무선통신이 불가능한 지역에 가게 되었을 경우, 백-엔드-데이터베이스를 대신해서 특정한 태그의 검색이 가능해야한다. 또한 RFID 검색 프로토콜에서는 사용자가 태그가 아닌 모바일 리더를 소지하기 때문에 모바일 리더 사용자의 프라이버시가 고려되어야 한다. Tan 등에 의해 최초로 제안된 RFID 검색 프로토콜들은 모바일 리더의 ID 값을 공개된 형식으로 전송하기 때문에, 모바일 리더 소지자의 프라이버시에 심각한 문제가 발생할 수 있다. 본 논문에서는 이러한 문제를 해결하여, 모바일 리더 사용자의 프라이버시를 제공함과 동시에, 통신라운드의 횟수도 함께 개선한 향상된 RFID 태그 검색 프로토콜을 제안한다.

In RFID tag search system, handheld reader should search the specific tag without help of the back-end-database even though the handheld reader cannot connect with the back-end-database because of unreliable wireless connection or remote location. In addition, in RFID tag search system, the privacy of mobile users should be considered because users hold not the tag but the mobile reader. RFID tag search protocols were firstly discussed by Tan et al. can cause serious problem to the privacy of mobile reader users because the reader identifier is openly transferred. In this paper, we proposed a improved RFID tag search protocol that provides the privacy of mobile reader user by solving this problem and at the same time, also improves the number of communication rounds.

최근 소셜 네트워크 서비스가 폭발적으로 증가하면서 빅데이터 분석 연구가 많이 진행되고 있 다. 이 중, 해쉬함수를 이용해서 빅데이터를 분석하는데 주로 이용되는 최소 완전 해쉬함수(MPHF) 방법은 이론적으로는 해쉬충돌이 일어나지 않지만 실제로 사용하면 잦은 충돌 문제가 발생한다. 이로 인해서 빅데이터 분석시간이 길어진다. MPHF의 단점이며 데이터의 양에 관계없이 해쉬 충돌이 일어 나지 않도록 하기위해서 본 논문에서는 해쉬함수를 병렬화에 있어서 Heuristic 알고리즘을 적용하여 해쉬 인덱스를 최적화하는 방안을 제안한다. 실험 부분에서는 본 제안방법의 착안점에 따른 우수성을 기존의 방법과 비교하여 보여준다.

According to explosive increase of social network service (SNS), big data analysis methods have been developed by many researchers. Out of the methods, Minimal Perfect Hash Function has been used in big data analysis. The method sometimes cause a hash collision in real applications and results in more analysis time. In order to solve the problem, we propose a Collision Free Indexing algorithm using parallel hash function. For developing our method, we optimize hash index by applying a heuristic concept. In the experimental section, we show an outperformance of out method comparing with an existing method.

During the past time information on internet increasing enormously which greed the attacker and invite them for attack. In order to provide protection from illegal access the concept of Intrusion Detection System (IDS) is introduced. Intrusion detection system recognized as a powerful tool for identifying malicious attacks over the network. IDS works on the concept of string matching with the help of Detection engine. Detection engine of IDS uses String matching algorithm for comparing against malicious activities. This comparison takes enough processing time nearly 70% of the whole IDS processing time by improving performance of searching algorithm. In this paper, we proposed an enhanced version of Hash-Boyer-Moore-Horspool string matching algorithm by adding a single digit hash function for reduced the number of character comparisons and improve the efficiency of IDS by reducing the number of false positive match.

Recently, the use of RFID(Radio Frequency Identification) for object identification is used more often, but the tag collision problem by the use of a radio frequency still exists. Therefore, in this paper, we analyzed tag identification time to minimize tag collisions and improve tag identification time by applying various tag anti-collision algorithms in the suggested method. As a result, we drew a conclusion about the number of optimum readers used in the RFID system environment. Significantly, we expect that the suggested method will be used more efficiently in the simultaneous multi-tags identification RFID system environment.

본 논문에서는 이동성을 지원하는 NEMO(NEwork MObility)와 네트워크 기반의 PMIPv6(Proxy Mobile IPv6) 가 결합된 유·무선 통합 네트워크 환경에서 보안을 강화하고 암호계산과 인증지연 비용을 줄이는 가벼운 키 베이스 의 SK-L2AS(Symmetric Key-Based Light-Local Authentication Scheme)인증기법을 제안한다. 또한 PMIPv6에서 핸드 오 버 지연 단축을 위해 빠른 핸드오버 기법을 적용하였고, 지원되지 않는 전역 이동성을 지원하기 위해 X-FPMIPv6(eXtension of Fast Handover for PMIPv6)으로 확장 개선하였다. 더불어, 인증과 시그널링의 신호 부담을 줄이기 위해서 Piggybacks 방식을 적용하여 SK-L2AS과 X-FPMIPv6을 통합한 AX-FPMIPv6 (Authentication eXtension of Fast Handover for PMIPv6)을 제안한다. 본 논문에서 제안한 AX-FPMIPv6 기법은 성능분석 결과 인증과 핸드오버 지연에서 기존 기법에 비해 성능이 우수하다는 것을 보여준다.

This paper reinforced security under the network evaluation of wire·wireless integration of NEMO (NEwork MObility) supporting mobility and network-based PMIPv6 (Proxy Mobile IPv6). It also proposes SK-L2AS (Symmetric Key-Based Local-Lighted Authentication Scheme) based on simple key which reduces code calculation and authentication delay costs. Moreover, fast handover technique was also adopted to reduce handover delay time in PMIPv6 and X-FPMIPv6 (eXtension of Fast Handover for PMIPv6) was used to support global mobility. In addition, AX-FPMIPv6 (Authentication eXtension of Fast Handover for PMIPv6) is proposed which integrated SK-L2AS and X-FPMIPv6 by applying Piggybacks method to reduce the overhead of authentication and signaling. The AX-FPMIPv6 technique suggested in this paper shows that this technique is better than the existing schemes in authentication and handover delay according to the performance analysis.

2012년 해시함수와 리더의 난수를 이용하여 RFID 시스템에서의 다양한 보안상 문제점을 해결한 APSR(An Authentication Protocol for the Security of RFID Tags and Readers using Random Number)[7] RFID 인증 프로토콜이 제안되었다. APSR을 제안한 저자는 안전성 분석을 통하여 제안한 RFID인증 프로토콜이 위치 추적을 포함한 다양한 공격들에 안전함을 증명하였다. 그러나 그의 주장 과는 달리 보안상 다양한 공격에 취약한 문제점이 있다. 본 논문에서는 공격 시나리오를 통하여 APSR RFID 인증 프로토콜의 문제점을 증명하고 이를 해결하기 위해 개선된 프로토콜을 제안한다.

In 2012, APSR(An Authentication Protocol for the Security of RFID Tags and Readers using Random Number)[7] RFID Authentication protocol using Hash function and random number is proposed to resolve a variety of problem related to security in RFID system. The author who proposed APSR proved that proposed protocol was safe for a variety of attacks including location tracking through safety analysis. However, unlike his claims there are problem which is vulnerable to various attacks on the security. In this paper, we prove the problem of the proposed APSR RFID authentication protocol through attack scenario and also propose improved an Hash-based RFID authentication protocol using pseudo random number to solve problem of APSR.

2010년 Lee-Jun이 제안한 모바일 RFID를 위한 보안 RFID 상호인증 프로토콜은 상호인증 기법과 해시함수를 이용하여 RFID 시스템의 다양한 문제점을 해결하였다고 주장하였다. 그러나 그들의 주장 과는 다르게 위치 추적에 방어하고자 사용된 Temp를 이용한 스푸핑, 재전송 공격에 취약함을 증명한 다. 그리고 본 논문에서는 OTP(One-Time Pad)를 이용하여 Lee-Jun 프로토콜의 취약점을 보안한 프로토콜을 제안하고, RFID 프로토콜의 정형적 비교분석을 통해 Lee-Jun 프로토콜에 비해 효율성, 보안성 측면에서 우수함을 보인다.

In 2010, Lee-Jun proposed protocol of making one-time random number in DB server side unlike previously researched protocol, and it protects RFID communication from location tacking, replay attack and spoofing attack. However, this paper demonstrates that Lee-Jun protocol still insecure to the replay attack and spoofing attack. In addition, we propose the protocol which is safe using OTP(One-Time Pad). Our protocol is shown safe and efficient by comparative analysis.

Hash functions are one of the most important cryptographic primitives. Some of the currently employed hash functions like SHA-1 or MD5 are considered broken today. Therefore, in 2007 the US National Institute of Standards and Technology announced a competition for a new family of hash functions. Keccak is one of the five final candidates to be chosen as SHA-3 hash function standard. In this paper, we present an implementation of the Keccak hash function family on graphics cards, using NVIDIA’s CUDA framework. Our implementation allows to choose one function out of the hash function family and hash arbitrary documents. In addition we present the first ready-to-use implementation of the tree mode of Keccak which is even more suitable for parallelization.

Whirlpool hash function should be capable of processing the input data streams at high speeds. We propose a fully synchronous parallel pipelined architecture with ten stages of pipelining between rounds, and internal pipelining within each round stage. The proposed architecture can tremendously improve the performance of Whirlpool hash function. Our final implementation can encrypt continuous bit streams seamlessly, achieving a throughput of 56.89 G bps, which is considerably high compared to existing implementations in literature.

Quantum authentication protocol can be used to authenticate classical messages in a secure manner. In this paper, by using the cryptographic hash function and non-orthogonal qubits, a quantum authentication protocol of classical messages is proposed. In our protocol, the classical messages and their corresponding tags are encoded as nonorthogonal qubits. The message receiver decodes the classical messages and their corresponding tags from the received qubits by using the authentication key. To verify the validity of the received classical messages, the message receiver verifies whether the hash values of the decoded classical messages are equal to the corresponding tags. Our scheme can be proved to be secure against forgery attack and measurement attack. On the other hand, the authentication key is a binary string, which can be securely obtained and easily saved. What is more, because the authentication key remains secure after executing the authentication protocol, it provides the possibility of reusing the authentication key.

Quantum authentication protocols can be used to authenticate both quantum messages and classical messages. In this paper, a new quantum authentication protocol of classical messages is proposed. In our protocol, a sequence of Bell states is shared by the message sender and the corresponding receiver. This sequence is used as the authentication key. Four different unitary operations U0, U1, U2 and U3 are used to encode a classical message m and its hash value h(m) into a sequence of Bell states. To authenticate the classical message, the message receiver extracts m and h(m) from the qubits owned by himself/herself, and verifies whether h(m) matches m. The adversary’s disturbance to the quantum channel can be detected by checking whether h(m) matches m. The transmitted message has the properties of both secrecy and authentication. Our quantum authentication protocol is secure against message attack and no-message attack.

As a kind of accurate, rapid and real – time data acquisitions and processing technology, RFID can give unique identification to entity object, has been widely used in various industries, such as manufacturing, sales, transportation and so on. But with its widely application, many relevant problems, especially the safety issues of RFID system and the low cost issue of label have been raised more and more attention by people; therefore, a new and more appropriate security authentication protocol becomes necessary. In this paper, firstly introducing several now available security authentication protocols, and analyzing their strengths and drawbacks, then proposed a new authentication scheme based on Hash function, doing security properties and feasibility analysis of it in theory, and proving that the security properties of this scheme is more efficient, and it is more applicable to meet the needs of people through test at last.