Enhanced Private Set Union from Secret-shared Private Membership Test
Meng Hao, Guodong Wang, Xinpeng Yang, Pengzhi Xing, Hanxiao Chen, Tianwei Zhang, Haiyang Xue, Guomin Yang, Hongwei Li, Robert H. Deng
摘要
Private set union (PSU) enables two parties to compute the union of their sets without revealing additional information. Jia et al. (USENIX Security 2024) point out that most scalable PSU protocols suffer from during-execution leakage, whereby membership information is revealed to the receiver before the protocol completes, and consequently introduce the functionality of enhanced PSU to mitigate this issue. While several recent works propose protocols for enhanced PSU, existing solutions either incur high computational overhead due to reliance on computation-intensive public-key primitives, or suffer from large communication costs arising from generic secure computation.
In this work, we present a modular framework for constructing enhanced PSU based on the multi-query secret-shared private membership test (ssPMT) protocol (ASIACRYPT 2023) and a new primitive called secret-shared oblivious transfer with default (ssOTd). Our framework eliminates duringexecution leakage by ensuring that all intermediate information remains secret-shared between the parties throughout the protocol. At its core, we present two efficient ssPMT constructions relying primarily on lightweight symmetric-key primitives. We further design a customized, communicationefficient ssOTd protocol to optimize the overhead of enhanced PSU. As a byproduct, we obtain a computation-efficient construction of multi-query reverse PMT (mqRPMT) that avoids the computation-heavy public-key primitives used in the stateof-the-art approaches.
We implement two enhanced PSU protocols, denoted as ePSU-fast and ePSU-low, which are optimized for computational efficiency and communication efficiency, respectively, making them suitable for different network settings. Extensive evaluations show that ePSU-low simultaneously achieves lower computation and communication overhead than the state-of-the-art protocols by Jia et al. (USENIX Security 2024) and Tu et al. (USENIX Security 2025). Moreover, the ePSUfast protocol further reduces computation costs compared to ePSU-low, at the expense of increased communication.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper22
- Practical Multi-party Private Set Intersection from Symmetric-Key TechniquesVladimir Kolesnikov, Naor Matania, Benny Pinkas, Mike Rosulek 等CCS 2017 · 被引用 247 次
- Efficient Two-Round OT Extension and Silent Non-Interactive Secure ComputationElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai 等CCS 2019 · 被引用 238 次
- VOLE-PSI: Fast OPRF and Circuit-PSI from Vector-OLEPeter Rindal, Phillipp SchoppmannEUROCRYPT 2021 · 被引用 159 次
- Oblivious Key-Value Stores and Amplification for Private Set IntersectionGayathri Garimella, Benny Pinkas, Mike Rosulek, Ni Trieu 等CRYPTO 2021 · 被引用 139 次
- Blazing Fast PSI from Improved OKVS and Subfield VOLESrinivasan Raghuraman, Peter RindalCCS 2022 · 被引用 81 次
相关 Paper
- Fast Enhanced Private Set Union in the Balanced and Unbalanced ScenariosBinbin Tu, Yujie Bai, Cong Zhang, Yang Cao 等USENIX Security 2025
- Linear Private Set Union from Multi-Query Reverse Private Membership TestCong Zhang, Yu Chen, Weiran Liu, Min Zhang 等USENIX Security 2023
- A Leakage-Free Framework for Private Set OperationsWenhao Wu, Yuyue Chen, Bowen Shen, Peng Yang 等S&P 2026
- Scalable Private Set Union, with Stronger SecurityYanxue Jia, Shi-Feng Sun, Hong-Sheng Zhou, Dawu GuUSENIX Security 2024 · 被引用 22 次
- Malicious Private Set Union with Two-Sided OutputSihang Pu, Jiahui Gao, Ni TrieuEUROCRYPT 2026 · 被引用 1 次
