Skip to content
Conference

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

Jul 2026 · International Conference on Computer Communications and Networks · pp. 1-6 · 0 citations · 19 references

Abstract

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 without disclosing element-level membership. This paper presents a practical two-stage framework for secure intersection cardinality: we instantiate CPSI following VOLE-PSI, then compute |X ∩Y| via Paillier-based homomorphic aggregation over CPSI indicator shares. The contribution is primarily a systems-oriented composition and analysis of these building blocks, with element-level privacy preserved and only the final aggregate cardinality revealed to the receiver.We provide a complete protocol description, a correctness argument, a complexity analysis, and a semi-honest simulation-based security discussion. We further present an experimental evaluation covering protocol breakdown, scalability, and several clearly labeled derived/estimated scenario tables. The results show clear scaling up to 220-level set sizes and identify the main practical bottlenecks, including ciphertext expansion and communication-aware batching. Overall, the framework offers an implementable and extensible solution for privacy-preserving cardinality analytics in realistic two-party settings.

View source

Similar papers

Open access Aug 2026

PrivFuzz: Privacy-Preserving Distributed Fuzzing for CPS-Facing Parsing Components on Untrusted Clients

PrivFuzz allows organizations and individuals to collaborate and receive rewards while keeping fuzzing seeds confidential and enabling controlled encrypted seed reuse among untrusted fuzzing nodes, and the key idea is to combine trusted execution environments (TEEs) with blockchain-based smart contracts to support conf...

Zhe Chen, Xiaohan Zhang, Ning Zhang et al. · 0 citations
Preprint Sep 2026

Fresh-Challenge VDF Attestations for Model-Relative Response Latency

Can a finite verifier obtain public, model-relative evidence about response latency for sequential computation? Verifiable delay functions (VDFs) make this possible in principle: evaluation requires T sequential steps, whereas verification is efficient in the security parameter and polylogarithmic in the numerical valu...

Ansar Yesmukhanov, Aruzhan Tlessova · 0 citations
#artificial intelligence Preprint Aug 2026

Selection-Invariant Communication Compilers for Privacy-Aware Multi-Agent LLM Workflows

Structured multi-agent workflows exchange intermediate messages whose content and form can reveal private state even when the final output is safe. We identify selection-channel leakage: after authorization fixes what may be released, a private-state-aware choice among semantically valid realizations creates an additio...

Jing-Heng Xu, Long-Ze Fan, Ze-Yuan Wang et al. · 0 citations
Open access Sep 2026

Task-Bound Authorization and Compliance Auditing with Quantum-Safe Task Passports for Privacy-Preserving Computation in Trusted Data Spaces

This work presents a task-bound lifecycle and state model instantiated by a quantum-safe task passport (QTP) that binds purpose, scope, computation type, participants, validity, evidence-key metadata, and an initial governed-resource profile.

Si-Hang Qin, Yu-Rou Wu, Jie-Ling Wen et al. · 0 citations

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