基数(数据建模)
不经意传输
同态加密
交叉口(航空)
计算机科学
安全多方计算
计算
离散数学
航程(航空)
传输(计算)
算法
组合数学
理论计算机科学
数学
数据挖掘
加密
计算机安全
工程类
航空航天工程
复合材料
并行计算
材料科学
作者
Shengnan Zhao,Ming Ma,Xiangfu Song,Han Jiang,Yunxue Yan,Qiuliang Xu
标识
DOI:10.1007/978-3-030-86137-7_12
摘要
As a significant basis for privacy-preserving applications of Secure Multiparty Computation (MPC), Private Set Intersection (PSI) has long been a question of great interest in a wide range of field, such as ad conversion rates and private contact tracing. Threshold PSI (\(t\)-\(\mathsf {PSI}\)), a variant of PSI, allows two parties to learn the intersection of two sets only if the cardinality of intersection is larger (or lesser) than a threshold t. In this paper, we give a generic \(t\)-\(\mathsf {PSI}\) construction that relies heavily on Oblivious Transfer (OT). Without resorting to the relatively expensive homomorphic calculation approaches from public-key mechanism, two kinds of \(t\)-\(\mathsf {PSI}\) protocols could be efficiently implemented based on our proposed construction, i.e., \(t^{\scriptscriptstyle {\le }}\mathsf {PSI}\) and \(t^{\scriptscriptstyle {>}}\text {-}\mathsf {PSI}\). Specially, we construct two efficient protocols named secret-sharing private equality test Open image in new window and membership text Open image in new window , which enable PSI to scale to a wide range of practical applications. The experimental simulation results show that our protocols are efficient and computation friendly.
科研通智能强力驱动
Strongly Powered by AbleSci AI