Differentially Private Set Intersection for Asymmetrical ID Alignment

被引:7
作者
He, Yuanyuan [1 ]
Tan, Xinyu [2 ]
Ni, Jianbing [3 ]
Yang, Laurence T. [1 ]
Deng, Xianjun [1 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Cyber Sci & Engn, Wuhan 430074, Peoples R China
[2] Huazhong Univ Sci & Technol, Sch Software Engn, Wuhan 430074, Peoples R China
[3] Queens Univ, Dept Elect & Comp Engn, Kingston, ON K7L 3N6, Canada
基金
中国国家自然科学基金;
关键词
Protocols; Differential privacy; Credit cards; Homomorphic encryption; Costs; Companies; Collaborative work; Private set intersection; private set intersection cardinality; differential privacy; GM encryption; oblivious pseudo-random function; SECURE;
D O I
10.1109/TIFS.2022.3207911
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Private Set Intersection (PSI) is typically used to achieve ID alignment with protection of IDs in the preparation phase of Vertical Federated Learning (VFL). However, existing PSI approaches are limited to protecting IDs that are outside the intersection of participants, and most ignore the sensitivity of intersection for a weak party in an asymmetrical ID alignment. Since the set size of the strong party is much greater than the weak party's in an asymmetrical federation, and the intersection usually accounts for a substantial part of the weak party set, the weak party's sensitive sample IDs would be severely compromised through sharing the intersection. To address this issue, we propose Differentially private PSI Cardinality and PSI (DPSI-CA, DPSI) protocols, which protect the intersection cardinality and sensitive IDs inside the intersection for the weak party, respectively. First, DPSI-CA encodes IDs in binary notation, and combines them with the GM encryption, to perform the ID-matchmaking by executing bitwise plaintext XOR. Then, the encrypted matching results are independently perturbed using randomized responses to produce differentially private outputs for PSI-CA, and its unbiased estimate is added to remove the deviation brought by the randomization. Furthermore, DPSI fuses Pseudo-Random Function (PRF)-based zero sharing, garbled Bloom filter, and Oblivious PRF (OPRF)-based shares reconstruction, to successfully reconstruct the shares corresponding to sampled IDs in the intersection. Meanwhile, a randomized response is used to sample the inputs and perturb the outputs of the OPRF-based shares reconstruction, producing a randomly sampled intersection for the weak party and differentially private intersection for the strong party. Finally, the privacy analysis shows that our protocols provide differential privacy for the weak party's sensitive sample IDs, and extensive experiment results illustrate the feasibility of the asymmetrical ID alignment involving millions of IDs.
引用
收藏
页码:3479 / 3494
页数:16
相关论文
共 48 条
  • [1] Polynomial Representation Is Tricky: Maliciously Secure Private Set Intersection Revisited
    Abadi, Aydin
    Murdoch, Steven J.
    Zacharias, Thomas
    [J]. COMPUTER SECURITY - ESORICS 2021, PT II, 2021, 12973 : 721 - 742
  • [2] Efficient Delegated Private Set Intersection on Outsourced Private Datasets
    Abadi, Aydin
    Terzis, Sotirios
    Metere, Roberto
    Dong, Changyu
    [J]. IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2019, 16 (04) : 608 - 624
  • [3] Angelou N, 2020, Arxiv, DOI arXiv:2011.09350
  • [4] Verified Computational Differential Privacy with Applications to Smart Metering
    Barthe, Gilles
    Danezis, George
    Gregoire, Benjamin
    Kunz, Cesar
    Zanella-Beguelin, Santiago
    [J]. 2013 IEEE 26TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF), 2013, : 287 - 301
  • [5] Practical Multi-Party Private Set Intersection Protocols
    Bay, Asli
    Erkin, Zekeriya
    Hoepman, Jaap-Henk
    Samardjiska, Simona
    Vos, Jelle
    [J]. IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2022, 17 : 1 - 15
  • [6] Strain: A Secure Auction for Blockchains
    Blass, Erik-Oliver
    Kerschbaum, Florian
    [J]. COMPUTER SECURITY (ESORICS 2018), PT I, 2018, 11098 : 87 - 110
  • [7] SPACE/TIME TRADE/OFFS IN HASH CODING WITH ALLOWABLE ERRORS
    BLOOM, BH
    [J]. COMMUNICATIONS OF THE ACM, 1970, 13 (07) : 422 - &
  • [8] Fast Private Set Intersection from Homomorphic Encryption
    Chen, Hao
    Laine, Kim
    Rindal, Peter
    [J]. CCS'17: PROCEEDINGS OF THE 2017 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2017, : 1243 - 1255
  • [9] Cristofaro E.D., 2012, INT C CRYPTOLOGY NET, P218
  • [10] Unique in the shopping mall: On the reidentifiability of credit card metadata
    de Montjoye, Yves-Alexandre
    Radaelli, Laura
    Singh, Vivek Kumar
    Pentland, Alex Sandy
    [J]. SCIENCE, 2015, 347 (6221) : 536 - 539