Skip to content
Open access

Beyond the Output: Inference Attacks on Private Set Union and Multi-Key Private Matching

Oct 2026 · Proceedings on Privacy Enhancing Technologies · Vol 2026, pp. 983-1005 · 0 citations · 48 references
Computer Science

TL;DR

This work expands the understanding of attacks in this setting by investigating a broader class of functionalities, namely: Private Set Union, PSU-Cardinality, and Meta’s multi-key private matching (MKPM) functionality, and investigates possible mitigations for deploying such systems.

Abstract

Recent work (Falzon and Tang USENIX 2025) has shown that a protocol participant who behaves honestly but strategically chooses its inputs can break input privacy in the Private Join and Compute functionality. In this work, we expand our understanding of attacks in this setting by investigating a broader class of functionalities, namely: Private Set Union (PSU), PSU-Cardinality (PSU-CA), and Meta’s multi-key private matching (MKPM) functionality. We begin with a simple yet novel attack on PSU that fully reconstructs the intersection using only two protocol invocations and forms the conceptual foundation for our more complex attacks. We also show that any attack on PSI-Cardinality, such as that of Guo et al. (USENIX 2023), lifts to an attack on PSU-CA that recovers the intersection with only three additional queries. For the MKPM protocol, we distinguish its intended matching functionality from the protocol-specific leakage, give an attack against the intended functionality, and then show that exploiting the additional leakage enables even stronger attacks, including partial reconstruction of the other party’s records from a single protocol invocation. We conclude by discussing possible mitigations for deploying such systems. Our analysis demonstrates limitations of existing secure multi-party computation security definitions and highlights the real-world privacy risks associated with deploying these functionalities in practice.

Read PDF

Similar papers

Open access Jul 2026

ORQ: Scaling Complex Multiparty Computations to Large Private Datasets

Orq protects data against semi-honest or malicious parties and can efficiently evaluate relational queries with multi-way joins and aggregations that have been considered notoriously expensive under MPC.

Eli Baum, Sam Buxbaum, Nitin Mathai et al. · 1 citation
Conference Jul 2026

VOLE-CPSI Meets Paillier Aggregation: Practical Private Intersection Cardinality with Linear-Scale Performance

Private set intersection (PSI) and its circuit variant (Circuit-PSI, CPSI) are core tools for privacy-preserving analytics. Unlike plain PSI that directly reveals intersecting elements, CPSI outputs secret shares of intersection indicators (and associated-value shares), which can be reused in subsequent MPC tasks witho...

Hai Zhang, Yi-Yun Guo, Li-Yan Shang et al. · 0 citations
Preprint Aug 2026

Revisiting Continuous Noise Sampling for Multi-Party Differential Privacy

This paper revisits the continuous noise sampling protocols and makes several improvements in both security and efficiency and turns to discrete sampling at the granularity of individual biased bits to address the security and efficiency issues together.

Yu-Cheng Fu, Tianhao Wang · 1 citation
Jul 2026

Zero-Knowledge Proof of Progress: Secure Multi-Phase Capture-the-Flag Competitions

Existing Capture-the-Flag (CTF) platforms trust a single organizer, offer limited auditability, and are vulnerable to infrastructure-level manipulation. We propose zk–MPSFV, a zk-SNARK-based, multi-phase sub-flag verification scheme that replaces centralized scoring with an on-chain, zero-knowledge, publicly verifiable...

S. Khanji, Behzad Abdolmaleki, John A. Clark et al. · 0 citations
Preprint Aug 2026

Structural Leakage in Graph Encryption: Attacks and Defenses

This report systematically presents attack methodologies, defense mechanisms, security proofs, and experimental evaluations on seven real-world datasets as well as introducing BlindGES, an enhanced scheme incorporating a Merge-and-Divide mechanism and two-level multimap index that reduces one-to-one mappings to below 2...

Hua Shen, Ren-Zhi Chen, Ge Wu et al. · 0 citations
Open access Jul 2026

Optimizing and Implementing Threshold MAYO

This work presents a practical t-out-of-n threshold variant and emulation of MAYO, a post-quantum signature candidate to NIST’s call for additional signatures, and proposes a unified protocol framework that integrate these techniques, plus other MPC specific optimizations, with the goal of minimizing online latency.

Diego F. Aranha, Giacomo Borin, Sofía Celi et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.