arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2410.04746cs.CR
收藏

PSA:面向大规模数据安全协作分析的私有集合对齐

PSA: Private Set Alignment for Secure and Collaborative Analytics on Large-Scale Data

Jiabo Wang, Elmo Xuyun Huang, Pu Duan, Huaxiong Wang, Kwok-Yan Lam

AI总结:

本研究针对跨企业数据协作中的客户记录对齐隐私问题,提出两级隐私保护的PSA协议,基于改进的不经意交换网络实现百万级数据集秒级对齐,性能较同态方案提升百倍,并补充了相关算法的新证明。

摘要:

隐私监管的落地执行对协作数据分析至关重要。本研究针对两家企业希望基于共同客户安全合并各自数据集以最大化数据洞察的场景展开。除了对原始数据的必要保护外,保护共同客户的身份与属性更具挑战性——这要求参与方在不知道共同客户是谁的前提下,对齐与这些客户相关联的记录。我们针对该场景提出了名为PSA(私有集合对齐)的解决方案,可有效应用于现实场景,例如利用发布商与商家双方数据评估广告转化效果。本研究的贡献分为三方面:1. 我们定义了具备两级隐私保护的PSA概念,并基于改进的不经意交换网络提出了新型PSA协议,该协议利用高效的对称密钥运算与离线预计算来节省在线运行时间。2. 我们在不同网络条件下对所提协议进行了实现与基准测试:在单线程、500Mbps网络带宽下,合并两个各含一百万条记录的数据集仅需35.5秒,性能较现有基于同态加密的协议提升100倍。3. 我们针对一种构造不经意交换网络以实现目标排列的准线性复杂度算法给出了新证明,该算法区别于现有文献中的同类算法。

英文摘要:

Enforcement of privacy regulation is essential for collaborative data analytics. In this work, we address a scenario in which two companies expect to securely join their datasets with respect to their common customers to maximize data insights. Apart from the necessary protection of raw data, it becomes more challenging to protect the identities and attributes of common customers, as it requires participants to align their records associated with common customers without knowing who they are. We proposed a solution, dubbed PSA, for this scenario, which is effectively applicable to real-world use cases, such as evaluating advertising conversion using data from both publishers and merchants. The contributions of this work are threefold: 1. We defined the notion of PSA with two levels of privacy protection and proposed novel PSA protocols based on the modified oblivious switching network, which leverages efficient symmetric key operations and offline precomputation to save online run time. 2. We implemented and benchmarked the proposed protocols in different network conditions by joining two datasets, each at the scale of one million records, in 35.5 sec on a single thread with a network bandwidth of 500 Mbps, resulting in an X100 improvement over the existing Homomorphic based protocols. 3. We give new proof for an algorithm of quasi-linear complexity that constructs an oblivious switching network to achieve a target permutation distinct from the existing one in the literature.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑