Traceable Private Set Intersection in Cloud Computing

被引:0
作者
Jiang, Tao [1 ]
Yuan, Xu [2 ]
机构
[1] Xidian Univ, State Key Lab Integrated Serv Networks, Xian, Peoples R China
[2] Univ Louisiana Lafayette, Sch Comp & Informat, Lafayette, LA 70504 USA
来源
2019 IEEE CONFERENCE ON DEPENDABLE AND SECURE COMPUTING (DSC) | 2019年
基金
中国博士后科学基金; 中国国家自然科学基金;
关键词
Cloud computing; private set intersection; traceability; bit commitment; garbled Bloom filter; EFFICIENT PROTOCOLS; SECURITY;
D O I
10.1109/dsc47296.2019.8937666
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Private set intersection (PSI) is a fundamental primitive of many secure applications, which is broadly attracting researchers' interests. The most of existing private set intersection solutions are constructed based on the designed garbled Bloom filter to prevent against the semi-honest adversary. However, the security attributes can no longer be hold in the presence of the malicious adversary. In this paper, we present a novel traceable PSI protocol to protect the confidentiality of the participants in the presence of the malicious adversary, when operating on the large-scale data set. Specifically, our scheme relies on the committed Bloom filter, committed random selection and ownership proof, which enables clients and the cloud server to conduct secure and fine-grained verification through randomly checking a small fraction of clients' data items. To further reduce the communication and computation overhead, a probabilistic approach is developed to provide efficient verification. In the end, we conduct security analysis of our scheme and prove that it is secure under the full universe attack.
引用
收藏
页码:81 / 87
页数:7
相关论文
共 32 条
[1]  
Aggarwal C. C., 2008, ADV DATABASE SYSTEMS, V34, P612
[2]  
Ateniese G, 2007, CCS'07: PROCEEDINGS OF THE 14TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P598
[3]  
Aumann Y, 2007, LECT NOTES COMPUT SC, V4392, P137
[4]  
Baldi P, 2011, PROCEEDINGS OF THE 18TH ACM CONFERENCE ON COMPUTER & COMMUNICATIONS SECURITY (CCS 11), P691
[5]  
Baldwin R. W., 1985, Proceedings of the 1985 Symposium on Security and Privacy (Cat. No. 85CH2150-1), P92
[6]  
Bellare M, 1993, P 1 ACM C COMP COMM, P62, DOI [DOI 10.1145/168588.168596, 10.1145/168588.168596]
[7]   SPACE/TIME TRADE/OFFS IN HASH CODING WITH ALLOWABLE ERRORS [J].
BLOOM, BH .
COMMUNICATIONS OF THE ACM, 1970, 13 (07) :422-&
[8]   For your phone only: custom protocols for efficient secure function evaluation on mobile devices [J].
Carter, Henry ;
Amrutkar, Chaitrali ;
Dacosta, Italo ;
Traynor, Patrick .
SECURITY AND COMMUNICATION NETWORKS, 2014, 7 (07) :1165-1176
[9]  
De Cristofaro E, 2010, LECT NOTES COMPUT SC, V6052, P143, DOI 10.1007/978-3-642-14577-3_13
[10]  
Freedman MJ, 2004, LECT NOTES COMPUT SC, V3027, P1