Research on Homomorphic Retrieval Method of Private Database Secrets in Multi-server Environment

Abstract

The traditional homomorphism retrieval method of privacy database is very complicated. In order to reduce the running time, this paper designs a homomorphic secret retrieval method for private database in multi-server environment. After the establishment of the secret homomorphism vector model, the semantic classification of the secret homomorphism ciphertext is carried out. Then, according to the characteristics of the neighborhood structure, the mapping interval is divided, and the HASH function is used to perform operations in the mapping interval. This process can reduce the computational complexity of the secret homomorphic ciphertext. Finally, a secret homomorphic retrieval model is established and an optimized retrieval algorithm is designed. Design experiments and compare the three conventional retrieval methods. According to the experimental data, in different mapping intervals, the average retrieval time of this method is 14.32 s, while the average retrieval time of the three control groups is 23.74 s, 29.03 s, At 20.92 s, the retrieval time of this method is shorter than that of the conventional method, which makes the homomorphic retrieval method of private databases more concise.