Efficient Delegated Private Set Intersection on Outsourced Private Datasets

被引:71
作者
Abadi, Aydin [1 ]
Terzis, Sotirios [1 ]
Metere, Roberto [2 ]
Dong, Changyu [2 ]
机构
[1] Univ Strathclyde, Dept Comp & Informat Sci, Glasgow G1 1XQ, Lanark, Scotland
[2] Newcastle Univ, Sch Comp Sci, Newcastle Upon Tyne NE1 7RU, Tyne & Wear, England
基金
英国工程与自然科学研究理事会;
关键词
Private set intersection; secure computation; cloud computing; SECURE;
D O I
10.1109/TDSC.2017.2708710
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Private set intersection (PSI) is an essential cryptographic protocol that has many real world applications. As cloud computing power and popularity have been swiftly growing, it is now desirable to leverage the cloud to store private datasets and delegate PSI computation to it. Although a set of efficient PSI protocols have been designed, none support outsourcing of the datasets and the computation. In this paper, we propose two protocols for delegated PSI computation on outsourced private datasets. Our protocols have a unique combination of properties that make them particularly appealing for a cloud computing setting. Our first protocol, O-PSI, satisfies these properties by using additive homomorphic encryption and point-value polynomial representation of a set. Our second protocol, EO-PSI, is mainly based on a hash table and point-value polynomial representation and it does not require public key encryption; meanwhile, it retains all the desirable properties and is much more efficient than the first one. We also provide a formal security analysis of the two protocols in the semi-honest model and we analyze their performance utilizing prototype implementations we have developed. Our performance analysis shows that EO-PSI scales well and is also more efficient than similar state-of-the-art protocols for large set sizes.
引用
收藏
页码:608 / 624
页数:17
相关论文
共 39 条
[11]  
Boneh D, 2005, LECT NOTES COMPUT SC, V3378, P325
[12]   Verifiable Computation over Large Database with Incremental Updates [J].
Chen, Xiaofeng ;
Li, Jin ;
Weng, Jian ;
Ma, Jianfeng ;
Lou, Wenjing .
IEEE TRANSACTIONS ON COMPUTERS, 2016, 65 (10) :3184-3195
[13]   New Publicly Verifiable Databases with Efficient Updates [J].
Chen, Xiaofeng ;
Li, Jin ;
Huang, Xinyi ;
Ma, Jianfeng ;
Lou, Wenjing .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2015, 12 (05) :546-556
[14]   New Algorithms for Secure Outsourcing of Modular Exponentiations [J].
Chen, Xiaofeng ;
Li, Jin ;
Ma, Jianfeng ;
Tang, Qiang ;
Lou, Wenjing .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2014, 25 (09) :2386-2396
[15]  
De Cristofaro E, 2010, LECT NOTES COMPUT SC, V6477, P213, DOI 10.1007/978-3-642-17373-8_13
[16]  
De Cristofaro E, 2010, LECT NOTES COMPUT SC, V6052, P143, DOI 10.1007/978-3-642-14577-3_13
[17]  
Dong C, 2013, 2013 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE WORKSHOPS (WCNCW), P129, DOI 10.1109/WCNCW.2013.6533327
[18]  
Freedman MJ, 2004, LECT NOTES COMPUT SC, V3027, P1
[19]  
Goldreich Oded, 2004, Basic Applications, V2
[20]  
Jun-Qing L, 2013, INT C ELECTR MACH SY, P789, DOI 10.1109/ICEMS.2013.6713151