An Efficient PSI-CA Protocol Under the Malicious Model.

Jingjie Liu; Suzhen Cao; Caifen Wang; Chenxu Liu

Private set intersection cardinality (PSI-CA) is a typical problem in the field of secure multiparty computation, which enables two parties calculate the cardinality of intersection securely without revealing any information about their sets. And it is suitable for private data protection scenarios where only the cardinality of the set intersection needs to be calculated. However, most of the currently available PSI-CA protocols only meet the security under the semi-honest model and can't resist the malicious behaviors of participants. To solve the problems above, by the application of the variant of Elgamal cryptography and Bloom filter, we propose an efficient PSI-CA protocol with high security. We also present two new operations on Bloom filter called IBF and BIBF, which could further enhance the safety of private data. Using zeroknowledge proof to ensure the safety under malicious adversary model. Moreover, in order to minimize the error in the results caused by the false positive problem, we use Garbled Bloom Filter and key-value pair packing creatively and present an improved PSI-CA protocol. Through experimental comparison with several existing representative protocols, our protocol runs with linear time complexity and more excellent characters, which is more suitable for practical application scenarios.

INTERNATIONAL Boxing Federation (IBF); TIME complexity; DATA protection; QUANTUM cryptography; PROBLEM solving; CRYPTOGRAPHY

KSII Transactions on Internet & Information Systems, 2024, Vol 18, Issue 3, p720

1976-7277

Academic Journal

10.3837/tiis.2024.03.011