Efficiency improvement techniques for private intersection-sum protocol using Bloom filter
Efficiency improvement techniques for private intersection-sum protocol using Bloom filter
复制标题
使用布隆过滤器的私有交集协议的效率改进技术
DOI：
10.1007/s42452-021-04910-z
复制
发表时间：
2022
影响因子：
2.6
通讯作者：
Hakuta Keisuke
中科院分区：
文献类型：
--
作者：
Kano Hiroyuki;Hakuta Keisuke
私有集合求交协议是安全的多方计算协议之一，它允许参与者计算集合的交集而不向对方透露它们。Ion等人提出了私有相交和协议（PI-Sum）。PI-Sum是两方私有集合交集协议之一。在PI和中，两方（比如Alice和Bob）拥有私有集合A和B。此外，Bob还具有与B的每个元素相关联的有理整数。PI求和允许Bob获得与的元素相关联的有理整数的和。本文提出了PI求和的效率改进技术。所提出的技术是基于布隆过滤器，这是概率数据结构。更准确地说，本文提出了三个协议，这是PI求和的修改。所提出的协议是更有效的比PI求和。
A private set intersection protocol is one of the secure multi-party computation protocols, and allows participants to compute the intersection of their sets without revealing them to each other. Ion et al. proposed the private intersection-sum protocol (PI-Sum). The PI-Sum is one of the two-party private set intersection protocol. In the PI-Sum, two parties (say Alice and Bob) have the private setsAandB. Moreover, Bob additionaly has a rational integer associated with each element ofB. The PI-Sum allows Bob to obtain the sum of the rational integers associated with the elements of. This paper proposes the efficiency improvement techniques for the PI-Sum. The proposed techniques are based on Bloom filters which are probabilistic data structures. More precisely, this paper proposes three protocols which are modifications of the PI-Sum. The proposed protocols are more efficient than the PI-Sum.