Paper 2016/216

Fair mPSI and mPSI-CA: Efficient Constructions in Prime Order Groups with Security in the Standard Model against Malicious Adversary

Sumit Kumar Debnath and Ratna Dutta

Abstract

In this paper, we propose a construction of fair and efficient mutual Private Set Intersection (mPSI) with linear communication and computation complexities, where the underlying group is of prime order. The main tools in our approach include: (i) ElGamal and Distributed ElGamal Cryptosystems as multiplicatively Homomorphic encryptions, (ii) Cramer-Shoup Cryptosystem as Verifiable encryption. Our mPSI is secure in standard model against malicious parties under Decisional Diffie-Hellman (DDH) assumption. Fairness is achieved using an off-line semi-trusted arbiter. Further, we extend our mPSI to mutual Private Set Intersection Cardinality (mPSI-CA) retaining all the security properties of mPSI. More interestingly, our mPSI-CA is the first fair mPSI-CA with linear complexity.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint.
Keywords
mPSImPSI-CAmalicious adversaryfairnesssemi-trusted arbiter
Contact author(s)
sd iitkgp @ gmail com
History
2016-02-29: received
Short URL
https://ia.cr/2016/216
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2016/216,
      author = {Sumit Kumar Debnath and Ratna Dutta},
      title = {Fair mPSI and mPSI-CA: Efficient Constructions in Prime Order Groups with Security in the Standard Model against Malicious Adversary},
      howpublished = {Cryptology ePrint Archive, Paper 2016/216},
      year = {2016},
      note = {\url{https://eprint.iacr.org/2016/216}},
      url = {https://eprint.iacr.org/2016/216}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.