Post‐quantum protocol for computing set intersection cardinality with linear complexity. (1st November 2020)

• Record Type: Journal Article
• Authors: Debnath, Sumit Kumar; Stănică, Pantelimon; Choudhury, Tanmay; Kundu, Nibedita
• Is Part Of: IET information security. Volume 14:Number 6(2020)
• Page Start: 661
• Page End: 669
• Publication Date: 2020-11-01
• Subjects: data structures -- public key cryptography -- cryptography -- cryptographic protocols -- quantum computing -- data privacy; post‐quantum protocol -- intersection cardinality -- linear complexity -- electronic information increases -- mutually distrustful parties -- private set intersection -- secret operations -- input sets -- modern public key cryptosystems -- number theoretic problems -- lattice‐based cryptographic constructions -- quantum computer -- lattice based cryptosystem -- size‐hiding post quantum PSI cardinality protocol whose complexity -- authors -- authorised PSI‐CA; Computer security -- Periodicals; Cryptography -- Periodicals; Computer networks -- Security measures -- Periodicals; Database security -- Periodicals; 005.8
• DOI: 10.1049/iet-ifs.2019.0315
• Languages: English
• ISSNs: 1751-8709

Abstract

Abstract : Nowadays, the necessity of electronic information increases rapidly. As a consequence, often, that information needs to be shared among mutually distrustful parties. In this area, private set intersection (PSI) and its variants play an important role when the participants wish to do secret operations on their input sets. Unlike the most modern public key cryptosystems relying on number theoretic problems, lattice‐based cryptographic constructions provide security in the presence of a quantum computer. Consequently, developing PSI and its variants using lattice based cryptosystem becomes an interesting direction for research. This study presents the first size‐hiding post quantum PSI cardinality (PSI‐CA) protocol whose complexity is linear in the size of the sets of the participants. The authors use space‐efficient probabilistic data structure (Bloom filter) as its building block. Further, they extend the authors' PSI‐CA to its authorised version, i.e. authorised PSI‐CA. Security for both of them is achieved in the standard model based on the hardness of the decisional learning with errors problem.