Enabling privacy-preserving non-interactive computation for Hamming distance

被引:2
作者
Gao, Wenjing [1 ]
Liang, Wei [2 ]
Hao, Rong [1 ]
Yu, Jia [1 ]
机构
[1] Qingdao Univ, Coll Comp Sci & Technol, Qingdao 266071, Peoples R China
[2] Hunan Univ Sci & Technol, Sch Comp Sci & Engn, Xiangtan 411201, Peoples R China
基金
中国国家自然科学基金;
关键词
Data privacy; Hamming distance; Cloud computing; Secure outsourcing; Homomorphic encryption; REGRESSION; RETRIEVAL; SCHEMES;
D O I
10.1016/j.ins.2024.120592
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Hamming distance is a measure of the similarity between two strings of the same length. Privacy -preserving Hamming distance computation allows data users to obtain the Hamming distance between their data without disclosing their respective private data. The existing privacypreserving protocols for Hamming distance computation require multiple rounds of online interactive computation between two data users. To address this issue, we propose a new Privacy -preserving non -interactive Hamming Distance Computation (PHDC) protocol. Different from previous works, we adopt the strategy of secure outsourcing to avoid the online interactive computation between data users. We move the Hamming distance computation from the user side to the cloud side. The cloud server is responsible for the Hamming distance computation under privacy protection. To preserve data privacy, we propose a novel blinding technique for user data. Data users initially blind their data using homomorphic encryption and randomization techniques. The edge server is responsible for data aggregation and further data blindness. In this way, data users only need to outsource their encrypted data to the edge server, and there is no online interactive computation between data users. With the assistance of the edge server and the cloud server, the privacy -preserving Hamming distance computation is achieved. The security analysis demonstrates that the protocol guarantees the data privacy under the semi -honest adversarial model. The theoretical analysis and experimental results illustrate the efficiency of the proposed protocol.
引用
收藏
页数:14
相关论文
共 37 条
[1]   Efficient Delegated Private Set Intersection on Outsourced Private Datasets [J].
Abadi, Aydin ;
Terzis, Sotirios ;
Metere, Roberto ;
Dong, Changyu .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2019, 16 (04) :608-624
[2]   Practical Multi-Party Private Set Intersection Protocols [J].
Bay, Asli ;
Erkin, Zekeriya ;
Hoepman, Jaap-Henk ;
Samardjiska, Simona ;
Vos, Jelle .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2022, 17 :1-15
[3]  
Bringer J., 2014, P 2 ACM WORKSH INF H, P187, DOI DOI 10.1145/2600918.2600922
[4]  
Bringer J, 2013, LECT NOTES COMPUT SC, V7862, P164, DOI 10.1007/978-3-642-41320-9_11
[5]   Lattice-Based Secure Biometric Authentication for Hamming Distance [J].
Cheon, Jung Hee ;
Kim, Dongwoo ;
Kim, Duhyeong ;
Lee, Joohee ;
Shin, Junbum ;
Song, Yongsoo .
INFORMATION SECURITY AND PRIVACY, ACISP 2021, 2021, 13083 :653-672
[6]   An Efficient Toolkit for Computing Private Set Operations [J].
Davidson, Alex ;
Cid, Carlos .
INFORMATION SECURITY AND PRIVACY, ACISP 2017, PT II, 2017, 10343 :261-278
[7]  
Dou J., 2023, Comput. Sci., V49, P355
[8]   A PUBLIC KEY CRYPTOSYSTEM AND A SIGNATURE SCHEME BASED ON DISCRETE LOGARITHMS [J].
ELGAMAL, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (04) :469-472
[9]   Privacy-Preserving Parallel Computation of Matrix Determinant With Edge Computing [J].
Gao, Wenjing ;
Yu, Jia .
IEEE TRANSACTIONS ON SERVICES COMPUTING, 2023, 16 (05) :3578-3589
[10]   Privacy-enhanced and non-interactive linear regression with dropout-resilience [J].
He, Gang ;
Ren, Yanli ;
Bian, Mingyun ;
Feng, Guorui ;
Zhang, Xinpeng .
INFORMATION SCIENCES, 2023, 632 :69-86