Earticle

네트워크에서 데이터의 보안은 암호화에 의해 제공된다. 최근 영상이나 비디오와 같은 대용량의 데이터 파일의 암호화의 비용 및 복잡성을 줄이기 위한 방안으로 선택적 암호화가 제안되었다. 본 논문에서는 허프만 코딩으로 압축된 데이터의 암호화 방안을 제안하고 그 성능에 대해 논한다. 허프만 코드에 적용 가능한 단순한 선택적 암호화 방법을 제안하고 불안전한 채널에서 암호화 방법의 효율성에 대해 논의한다. 암호화 과정과 데이터 압축 과정이 하나로 결합될 수 있으며 그렇게 함으로서 데이터를 압축하고 암호화하는 과정을 간략화 하고 줄일 수 있다.

The security of data in network is provided by encryption. Selective is a recent ap-proach to reduce the computational cost and complexity for large file size data such as image and video. This paper describes techniques to encrypt Huffman code and discusses the performance of proposed scheme. We propose a simple encryption technique applicable to the Huffman code and study effectiveness of encryption against insecure channel. Our scheme combine encryption process and compression process, and it can reduce processing time for encryption and compression by combining two processes.

This paper presents the novel selective encryption algorithm for vector map protection for storage, transmission, distribution to authorized users. In proposed algorithm, we just select some values of polylines and polygons in DCT domain to encrypt by random algorithms and cryptography. Experimental results verified that proposed algorithm is effectively and security. Maps are changed whole after encryption process, and unauthorized users cannot access to copy or use them. Encrypted maps do not alter the size of file and not have loss accuracy. The error between original map and decrypted map is approximate zero.

With the rapid development of social network, more and more information is being presented in the form of multimedia, so the security of multimedia files, especially video files, has been capturing the attention of the researchers. Video encryption is widely applied to the DRM system, video conference, medical and military fields and so on. A general video encryption algorithm is proposed to solve the problem that the existing multiple formats (compression formats and container formats) of video requires a unified encryption scheme. Meanwhile, the proposed scheme can not only provide variable levels of security, but also have good performance of compression efficiency and computational complexity, which can ensure that the encrypted video data can be operation.

Three-dimensional (3D) printing is applied to many areas of life, but 3D printing models are stolen by pirates and distributed without any permission from the original providers. Moreover, some special models and anti-weapon models in 3D printing must be secured from the unauthorized user. Therefore, 3D printing models must be encrypted before being stored and transmitted to ensure access and to prevent illegal copying. This paper presents a selective encryption algorithm for 3D printing models based on clustering and the frequency domain of discrete cosine transform. All facets are extracted from 3D printing model, divided into groups by the clustering algorithm, and all vertices of facets in each group are transformed to the frequency domain of a discrete cosine transform. The proposed algorithm is based on encrypting the selected coefficients in the frequency domain of discrete cosine transform to generate the encrypted 3D printing model. Experimental results verified that the proposed algorithm is very effective for 3D printing models. The entire 3D printing model is altered after the encryption process. The decrypting error is approximated to be zero. The proposed algorithm provides a better method and more security than previous methods.

Recently, vector map data is developed and used in many domains widely. In the most cases, vector map data contains confidential information which must be kept away from unauthorized users. Moreover, the production process of vector maps is considerably complex and consumes a lot of money and human resources. Therefore, the secured storage and transmission are necessary to prevent the illegal copying and distribution from hacker. This paper presents a selective encryption algorithm using geometric objects in frequency domain for vector map data. In the proposed algorithm, polyline and polygon data in vector map is the target of the selective encryption process. Experimental results verified that proposed algorithm is effectively and adaptive the requirements of security.

Nowadays, geographic information system (GIS) is developed and implemented in many areas. A huge volume of vector map data has been accessed unlawfully by hackers, pirates, or unauthorized users. For this reason, we need the methods that help to protect GIS data for storage, multimedia applications, and transmission. In our paper, a selective encryption method is presented based on vertex randomization and hybrid transform in the GIS vector map. In the proposed algorithm, polylines and polygons are focused as the targets for encryption. Objects are classified in each layer, and all coordinates of the significant objects are encrypted by the key sets generated by using chaotic map before changing them in DWT, DFT domain. Experimental results verify the high efficiency visualization by low complexity, high security performance by random processes.

With the rapid interest in Geographic Information System (GIS) contents, a large volume of valuable GIS dataset has been distributed illegally by pirates, hackers, or unauthorized users. Therefore the problem focus on how to protect the copyright of GIS vector map data for storage and transmission. But GIS vector map data is very large and current data encryption techniques often encrypt all components of data. That means we have encrypted large amount of data lead to the long encrypting time and high complexity computation. This paper presents the selective encryption scheme using hybrid transform for GIS vector map data protection to store, transmit or distribute to authorized users. In proposed scheme, polylines and polygons in vector map are targets of selective encryption. We select the significant objects in polyline/polygon layer, and then they are encrypted by the key sets generated by using Chaotic map before changing them in DWT, DFT domain. Experimental results verified the proposed algorithm effectively and error in decryption is approximately zero.

With the rapid interest in Geographic Information System (GIS) contents, a large volume of valuable GIS dataset has been distributed illegally by pirates, hackers, or unauthorized users. Therefore the problem focus on how to protect the copyright of GIS vector map data for storage and transmission. At this point, GIS security techniques focusing on secure network and data encryption have been studied and developed to solve the copyright protection and illegal copy prevention for GIS digital map. But GIS vector map data is very large and current data encryption techniques often encrypt all components of data. That means we have encrypted large amount of data lead to the long encrypting time and high complexity computation. This paper presents a novel selective encryption scheme for GIS vector map data protection to store, transmit or distribute to authorized users using K-means algorithm. The proposed algorithm only encrypts a small part of data based on properties of polylines and polygons in GIS vector map but it can change whole data of GIS vector map. Experimental results verified the proposed algorithm effectively and error in decryption is approximately zero.

Objectives: The transmission of medical information is currently a daily routine. Medical information needs efficient, robust and secure encryption modes, but cryptography is primarily a computationally intensive process. Towards this direction, we design a selective encryption scheme for critical data transmission. Methods: We expand the advandced encrytion stanard (AES)-Rijndael with five criteria: the first is the compression of plain data, the second is the variable size of the block, the third is the selectable round, the fourth is the optimization of software implementation and the fifth is the selective function of the whole routine. We have tested our selective encryption scheme by C++ and it was compiled with Code::Blocks using a MinGW GCC compiler. Results: The experimental results showed that our selective encryption scheme achieves a faster execution speed of encryption/decryption. In future work, we intend to use resource optimization to enhance the round operations, such as SubByte/InvSubByte, by exploiting similarities between encryption and decryption. Conclusions: As encryption schemes become more widely used, the concept of hardware and software co-design is also a growing new area of interest.

Biometric-based authentication can provide a strong security guarantee of the identity of users. However, the security of biometric data is particularly important as any compromise of the biometric data will be permanent. In this paper, we propose a secure and efficient protocol to transmit fingerprint images from a fingerprint sensor to a client by exploiting the characteristics of the fingerprint images. Because the fingerprint sensor is computationally limited, a standard encryption algorithm may not be applied to the full fingerprint images in real-time to guarantee the integrity and confidentiality of the fingerprint images transmitted. To reduce the computational workload on the resource-constrained sensor, we apply the encryption algorithm to a nonce for integrity and to a specific bitplane of each pixel of the fingerprint image for confidentiality. Experimental results show that the integrity and confidentiality of the fingerprint images can be guaranteed without any leakage of the fingerprint ridge information and can be completed in real-time on embedded processors.

IP 셋톱박스에 서비스되는 콘텐츠는 IP 네트워크를 통하여 전송되므로 네트워크 해킹 도구를 이용하면 스트리밍되는 콘텐츠를 저장후 불법이용이 가능하다. 따라서 안전한 스트리밍 서비스를 위해서는 스트리밍 환경에 적합한 콘텐츠 보호 방법이 요구된다. 최근까지 스트리밍 서비스되는 콘텐츠는 MPEG-2 TS를 이용하였지만, 낮은 압축률과 TS 패킷의 높은 오버헤드때문에 현재는 WMV, MPEG-4, H.264로 점차 옮겨가고 있다. 본 논문은 스트리밍되는 윈도우 미디어 콘텐츠를 보호하기 위한 DRM을 제안한다. 제안하는 방법은 기존의 WMV 스트리밍 시스템에 비의존적으로 설계되어 기존의 스트리밍 환경에 적용이 용이하고, 사용자 기기의 성능을 고려하여 DRM 처리 시간을 조절할 수 있도록 선택적 암호화 기법을 제공한다. 본 논문에서는 실험을 통하여 선택적 암호화를 이용하여 DRM 처리시간을 감소시킬 수 있음을 보인다.

As content serviced for IP set-top boxes is streamed over IP network, the existing hacking tools for IP network can be used to capture the streamed content. Until recently, most of the content serviced on IP set-top boxes has been MPEG-2 TS. However, this content will be gradually moved to WMV, MPEG-4 or H.264 because of the relatively low compression efficiency and overhead of the TS packet. In this paper, we propose a DRM scheme other than WMRM for streamed WMV content. Our approach is to design a DRM scheme independent to the existing WMV streaming system. We also design this scheme in order to provide the feature for controlling the DRM processing time considering device performance. We verified it through the experiment.

It has been widely believed that one can obtain $\iota$-Hierarchical Identity Based Encryption (HIBE) scheme secure against chosen ciphetext attacks from ($\iota$+1)-HIBE scheme secure against chosen plaintext attacks. In this paper, however, we show that when applying two concrete HIBE schemes that Boneh et al. [1, 2] proposed, chosen ciphertext secure $\iota$-HIBE schemes are directly derived from chosen plaintext secure $\iota$-HIBE schemes. Our constructions are based on a one-time signature-based transformation that Canetti et at.[3] proposed. The security of our schemes is proved in the selective-ID suity model without using random oracles.

비트 값의 반전을 이용하여 정규 허프만 코드의 선택적인 암호화 방법을 제안하였다. 심벌들을 일정한 크기의 블록으로 나누어 블록안의 각 심벌들을 정규 허프만 코딩으로 압축한다. 블록별로 원 코드로 보낼 것인지 암호화하여 보낼것인지 결정하고 암호화 블록은 전제 비트들의 값을 반전시키고 암호화하지 않는 블록들은 원 코딩 데이터를 암호화 정보와 함께 전송한다. 수신측에서 압축된 데이터를 암호화 정보를 이용하여 해독가능하다.

The selective encryption scheme for canonical Huffman codes using the inversion of bit values is proposed. The symbols are divided into blocks of a certain size, and each symbol in the block is compressed by canonical Huffman coding. Blocks are determined to be sent in the original code or encrypted form. The encryption block inverts the values of the whole bits, and bits of block that do not encrypt are not inverted. Those compressed data are transmitted with the encryption information. It is possible to decrypt the compressed data on the receiving side using the encryption information and compressed data.

환자의 신변보호를 위하여 의료 영상에 비인가 된 사용자의 접근을 제한하는 것은 필수적이다. 본 논문에서는 의료 영상의 접근 제어를 위한 관심 영역(ROI, Region of Interest) 기반의 선택적 암호 기법들을 제안한다. 첫 번째 제안 기법은 웨이블릿 서브밴드들 중 관심영역에 속한 계수의 비트를 랜덤하게 변경하여 암호화를 수행하며, 이미지의 압축과 암호화가 동시에 수행되고 암호화로 인한 압축률에 대한 손실이 적은 특징을 가진다. 두 번째 제안 기법은 안전성의 향상을 위하여 압축된 코드스트림의 관심 영역에 대칭키 기반 암호 알고리즘을 적용하며, 암호화 과정에서 압축률에 영향을 미치지 않는 특징이 있다. 또한 제안 기법들은 JPEG2000의 코드스트림 표준 디코더와 호환성을 제공한다.

For the patients' privacy, secure access control of medical images is essentially necessary. In this paper, two types of Region of Interest (ROI)-based selective encryption schemes are proposed, which concentrate on the security of crucial parts in medical images. The first scheme randomly inverts the most significant bits of ROI coefficients in several high frequency subbands in the transform domain, which only incurs little loss on compression efficiency. The second scheme employs a symmetric key encryption to encrypt selectively the ROI data in the final code-stream, which provides sufficient confidentiality. Both of two schemes are backward compatible so as to ensure a standard bitstream compliant decoder so the encrypted images can be reconstructed without any crash.

21세기를 맞이하면서 정보통신기술의 발전과 인터넷 이용 확산 등으로 사용자 인증이 중요한 문제로 대두되고 있으며, 보다 강력한 사용자 인증을 위하여 생체인식 기술의 연구가 활발히 진행되고 있다. 그러나 사용자 인증을 위한 생체정보가 타인에게 도용된다면 패스워드나 PIN과 달리 변경이 불가능하므로 심각한 문제를 일으킨다. 본 논문에서는 센서에서 획득된 지문영상을 클라이언트로 안전하게 전송하는 프로토콜을 제안한다. 특히, 계산능력이 부족한 임베디드 프로세스를 내장한 지문센서에서 지문영상을 실시간으로 암호화하기 위하여 지문영상 전체를 암호화하는 대신, 지문영상의 특정 비트 평면만을 암호화하는 부분암호화 알고리즘을 제안한다. 일반적인 부분암호화 방법에서 사용되어지는 최상위 비트 평면으로 부분암호화를 착 경우 간단한 공격으로 지문의 융선정보를 알 수 있기 때문에 지문인식 시스템에 공격이 가능한 문제점이 있다. 본 논문에서는 이러한 문제를 해결하기 위하여, 최상위 비트정보 대신 최하위 비트정보를 이용하는 개선된 선택적 비트 평면 암호화 방법을 사용하였다. 제안된 알고리즘의 성능을 분석하기 위해 16비트 임베디드 프로세서를 가진 지문센서를 개발하고 부분암호화 방법을 구현한 결과, 기밀성 보장 및 실시간 처리가 가능함을 확인하였다.

Biometric-based authentication can provide strong security guarantee about the identity of users. However, security of biometric data is particularly important as the compromise of the data will be permanent. In this paper, we propose a secure and efficient protocol to transmit fingerprint images from a fingerprint sensor to a client by exploiting characteristics of fingerprint images. Because the fingerprint sensor is computationally limited, however, such encryption algorithm may not be applied to the full fingerprint images in real-time. To reduce the computational workload on the resource-constrained sensor, we apply the encryption algorithm to a specific bitplane of each pixel of the fingerprint image. We use the LSB as specific bitplane instead of MSB used to encrypt general multimedia contents because simple attacks can reveal the fingerprint ridge information even from the MSB-based encryption. Based on the experimental results, our proposed algorithm can reduce the execution time of the full encryption by a factor of six and guarantee both the integrity and the confidentiality without any leakage of the ridge information.

최근 데이터베이스 보안을 위한 다양한 암호화 방법이 제안되고 있다. 이러한 암호화 방법들은 사용자의 민감한 데이터를 효과적으로 보호할 수 있지만 데이터베이스 질의어에 대한 검색 성능이 저하된다. 본 논문에서는 이러한 단점을 보완하기 위하여 블룸필터에서의 선택적 요소 단위의 암호화 방식을 제안하였다. 그리고 다수의 질의어를 통하여 기존에 제안된 튜플 암호화 방식과 성능을 비교하였다. 결과적으로 민감한 정보에 대하여 요소 암호화 방법을 적용하고, 이에 대한 인덱스로서 블룸필터를 사용한 제안 방식이 기존에 제안된 방식보다 검색 시간이 매우 빠르게 나타남을 알 수 있다.

There are a lot of encryption methods to secure database proposed recently. Those encryption methods can protect the sensitive data of users effectively, but it deteriorates the search performance of database query. In this paper, we proposed the selective element encryption method in order to complement those drawbacks. In addition, we compared the performance of the proposed method with that of tuple level encryption method using the various queries. As a result, we found that the proposed method, which use the selective element encryption with bloom filter as a index, has better performance than the other encryption method.