安全计算协议在保持各方输入私密的同时,将参与方的输入组合起来生成输出。私有集合交集(Private Set Intersection, PSI)是一种安全计算协议,允许各自持有一组项目的两方学习其集合的交集,而不泄露关于项目的任何其他信息。私有交集求和(Private Intersection Sum, PIS)在PSI基础上进行了扩展,使两方能够学习交集的大小,以及交集中每个标识符所关联的整数值之和,但除此之外不泄露更多信息。最后,私有连接与计算(Private Join and Compute, PJC)是PIS协议的可扩展扩展,旨在帮助组织使用机密数据集进行协作。本文提出的扩展包括:(a) 将PJC协议扩展到额外的数据列,并基于支持的同态运算应用列聚合;(b) 探索环上带误差学习(Ring Learning with Errors, RLWE)同态加密方案,以应用求和及平方和等算术运算;(c) 通过使用证书对通信双方进行相互认证来确保更强的安全性;(d) 开发一个网站以将此类服务产品化。我们应用研究结果开发了一个名为JingBing的概念验证解决方案,这是一种选民名单验证服务,允许不同的州进行注册、获取安全通信模块、安装该模块,然后进行经认证的点对点通信。我们在论文结尾提出了未来研究方向,以使该解决方案在实际现实场景中具有可扩展性。
英文摘要:
Secure computation protocols combine inputs from involved parties to generate an output while keeping their inputs private. Private Set Intersection (PSI) is a secure computation protocol that allows two parties, who each hold a set of items, to learn the intersection of their sets without revealing anything else about the items. Private Intersection Sum (PIS) extends PSI when the two parties want to learn the cardinality of the intersection, as well as the sum of the associated integer values for each identifier in the intersection, but nothing more. Finally, Private Join and Compute (PJC) is a scalable extension of PIS protocol to help organizations work together with confidential data sets. The extensions proposed in this paper include: (a) extending PJC protocol to additional data columns and applying columnar aggregation based on supported homomorphic operations, (b) exploring Ring Learning with Errors (RLWE) homomorphic encryption schemes to apply arithmetic operations such as sum and sum of squares, (c) ensuring stronger security using mutual authentication of communicating parties using certificates, and (d) developing a Website to operationalize such a service offering. We applied our results to develop a Proof-of-Concept solution called JingBing, a voter list validation service that allows different states to register, acquire secure communication modules, install it, and then conduct authenticated peer-to-peer communication. We conclude our paper with directions for future research to make such a solution scalable for practical real-life scenarios.
Asymmetric Private Set Intersection with Applications to Contact Tracing and Private Vertical Federated Machine Learning
Morfix;OpenMined;École Supérieure en Informatique, Sidi Bel Abbès(西迪贝勒阿巴斯高等计算机学院);Bitdefender(比特梵德);Edinburgh Napier University(爱丁堡龙比亚大学);apheris AI;University of California Los Angeles(加利福尼亚大学洛杉矶分校);Humboldt-Universität zu Berlin(柏林洪堡大学);Tessella
Authenticated Private Set Intersection: A Merkle Tree-Based Approach for Enhancing Data Integrity
School of Mathematics, Renmin University of China(中国人民大学数学学院);Institute of Mathematics, Henan Academy of Science(河南省科学院数学研究所);Great Bay Institute for Advanced Study, Mathematics and Information Security Research Center(大湾区高等研究院数学与信息安全研究中心)
Practical Traceable Over-Threshold Multi-Party Private Set Intersection
School of Cyber Science and Technology, University of Science and Technology of China(中国科学技术大学网络空间安全学院);Fujian Provincial Key Laboratory of Network Security and Cryptology, College of Computer and Cyber Security, Fujian Normal University(福建师范大学计算机与网络安全学院);NIO Inc.(蔚来汽车)
The University of Washington(华盛顿大学);The Simons Institute for the Theory of Computing at the University of California, Berkeley(加州大学伯克利分校西蒙斯理论计算研究所);University of Pennsylvania(宾夕法尼亚大学)