An Efficient Search Algorithm for Large Encrypted Data by Homomorphic Encryption

Pyung Kim,Eunji Jo,Younho Lee

doi:10.3390/electronics10040484

Pyung Kim, Eunji Jo + Show 1 more

Open Access

https://doi.org/10.3390/electronics10040484

Copy DOI

Abstract

The purpose of this study is to provide an efficient search function over a large amount of encrypted data, where the bit length of each item is several tens of bits. For this purpose, we have improved the existing hybrid homomorphic encryption by enabling the longer data items to be stored while using multiple encrypted databases and by suggesting an improved search method working on top of the multiple instances of the database. Further, we found the optimal number of databases to be needed when 40-bit information, such as social security number, is stored after encryption. Through experiments, we were able to check the existence of a given (Korean) social security number of 13 decimal digits in approximately 12 s from a database that has 10 million encrypted social security numbers over a typical personal computer environment. The outcome of this research can be used to build a large-scale, practical encrypted database in order to support the search operation. In addition, it is expected to be used as a method for providing both security and practicality to the industry dealing with credit information evaluation and personal data requiring privacy.

Highlights

IntroductionThe use of personal information, such as personal identification numbers, is inevitable
The Korean residence registration numbers (RRNs), which have roles that are similar to social security numbers in the U.S, have been widely used as personal identification numbers for a long time; they are more extensively collected along with personal information, recorded, and managed in multiple repositories, owing to the progress of the information society
We proposed a new search method over encrypted data, which complements the existing hybrid Homomorphic encryption (HE) and helps to deal with a large number of RRNs

Summary

Introduction

The use of personal information, such as personal identification numbers, is inevitable. The Korean residence registration numbers (RRNs), which have roles that are similar to social security numbers in the U.S, have been widely used as personal identification numbers for a long time; they are more extensively collected along with personal information, recorded, and managed in multiple repositories, owing to the progress of the information society. RRN has a strong personal identification value and it can be used as an identity verification tool in all fields of activity; if it is exposed, it is possible to impersonate another person, and use it for fraud or illegal collection, and marketing of various target advertisements. Unprotected RRN can cause serious privacy infringement [2,3,4]

Objectives

Methods

Discussion

Conclusion