Paper 2025/030
Delegated Multi-party Private Set Intersection from Secret Sharing
Abstract
In this work, we address the problem of Delegated PSI (D-PSI), where a cloud server is introduced to handle most computational and communication tasks. D-PSI enables users to securely delegate their private sets to the cloud, ensuring the privacy of their data while allowing efficient computation of the intersection. The cloud operates under strict security requirements, learning nothing about the individual sets or the intersection result. Moreover, D-PSI minimizes user-to-user communication and supports "silent" processing, where the cloud can perform computations independently without user interaction, apart from set delegation and result retrieval. We formally define the D-PSI problem and propose a novel construction that extends beyond two-party scenarios to support multi-party settings. Our construction adheres to the D-PSI requirements, including security against semi-honest adversaries, and achieves computational and communication complexities close to the ideal "perfect" D-PSI protocol. Additionally, we demonstrate the practicality of our approach through a baseline implementation and an optimized version that further reduces computational overhead. Our results establish a strong foundation for secure and efficient PSI in real-world cloud computing scenarios.
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Multi-party PSISecret Sharing
- Contact author(s)
- davidhoo471494221 @ gmail com
- History
- 2025-01-09: approved
- 2025-01-08: received
- See all versions
- Short URL
- https://ia.cr/2025/030
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/030, author = {Jingwei Hu and Zhiqi Liu and Cong Zuo}, title = {Delegated Multi-party Private Set Intersection from Secret Sharing}, howpublished = {Cryptology {ePrint} Archive, Paper 2025/030}, year = {2025}, url = {https://eprint.iacr.org/2025/030} }