• International Journal of Advanced Culture Technology
• /
• 제10권2호
• /
• pp.240-245
• /
• 2022

Because of the importance of the information, encryption algorithms are heavily used. Raw data is encrypted and secure, but problems arise when the key for decryption is exposed. In particular, large-scale Internet sites such as Facebook and Amazon suffer serious damage when user data is exposed. Recently, research into a new fourth-generation encryption technology that can protect user-related data without the use of a key required for encryption is attracting attention. Also, data clustering technology using encryption is attracting attention. In this paper, we try to reduce key exposure by using homomorphic encryption. In addition, we want to maintain privacy through similarity measurement. Additionally, holistic similarity measurements are time-consuming and expensive as the data size and scope increases. Therefore, Min-Hash has been studied to efficiently estimate the similarity between two signatures Methods of measuring similarity that have been studied in the past are time-consuming and expensive as the size and area of data increases. However, Min-Hash allowed us to efficiently infer the similarity between the two sets. Min-Hash is widely used for anti-plagiarism, graph and image analysis, and genetic analysis. Therefore, this paper reports privacy using homomorphic encryption and presents a model for efficient similarity measurement using Min-Hash.

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

In a smart grid environment, data for the usage and control of power are transmitted over an Internet protocol (IP)-based network. This data contains very sensitive information about the user or energy service provider (ESP); hence, measures must be taken to prevent data manipulation. Mutual authentication between devices, which can prevent impersonation attacks by verifying the counterpart's identity, is a necessary process for secure communication. However, it is difficult to apply existing signature-based authentication in a smart grid system because smart meters, a component of such systems, are resource-constrained devices. In this paper, we consider a smart meter and propose an efficient mutual authentication protocol. The proposed protocol uses a matrix-based homomorphic hash that can decrease the amount of computations in a smart meter. To prove this, we analyze the protocol's security and performance.

• Journal of Information Processing Systems
• /
• 제7권3호
• /
• pp.549-560
• /
• 2011

Vote validity proof and verification is an efficiency bottleneck and privacy drawback in homomorphic e-voting. The existing vote validity proof technique is inefficient and only achieves honest-verifier zero knowledge. In this paper, an efficient proof and verification technique is proposed to guarantee vote validity in homomorphic e-voting. The new proof technique is mainly based on hash function operations that only need a very small number of costly public key cryptographic operations. It can handle untrusted verifiers and achieve stronger zero knowledge privacy. As a result, the efficiency and privacy of homomorphic e-voting applications will be significantly improved.

• International Journal of Internet, Broadcasting and Communication
• /
• 제13권2호
• /
• pp.60-66
• /
• 2021

Blockchain is a technology that enables trust-based consensus and verification based on a decentralized network. Distributed ID (DID) is based on a decentralized structure, and users have the right to manage their own ID. Recently, interest in self-sovereign identity authentication is increasing. In this paper, as a method for transparent and safe sovereignty management of data, among data pseudonymization techniques for blockchain use, various methods for data encryption processing are examined. The public key technique (homomorphic encryption) has high flexibility and security because different algorithms are applied to the entire sentence for encryption and decryption. As a result, the computational efficiency decreases. The hash function method (MD5) can maintain flexibility and is higher than the security-related two-way encryption method, but there is a threat of collision. Zero-knowledge proof is based on public key encryption based on a mutual proof method, and complex formulas are applied to processes such as personal identification, key distribution, and digital signature. It requires consensus and verification process, so the operation efficiency is lowered to the level of O (log_eN) ~ O(N²). In this paper, data encryption processing for blockchain DID, based on zero-knowledge proof, was proposed and a one-way encryption method considering data use range and frequency of use was proposed. Based on the content presented in the thesis, it is possible to process corrected zero-knowledge proof and to process data efficiently.

• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제11권2호
• /
• pp.51-58
• /
• 2022

블록체인 기술은 블록체인 네트워크에 참여하는 사용자의 데이터가 분산 처리되어 저장되는 시스템이다. 비트코인과 이더리움을 필두로 세계적으로 관심을 받고 있으며, 블록체인의 활용성은 무궁무진한 것으로 예측되고 있다. 하지만 블록체인의 모든 데이터를 네트워크 참여자에게 공개하는 투명성으로 인해 블록체인 데이터 프라이버시 보호에 대한 필요성이 개인정보를 처리하는 각종 금융, 의료, 부동산 분야에서 떠오르고 있다. 기존 블록체인 데이터 프라이버시 보호를 위해서 스마트 컨트랙트, 동형암호화, 암호학 키 방식을 사용하는 연구들이 주를 이루었으나, 본 논문에서는 기존의 논문들과 차별화된 매트릭스 문자 재배치 기법을 사용한 데이터 프라이버시 보호를 제안한다. 본 논문에서 제안하는 접근방안은 원본 데이터를 매트릭스 문자 재배치 하는 방법, 배치된 데이터를 다시 원본으로 되돌리는 방법, 크게 두 가지로 구성이 되어있다. 정성적인 실험을 통해 본 논문에서 제안하는 접근방안의 안전성을 평가하였으며, 매트릭스 문자 재배치가 적용된 데이터를 원본 데이터로 되돌릴 때 걸리는 시간을 측정하여 프라이빗 블록체인 환경에서도 충분히 적용이 가능할 것이라는 것을 증명하였다.