Skip to content

Cloud-Assisted Verifiable Threshold PSI for Unbalanced Sets With Application to Financial Fraud Detection

Sep 2026 · IEEE Internet of Things Journal · Vol 13, pp. 43636-43651 · 0 citations · 38 references

Abstract

As a critical security function in the financial sector, fraud detection is commonly carried out with support from third-party risk control agencies. However, traditional detection methods risk leaking users’ private information. In this work, we implement financial fraud detection using threshold private set intersection (TPSI), enabling secure, cross-institutional sharing and matching of risk information while protecting user privacy. In addition, considering the imbalance in set sizes between the sender and receiver, we design two cloud server-assisted verifiable TPSI protocols that decouple the receiver’s computational overhead from the cardinality of the sender’s set, thereby significantly reducing the computational burden. Furthermore, to address the potential presence of malicious cloud server-assisted, we incorporate verification mechanisms to ensure the security of protocol execution and the correctness of results. Broadly speaking, we outsource the primary computational tasks of the receiver, including the oblivious key–value store (OKVS) decoding operation and secret polynomial reconstruction, to the cloud servers, which then interacts with the sender to perform calculations and, finally, returns the results to the receiver for verification. Moreover, to further improve the protocol’s computational efficiency, we employ cuckoo hashing and simple hashing to preprocess both parties’ sets. Finally, we conduct experimental and theoretical analyses of the security and efficiency of the two protocols. The results demonstrate that the single-server approach significantly enhances computational and communication efficiency while maintaining security, compared to the dual-server approach.

View source

Similar papers

Open access Aug 2026

Practical Verifiable Multi-Key Searchable Encryption with Optimal Overhead

A novel VMKSE scheme (VMKSE-BFF) is presented by adopting BFF, which can simultaneously support verifiability of and secure data sharing in a multi-user setting and a comparison with the existing VMKSE schemes is provided.

Yandong Su, Bing-Hang Wang, Yan-Jie Xiang et al. · 0 citations
Open access Aug 2026

Integrity Checking Mechanism for PrivacyPreserved Auditing of Cloud Shared-Data

A viable, privacy-friendly auditing framework of clouds which guarantees the end-toend encrypted verification without sacrificing the efficiency is presented.

Deepshikha Chaturvedi, Vidyullata Devmane, S. Radke et al. · 0 citations
Open access Sep 2026

Enhanced private set union from secret-shared private membership test

Private Set Union (PSU) is a critical cryptographic tool, but designing protocols that are efficient and secure against recent threats, such as during-execution leakage, remains a challenge. The dominant approach to avoid such leakage is over Cuckoo hashing paradigm, which has led to increasingly complex designs that...

Sang-Min Lee, Jiseung Kim, Yong-Ha Son · 0 citations
Open access 2026

Privacy-Preserving and Byzantine-Robust Federated Learning With Mean-Constrained Secret Sharing

Federated learning faces three critical challenges in enabling cross-institutional collaboration: privacy leakage, poisoning by malicious clients, and unverifiable aggregation results. To address these issues in a unified manner, we propose PVeriFL—a federated learning framework that integrates privacy preservation, By...

Guang-Ye Zhu, Liqiang Wu, Ke-Qian Liu · 0 citations
Open access Aug 2026

Paras: Actively Secure Two-Server Private Histograms

Paras, the first two-server protocol for private histogram computation that achieves robustness against collusion between a malicious server and arbitrarily many malicious clients is presented, and is shown to be highly efficient and scalable.

Dimitris Mouris, Lucas Piske, Pratik Sarkar 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.