Next Article in Journal
Can AI See the Unseen? Measuring the Perception Gap for Tibetan Cultural Symbols in AI-Generated Art
Previous Article in Journal
A Hybrid Machine Learning Approach for Cyberattack Detection and Classification in SCADA Systems: A Hydroelectric Power Plant Application
Previous Article in Special Issue
A Unified Fault-Tolerant Batch Authentication Scheme for Vehicular Networks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Article

Post-Quantum Private Set Intersection with Ultra-Efficient Online Performance

1
School of Cyber Science and Technology, Beihang University, Beijing 100191, China
2
Beijing Institute of Mathematical Sciences and Applications, Beijing 101408, China
3
Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China
4
School of Mathematics and Physics, Xi’an Jiaotong-Liverpool University, Suzhou 215123, China
*
Author to whom correspondence should be addressed.
Electronics 2026, 15(1), 13; https://doi.org/10.3390/electronics15010013
Submission received: 14 November 2025 / Revised: 13 December 2025 / Accepted: 15 December 2025 / Published: 19 December 2025
(This article belongs to the Special Issue Cryptography and Computer Security)

Abstract

While tremendous progress has been made towards achieving highly efficient and practical Private Set Intersection (PSI) protocols during the last decade, the development of post-quantum PSI is still far from satisfactory. Existing post-quantum PSI protocols encounter a dilemma: while those based on fully homomorphic encryption (FHE) achieve low online communication, they suffer from significant online computation; conversely, protocols based on post-quantum Oblivious Pseudorandom Functions (OPRFs) exhibit excellent online computational performance but incur substantially high online communication. To overcome this dilemma, we present a lattice-based PSI protocol that achieves optimal online performance in both communication and computation. Our solution introduces two core innovations: a robust signal comparison algorithm based on RLWE key exchange, which determines the intersection through signal consistency rather than direct shared key comparison, and an optimized Oblivious Key–Value Stores (OKVS) implementation featuring a composite key–value mapping for efficient handling of high-dimensional RLWE polynomials. We implement the protocol and conduct extensive benchmarks in both symmetric and asymmetric set-size settings. The results show that our construction achieves the lowest online overhead in both computation and communication among all tests. For example, with asymmetric set sizes (212,11041), the online phase requires only 0.132 s, yielding 19× and 282× improvements over FHE-based (CCS’21) and OPRF-based (EUROCRYPT’25) protocols, respectively. Even at (224,11041), our online communication time is only 0.201 s, which is 226× and 184× that of FHE-based and OPRF-based PSI, respectively. Additionally, our online communication overhead is the lowest in all tests; however, this comes at the cost of heavy offline communication overhead for very large set sizes, revealing a clear trade-off between pre-computation and online efficiency. This work addresses a critical gap in post-quantum PSI by delivering a protocol that achieves balanced online communication and computational overhead, thereby enabling broader practical deployment.
Keywords: private set intersection; post-quantum key exchange; signal comparing algorithm private set intersection; post-quantum key exchange; signal comparing algorithm

Share and Cite

MDPI and ACS Style

Qin, Y.; Liang, B.; Cai, H.; Ding, J. Post-Quantum Private Set Intersection with Ultra-Efficient Online Performance. Electronics 2026, 15, 13. https://doi.org/10.3390/electronics15010013

AMA Style

Qin Y, Liang B, Cai H, Ding J. Post-Quantum Private Set Intersection with Ultra-Efficient Online Performance. Electronics. 2026; 15(1):13. https://doi.org/10.3390/electronics15010013

Chicago/Turabian Style

Qin, Yue, Bei Liang, Hongyuan Cai, and Jintai Ding. 2026. "Post-Quantum Private Set Intersection with Ultra-Efficient Online Performance" Electronics 15, no. 1: 13. https://doi.org/10.3390/electronics15010013

APA Style

Qin, Y., Liang, B., Cai, H., & Ding, J. (2026). Post-Quantum Private Set Intersection with Ultra-Efficient Online Performance. Electronics, 15(1), 13. https://doi.org/10.3390/electronics15010013

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop