School of Software Engineering, Jinling Institute of Technology, Nanjing 211169, China.
Math Biosci Eng. 2022 Jan;19(2):1861-1876. doi: 10.3934/mbe.2022087. Epub 2021 Dec 20.
Private Set Intersection (PSI), which is a hot topic in recent years, has been extensively utilized in credit evaluation, medical system and so on. However, with the development of big data era, the existing traditional PSI cannot meet the application requirements in terms of performance and scalability. In this work, we proposed two secure and effective PSI (SE-PSI) protocols on scalable datasets by leveraging deterministic encryption and Bloom Filter. Specially, our first protocol focuses on high efficiency and is secure under a semi-honest server, while the second protocol achieves security on an economic-driven malicious server and hides the set/intersection size to the server. With experimental evaluation, our two protocols need only around 15 and 24 seconds respectively over one million-element datasets. Moreover, as a novelty, a multi-round mechanism is proposed for the two protocols to improve the efficiency. The implementation demonstrates that our two-round mechanism can enhance efficiency by almost twice than two basic protocols.
私有集合交集 (PSI) 是近年来的热门话题,已广泛应用于信用评估、医疗系统等领域。然而,随着大数据时代的发展,现有的传统 PSI 在性能和可扩展性方面无法满足应用需求。在这项工作中,我们利用确定性加密和布隆过滤器在可扩展数据集上提出了两种安全有效的 PSI (SE-PSI) 协议。具体来说,我们的第一个协议侧重于高效率,在半诚实的服务器下是安全的,而第二个协议在经济驱动的恶意服务器上实现安全性,并向服务器隐藏集合/交集的大小。通过实验评估,我们的两个协议在超过一百万元素的数据集上分别只需要大约 15 秒和 24 秒。此外,作为一个新颖性,我们为这两个协议提出了一种多轮机制来提高效率。实现表明,我们的两轮机制可以将效率提高近两倍。