Paper 2023/476

A private set intersection protocol based on multi-party quantum computation for greatest common divisor

Muhammad Imran, Budapest University of Technology and Economics
Abstract

Private set intersection (PSI) is a cryptographic primitive that allows two or more parties to learn the intersection of their input sets and nothing else. In this paper, we present a private set intersection protocol based on a new secure multi-party quantum protocol for greatest common divisor (GCD). The protocol is mainly inspired by the recent quantum private set union protocol based on least common multiple by Liu, Yang, and Li. Performance analysis guarantees the correctness and it also shows that the proposed protocols are completely secure in semi-honest model. Moreover, the complexity is proven to be efficient (poly logarithmic) in the size of the input sets.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
Multi-party quantum computationGreatest common divisorQuantum private set intersectionprivacy-preserving matching
Contact author(s)
mimran @ math bme hu
History
2023-07-04: revised
2023-04-02: received
See all versions
Short URL
https://ia.cr/2023/476
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2023/476,
      author = {Muhammad Imran},
      title = {A private set intersection protocol based on multi-party quantum computation for greatest common divisor},
      howpublished = {Cryptology {ePrint} Archive, Paper 2023/476},
      year = {2023},
      url = {https://eprint.iacr.org/2023/476}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.