一种基于并行化OPPRF的隐私集合交集协议  

A Private Set Intersection Protocol based on Parallelized OPPRF

作　　者：李顺[1] LI Shun(Sichuan University,Chengdu Sichuan 610207,China)

机构地区：[1]四川大学,四川成都610207

出　　处：《通信技术》2022年第1期77-81,共5页Communications Technology

摘　　要：随着隐私保护法规逐渐完善,隐私集合交集技术得到了较为迅速的发展。考虑半诚实模型下含有两个参与方的场景中,基于多项式的隐私集合交集协议效率较低的问题,提出了一种基于并行化不经意编码伪随机函数(OPPRF)的隐私集合交集协议。首先采用了位置映射矩阵结构降低协议的运行时间,其次基于将元素散列到桶中的方法减小问题规模,最后通过模拟分析证明协议的安全性。实验结果表明,在相同条件下,相较于多项式方案协议具有较小的时间开销,该协议可以有效提升解决隐私集合交集问题的效率。With the improvement of privacy protection regulations, private set intersection has developed rapidly. Considering the low efficiency of the polynomial-based private set intersection protocol with two participants under the condition of the semi-honest model, this paper first adopts location mapping matrix to reduce the running time, then enable it to run in parallel by assigning items to bins, reducing the problem scale, and finally gives the simulation-based security analysis of the protocol. Experimental results indicate that the protocol has a shorter running time than the polynomial scheme under the same conditions, which can effectively improve the efficiency of solving private set intersection problem.

关 键 词：安全多方计算 隐私保护 隐私集合交集 半诚实模型 

分 类 号：TP309.2[自动化与计算机技术—计算机系统结构]