Research on privacy information retrieval model based on hybrid homomorphic encryption  

作　　者：Wei-tao Song Guang Zeng Wen-zheng Zhang Dian-hua Tang 

机构地区：[1]Science and Technology on Communication Security Laboratory.Chengdu 610041,China [2]Zhejiang University,Hangzhou 311200,China [3]PLA SSF Information Engineering University,Zhengzhou 450000,China [4]College of Computer Science and Technology,National University of Defense Technology,Changsha 410073,China

出　　处：《Cybersecurity》2024年第4期52-61,共10页网络空间安全科学与技术（英文）

基　　金：sponsored in part by the National Natural Science Foundation of China[Grant-Nos.61902428,6210071026,62202493].

摘　　要：The computational complexity of privacy information retrieval protocols is often linearly related to database size.When the database size is large,the efficiency of privacy information retrieval protocols is relatively low.This paper designs an effective privacy information retrieval model based on hybrid fully homomorphic encryption.The assignment method is cleverly used to replace a large number of homomorphic encryption operations.At the same time,the multiplicative homomorphic encryption scheme is first used to deal with the large-scale serialization in the search,and then the fully homomorphic encryption scheme is used to deal with the remaining simple operations.The depth of operations supported by the fully homomorphic scheme no longer depends on the size of the database,but only needs to support the single homomorphic encryption scheme to decrypt the circuit depth.Based on this hybrid homomorphic encryption retrieval model,the efficiency of homomorphic privacy information retrieval model can be greatly improved.

关 键 词：CRYPTOGRAPHY Hybrid homomorphic encryption Privacy protection Private information retrieval 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]