Secure Computation of Private Set Intersection Cardinality With Linear Complexity

View Sample PDF

Author(s): Sumit Kumar Debnath (National Institute of Technology Jamshedpur, India)
Copyright: 2019
Pages: 39
Source title: Cryptographic Security Solutions for the Internet of Things
Source Author(s)/Editor(s): Mohammad Tariq Banday (University of Kashmir, India)
DOI: 10.4018/978-1-5225-5742-5.ch006

Keywords: Cryptography / Cyber and Network Security / Information Science Reference / Security & Forensics

Purchase

View Secure Computation of Private Set Intersection Cardinality With Linear Complexity on the publisher's website for pricing and purchasing information.

Abstract

PSI and its variants play a major role when the participants want to perform secret operations on their private data sets. The importance of this chapter is twofold. In the first phase, the author presents a size-hiding PSI-CA protocol followed by its authorized variant, APSI-CA, utilizing Bloom filter. All these constructions are proven to be secure in standard model with linear complexity. In the second phase, the author employs Bloom filter to design an efficient mPSI-CA protocol. It achieves fairness using offline semi-trusted third party (arbiter) unlike the most efficient existing protocols. The arbiter is semi-trusted in the sense that he does not have access to the private information of the entities while he will follow the protocol honestly. Proposed mPSI-CA is proven to be secure against malicious adversaries in the random oracle model (ROM) under the decisional Diffie-Hellman (DDH) assumption. It achieves linear complexity.

The IRMA Community

Research IRM

Secure Computation of Private Set Intersection Cardinality With Linear Complexity

Purchase

Abstract

Related Content

IRMA Sponsors