Earticle

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.

Traditional block cipher Advanced Encryption Standard (AES) is widely used in the field of network security, but it has high overhead on each operation. In the 15th international workshop on information security applications, a novel lightweight and low-power encryption algorithm named low-power encryption algorithm (LEA) was released. This algorithm has certain useful features for hardware and software implementations, that is, simple addition, rotation, exclusive-or (ARX) operations, non-Substitute-BOX architecture, and 32-bit word size. In this study, we further improve the LEA encryptions for cloud computing. The Web-based implementations include JavaScript and assembly codes. Unlike normal implementation, JavaScript does not support unsigned integer and rotation operations; therefore, we present several techniques for resolving this issue. Furthermore, the proposed method yields a speed-optimized result and shows high performance enhancements. Each implementation is tested using various Web browsers, such as Google Chrome, Internet Explorer, and Mozilla Firefox, and on various devices including personal computers and mobile devices. These results extend the use of LEA encryption to any circumstance.

To improve the security of gene information and the accuracy of matching, this paper designs a homomorphic encryption algorithm for gene matching based on cloud computing environment. Firstly, the gene sequences of cloud files entered by users are collected, which are converted into binary code by binary function, so that the encrypted text is obviously different from the original text. After that, the binary code of genes in the database is compared with the generated code to complete gene matching. Experimental analysis indicates that when the number of fragments in a 1 GB gene file is 65, the minimum encryption time of the algorithm is 80.13 ms. Aside from that, the gene matching time and energy consumption of this algorithm are the least, which are 85.69 ms and 237.89 J, respectively.

Our approach permits to capitalize the expert's knowledge as business rules by using an agent-based platform. The objective of our approach is to allow experts to manage the daily evolutions of business domains without having to use a technician, and to allow them to be implied, and to participate in the development of the application to accomplish the daily tasks of their work. Therefore, the manipulation of an expert's knowledge generates the need for information security and other associated technologies. The notion of cryptography has emerged as a basic concept in business rules modeling. The purpose of this paper is to present a cryptographic algorithm based approach to integrate the security aspect in business rules modeling. We propose integrating an agent-based approach in the framework. This solution utilizes a security agent with domain ontology. This agent applies an encryption/decryption algorithm to allow for the confidentiality, authenticity, and integrity of the most important rules. To increase the security of these rules, we used hybrid cryptography in order to take advantage of symmetric and asymmetric algorithms. We performed some experiments to find the best encryption algorithm, which provides improvement in terms of response time, space memory, and security.

Wireless sensor networks are susceptible to a variety of network attacks. Due to the limited energy of nodes and selfish nodes in the network, the packet delivery rate is lower. To address these issues, we innovatively propose an energy-harvesting Q-learning secure routing algorithm with authenticated-encryption. The algorithm uses physical unclonable functions and optimized Q-learning to ensure that the transmission path is reliable. Meanwhile, we combine the LSTM-based prediction model to predict the energy value that the nodes replenish. In addition, simulations are performed to compare the performances of the proposed algorithm with other algorithms under different attacks. The proposed algorithm has greater improvements in the packet delivery rate, filtering selfish nodes, and reducing node energy consumption.

This With the expansion of information and communication technology, the term ubiquitous computing is a known concept used to describe the current era of interconnected digital systems, which is silently posing a new threat to private information leakage through encryption applications. This work aims to acquaint individuals with the privacy information forms of expression in networking technology and then proposes secure multi-party computation to achieve personal information protection. This work emphasizes that, for the time being, homomorphic computing research approaches privacy in ubiquitous environments without considering the various aspects and fundamental principles of privacy. Finally, this work highlights the need for multidisciplinary research in the area and the importance that homomorphic computing algorithm research receives input from other related disciplines, such as law and psychology. This research aims to contribute to the ongoing discourse on the nature of privacy and its role in ubiquitous environments, providing insights for future research. Although research on privacy in the area of ubiquitous computing expands in many different directions and covers various topics, privacy issues are still open, and it appears that feasible and effective solutions are still quite far from being realized. A critical analysis of this research on privacy in ubiquitous environments reveals a significant shift: up to now, it has been the government's role to provide the framework for privacy protection. Homomorphic encryption is an encryption scheme that allows operations on encrypted data, and it can be applied in any system using various public key algorithms. When data is transferred to the public area, various encryption algorithms are used to secure both the operations and storage of the data. However, to process data located on a remote proxy server while preserving privacy, homomorphic encryption is crucial, especially for network-based operations.

As the rate of visual information interchange on the Internet increases, image encryption has become a key method to secure image information. Here, an efficient image encryption technique was investigated. It employed Genetic Algorithm (GA) and Secure Force Algorithm (SF), along with using chaotic maps' transpositions on bit-level to remove the deep correlations between pixels. This study examined the efficiency of the technique with respect to security analysis, using entropy, histogram, correlation, NPCR, UACI, and sensitivity tests. The obtained results were outstanding, the average entropy was 7.999 (theoretical value is 8). Besides that, the coefficient correlation was almost zero which means that plain and ciphered images have no relevance to each other. Ciphered image's histograms were fairly uniformed, confirming that ciphered images have no statistical resemblance to original images and making no suggestions about how to implement statistical attacks. Because the proposed cryptosystem is more stable in the face of prevalent attacks, it can be used for secure applications and secure communication.

빠르게 진화하는 정보 통신 기술로 인해서 새로 생성되는 데이터는 급속히 증가하고 있다. 센서, 스마트 폰, 소셜 네트워킹 사이트, 논리적 데이터 및 이니셔티브의 데이터가 이 엄청난 정보 폭발을 발생시키고 있다. Hadoop은 방대한 양의 데이터를 처리하는 데 사용되는 프레임워크이며 기업에서 중요한 정보를 저장하고 관리하 는데 많이 사용되고 있다. 또한, Hadoop은 분산형 파일 시스템으로 기능 및 보안 업데이트가 계속 진행되고 있다. 그러나 Hadoop은 민감한 데이터의 보안에 취약하다. 본 연구에서는 클라우드 시스템에 대한 보안 문제를 조사하 였다. 특히, 현재 클라우드 환경에서 사용할 수 있는 암호화 알고리즘을 조사하고 데이터 암호화 실험을 수행하였 다. 실험에서는 Salsa20, 3-DES, AES, MARS, Blowfish 등 총 6가지 알고리즘을 비교 하였고 논문에서 제안하 는 Salsa20을 사용하는 것이 최고 22%의 성능 향상이 있는 것을 확인하였다.

Data is rising tremendously in the rapidly evolving world of information and communications technology. Data from sensors, smartphones, social networking sites, logical data, and initiatives are fueling this enormous information explosion. Hadoop is a framework used to process vast amounts of data and is widely used by companies to store and manage important information. Additionally, Hadoop is a distributed file system, and feature and security updates are continuously being made. In this paper, encryption algorithms currently available in the cloud environment were investigated and data encryption experiments were conducted. In the experiment, a total of six algorithms, including Salsa20, 3-DES, AES, MARS, and Blowfish, were compared, and it was confirmed that using Salsa20 proposed in the paper improved performance by up to 22%.

공공기관 및 기업의 빅데이터 플랫폼 환경에서 데이터 보호를 위한 암호화는 필수적인 요소이나 실제 빅데이터 워크로드를 고려한 암호화 알고리즘에 대한 성능 검증 연구는 많이 진행되지 않았다. 본 논문에서는 몽고 DB(MongoDB) 환경에서 데이터와 노드를 추가하여 빅데이터의 6가지 워크로드별로 AES, ARIA, 3DES별로 성능 변화 추이를 분석하였다. 이를 통해 빅데이터 플랫폼 환경에서 각 워크로드 별 최적의 블록기반 암호 알고리즘이 무엇인지 확인하고, NoSQL 데이터베이스 벤치마크(YCSB)를 사용하여 데이터와 노드 구성환경에서 다양한 워크로드별로 테스트를 통해 MongoDB의 성능을 고려한 최적화된 아키텍처를 제안한다.

Although encryption for data protection is essential in the big data platform environment of public institutions and corporations, much performance verification studies on encryption algorithms considering actual big data workloads have not been conducted. In this paper, we analyzed the performance change of AES, ARIA, and 3DES for each of six workloads of big data by adding data and nodes in MongoDB environment. This enables us to identify the optimal block-based cryptographic algorithm for each workload in the big data platform environment, and test the performance of MongoDB by testing various workloads in data and node configurations using the NoSQL Database Benchmark (YCSB). We propose an optimized architecture that takes into account.

인터넷 사용 환경이 발전함에 따라 스마트폰과 각종 센서로부터 발생하는 대량의 데이터를 수집 및 분석하여 활용하는 데이터 기반 애플리케이션의 사용은 지난 10여 년간 폭발적으로 증가하였다. 그러나 이러한 사용자 데이터 기반의 애플리케이션을 사용하는 것은 언제든지 개인정보가 승인되지 않은 제3자에게 유출될 수 있다는 문제점을 내재하고 있다. 이러한 문제를 해결하기 위해 학자들은 데이터 교란과 암호화를 포함한 여러 기법을 사용해 왔다. 동형 암호는 암호화된 데이터를 복호화과정 없이 그대로 연산하더라도 결괏값이 보존되므로 원하는 연산을 수행할 때 개별 데이터를 복호화할 필요가 없어 기존의 방식보다 더 나은 개인정보보호를 제공한다. 본 연구에서는 개인정보를 보호하기 위해 사용되는 두 가지 알고리즘인 데이터 교란 방식과 전통 암호 방식 알고리즘을 구분하여 살펴보고, 두 가지 알고리즘의 단점을 보완할 수 있는 동형 암호를 이용한 데이터 수집 방법을 제안한다.

As the Internet environment develops, data-analysis-based applications have been widely and extensively used in the past decade. However, these applications potentially have a privacy problem in that users' personal information may be leaked to unauthorized parties. To tackle such a problem, researchers have suggested several techniques including data perturbation and cryptography. The homomorphic encryption algorithm is a relatively new cryptography technology that allows arithmetic operations for encrypted values as it is without decryption. Since original values are not required, we believe that this method provides better privacy protection than other existing solutions. In this work, we propose to apply a homomorphic encryption algorithm that protects personal information while enabling data analysis.

정보통신 기술 발전에 따른 데이터 보안 위협의 상승에 대비하기 위하여 유도탄 점검 장비에 저장된 자료의 안전성을 보장할 수 있는 기술은 중요하다. 이를 위하여 자료가 누출 되더라도 복원할 수 없게 데이터 저장 시 암호화를 수행하여야 하고, 해당 데이터를 복호화한 후에도 무결성이 보장되어야 한다. 본 논문에서는 데이터 저장 시 대칭키 암호시스템인 AES 알고리즘을 유도탄 점검장비에 적용하고, 각 AES의 각 비트 별 데이터 양에 따른 암호화 복호화 시간을 측정하였다. 또한 기존 점검 시스템에 AES Rijndael 알고리즘을 구현하여 암호화 수행으로 인한 영향을 분석하였고 제안한 암호화 알고리즘을 기존 시스템에 적용하는 것이 적합한지 확인 하였다. 용량별 / 알고리즘 비트수별로 분석한 결과 제안한 알고리즘 적용이 시스템 운용에 영향 없음을 확인하였고, 최적의 알고리즘을 도출할 수 있었다. 추가로 복호화 결과를 초기 데이터와 비교하였고, 해당 알고리즘이 데이터 무결성을 보장할 수 있음을 확인할 수 있었다.

In order to prepare for the rise of data security threats caused by the information and communication technology, technology that can guarantee the stability of the data stored in the missile test set is important. For this purpose, encryption should be performed when data is stored so that it cannot be restored even if data is leaked, and integrity should be ensured even after decrypting the data. In this paper, we apply AES algorithm, which is a symmetric key cryptography system, to the missile test set, and Encrypt and decrypt according to the amount of data for each bit of each AES algorithm. We implemented the AES Rijndael algorithm in the existing inspection system to analyze the effect of encryption and apply the proposed encryption algorithm to the existing system. confirmation of suitability. analysis of capacity and Algorithm bits it is confirmed that the proposed algorithm will not affect the system operation and the optimal algorithm is derived. compared with the initial data, we can confirm that the algorithm can guarantee data undulation.

DES는 64비트 단위로 나뉘어 진 각각의 블록이 한번의 암호화 알고리즘을 거쳐 암호화 된다. 대칭알고리즘으로서 똑같은 키와 알고리즘이 암호화와 복호화에 쓰인다. 복호화 할 때 키를 반대로 적용하는 등의 약간의 차이는 있다. 키 길이는 64비트로 표현되는데 이 중에서 실제로는 56비트만이 키로서 사용되고 나머지 8비트는 패리티 체크 비트로 사용된다. 암호화는 64비트 블록과 56비트 키를 바탕으로 만든 16개의 보조키가 총 16번의 혼돈과 확산을 거쳐 완료된다. DES 알고리즘을 선택한 이유는 암호 강도에 대한 의문이 제기되고 있기는 하지만 상업적으로 가장 널리 보급되어 이용되고 있다. 또한 기본 알고리즘을 DES 로 채택한 현장에서 앞으로도 상당한 기간 동안 이용이 계속될 것으로 예상되는 DES 알고리즘을 효과적으로 활용하는 방안이 현장에서 참고되기를 기대한다.

DES is a 64-bit binary, and each block is divided into units of time are encrypted through an encryption algorith m. The same key as the symmetric algorithm for encryption and decryption algorithms are used. Conversely, when decryption keys, and some differences may apply. The key length of 64 bits are represented by two ten thousand an d two 56-bit is actually being used as the key remaining 8 bits are used as parity check bits. The 64-bit block and 56-bit encryption key that is based on a total of 16 times 16 modifier and spread through the chaos is completed. D ES algorithm was chosen on the strength of the password is questionable because the most widely available comme rcially, but has been used. In addition to the basic DES algorithm adopted in the future in the field by a considerabl e period are expected to continue to take advantage of the DES algorithm effectively measures are expected to be in the field note

현재 M2M 환경은 다양한 서비스가 기관 및 기업이나 일상생활로 확대되면서 관련 기술의 보안 취약성 발생 가능성이 이슈화되고 있다. 본 논문은 이러한 보안 취약성 문제를 해결하기 위해 M2M 환경의 디바이스 키 보호를 위한 암호 알고리즘 응용 기법을 제안한다. 제안 기법은 타원곡선 암호 기반으로 초기 키 교환과 서명 교환을 통해 보안 세션을 생성하였고, 화이트박스 암호는 보안 세션 키를 이용하여 화이트박스 테이블을 생성하는 암호화에 응용하였다. 암호 알고리즘 적용 결과, 타원곡선 암호는 통신 세션에 대한 경량 화된 상호인증, 세션 키 보호를 제공하고, 화이트 박스 암호는 기존 암호 알고리즘과는 다른 방식으로 암호화에 사용되는 세션 키 보호를 보장하였다. 제안하는 프로토콜은 데이터변조 및 노출, 중간자 공격, 데이터 위조 및 변조 공격에 대해 안전한 장점이 있다.

With the diverse services of the current M2M environment being expanded to the organizations, the corporations, and the daily lives, the possibility of the occurrence of the vulnerabilities of the security of the related technologies have become an issue. In order to solve such a problem of the vulnerability of the security, this thesis proposes the technique for applying the cryptography algorithm for the protection of the device key of the M2M environment. The proposed technique was based on the elliptic curve cryptography Through the key exchange and the signature exchange in the beginning, the security session was created. And the white box cipher was applied to the encryption that creates the white box table using the security session key. Application results cipher algorithm, Elliptic Curve Cryptography provides a lightweight mutual authentication, a session key for protecting the communication session and a conventional white-box cipher algorithm and was guaranteed the session key used to encrypt protected in different ways. The proposed protocol has secure advantages against Data modulation and exposure, MITM(Man-in-the-middle attack), Data forgery and Manipulation attack.

Perceptual encryption (PE) is becoming popular for protecting image data as they are computationally inexpensive and retain certain image properties that are necessary for compression. PE methods not only provide security during transmission of image data but can also enable privacy-preserving computations on them. However, the presence of color information in the cipher image makes the existing PE algorithms vulnerable to jigsaw puzzle attacks. Therefore, this paper presents an extension of block-based PE methods that utilizes different keys for each color component when changing orientation of a block and pixel values in a block. Thus, offers better encryption performance as the color distribution of the original is changed significantly and the keyspace is expanded. The analysis on Tecnick dataset shows that the proposed PE method preserves compression performance of the existing methods while improving their encryption efficiency. In addition, the main advantage of the proposed method is that of being compatible with a widely used JPEG image standard, which makes it suitable for different outsourced multimedia applications such as, privacy-preserving deep learning, cloud-based photo storage, and social networking services.

최근 클라우드 컴퓨팅이 발전함에 따라 데이터베이스 아웃소싱에 대한 관심이 증가하고 있다. 그러나 데이터베이스 를 아웃소싱하는 경우, 데이터 소유자의 정보가 내부 및 외부 공격자에게 노출되는 문제점을 지닌다. 따라서 본 논 문에서는 프라이버시 보호를 지원하는 십진수 기반의 암호화 연산 프로토콜을 제안한다. 제안하는 프로토콜은 이진 수 기반의 암호화 연산 프로토콜과 달리 bit length 만큼 반복 연산을 수행하지 않기 때문에 연산의 효율성을 향상 시킨다. 아울러 십진수 기반의 암호화 연산 프로토콜을 이용한 kNN 질의처리 알고리즘을 제안한다. 제안하는 kNN 질의처리 알고리즘은 암호화 연산의 효율성을 향상시킨 십진수 기반의 프로토콜을 사용함으로써 높은 질의 처 리 성능을 제공한다. 한편 제안하는 알고리즘의 보안 분석을 수행하여, 데이터 보호, 질의 보호, 접근 패턴 보호를 지원함을 증명한다. 마지막으로 성능평가를 통해, 제안하는 kNN 질의처리 알고리즘이 기존 알고리즘에 비해서 약 5배의 질의처리 성능 향상이 있음을 보인다.

With the development of cloud computing, interest in database outsourcing has recently increased. However, when the database is outsourced, there is a problem in that the information of the data owner is exposed to internal and external attackers. Therefore, in this paper, we propose decimalbased encryption operation protocols that support privacy preservation. The proposed protocols improve operational efficiency compared to binary-based encryption operation protocols by eliminating the need for repetitive operations based on bit length. In addition, we propose a privacy-preserving kNN query processing algorithm using decimal-based encryption operation protocols. The proposed kNN query processing algorithm provides high query processing performance by utilizing efficient decimal-based protocols which enhance the efficiency of the encryption operations. Meanwhile, the security analysis of the proposed algorithm is performed to prove its data protection, query protection, and access pattern protection. Through our performance analysis, the proposed kNN query processing algorithm shows about 5 times better query processing performance, compared with the existing algorithms.

Mobile Crowd Computing is one of the most efficient and effective way to collect the Electronic health records and they are very intelligent in processing them. Mobile Crowd Computing can handle, analyze and process the huge volumes of Electronic Health Records (EHR) from the high-performance Cloud Environment. Electronic Health Records are very sensitive, so they need to be secured, authenticated and processed efficiently. However, security ,privacy and authentication of Electronic health records(EHR) and Patient health records(PHR) in the Mobile Crowd Computing Environment have become a critical issue that restricts many healthcare services from using Crowd Computing services .Our proposed Efficient Multi-layer Encryption Framework(MLEF) applies a set of multiple security Algorithms to provide access control over integrity, confidentiality ,privacy and authentication with cost efficient to the Electronic health records(HER)and Patient health records(PHR). Our system provides the efficient way to create an environment that is capable of capturing, storing, searching, sharing, analyzing and authenticating electronic healthcare records efficiently to provide right intervention to the right patient at the right time in the Mobile Crowd Computing Environment.

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.

Cryptography can be defined as the art of secret writing or protecting information by transforming it (encrypting it) into an unreadable format, called cipher text and then transmitting it across insecure networks, so that it cannot be read by anyone except the intended recipient. Only those who possess a secret key can decipher (or decrypt) the message into plain text. Encrypted information can sometimes be broken by cryptanalysis, also called code breaking, although modern cryptography techniques are virtually unbreakable. Various algorithms help achieve flawless encryption results which are mostly unbreakable. This paper is an attempt to improve one such algorithm, i.e. RC6 by adding on to its existing functionalities.

This paper presents a computationally efficient encryption scheme for RGB images. Firstly, the original plain-image is decomposed to three component images of R, G and B. Secondly, an improved gravitation model is used for value transformation by setting different encryption keys on each component. Thirdly, the improved Arnold transform is applied for position permutation. Finally, we obtain the encrypted image by composing the three component cipher-images. Experimental results show that encrypted image achieved by our algorithm can effectively resist security attacks.