Bidirectional location privacy protection scheme for epidemiological investigation based on OT

被引:2
作者
Liu, Xueyan [1 ]
Wang, Jing [1 ]
Liu, Qiong [1 ]
Xiong, Xin [1 ]
Niu, Shufen [1 ]
机构
[1] Northwest Normal Univ, Comp Sci & Engn, Lanzhou 730070, Gansu, Peoples R China
基金
中国国家自然科学基金;
关键词
Epidemic prevention and control; Location privacy; The Hilbert curve; Bloom filter; Oblivious transfer; OBLIVIOUS TRANSFER; K-ANONYMITY;
D O I
10.1016/j.cose.2023.103453
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Epidemiological investigation is a crucial method to deal with epidemics (e.g., COVID-19), and the location data in the epidemiological investigation is widely used to determine close contacts. Through the analysis of the location data of the respondents and the diagnosis point data, it can effectively determine the close contacts and then promote the prevention and control of the epidemic. Due to the sensitivity of location data, the direct release and epidemiological investigation of location data will cause social panic and seriously threaten to personal privacy. Therefore, two aspects need to be considered in epidemiological investigation: the location privacy of responder and the location privacy of the diagnosis point. Focusing on the above two privacy requirements, we propose a bidirectional location privacy protection scheme based on oblivious transfer. Firstly, we introduce the Hilbert curve into Centers for Disease Control and Prevention (CDCP) to encode the position of the diagnosis point. Then the Bloom filter is used to perturb the encode of diagnosis point to ensure the location privacy of CDCP. Secondly, 1-out-of-n oblivious transfer protocol is carried on between the CDCP and the responder to achieve screening of close contacts. At the same time, the bidirectional privacy protection of the location between CDCP and respondents has been ensured. Security analysis and performance analysis prove that the overall scheme is secure, feasible, and efficient.
引用
收藏
页数:10
相关论文
共 45 条
[1]  
Bamba B., 2008, P 17 INT C WORLD WID
[2]  
Beaver D., 1996, Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, P479, DOI 10.1145/237814.237996
[3]  
Beaver D, 1995, LECT NOTES COMPUT SC, V963, P97
[4]  
Bellare M., 1989, P CRYPTO, P547, DOI DOI 10.1007/0-387-34805-0_48
[5]  
BENNETT CH, 1992, LECT NOTES COMPUT SC, V576, P351
[6]   Location privacy in pervasive computing [J].
Beresford, AR ;
Stajano, F .
IEEE PERVASIVE COMPUTING, 2003, 2 (01) :46-55
[7]   Casper: Query Processing for Location Services without Compromising Privacy [J].
Chow, Chi-Yin ;
Mokbel, Mohamed F. ;
Aref, Walid G. .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 2009, 34 (04)
[8]  
Chu CK, 2005, LECT NOTES COMPUT SC, V3386, P172
[9]  
Crepeau C., 1995, Committed oblivious transfer and private multi-party computation, DOI [10.1007/3-540-44750-4_9, DOI 10.1007/3-540-44750-4_9]
[10]  
Crepeau C., 2005, Efficient unconditional oblivious transfer from almost any noisy channel, DOI [10.1007/978-3-540-30598-9_4, DOI 10.1007/978-3-540-30598-9_4]