Skip to main content
SpringerLink
Log in

A novel quantum private set intersection scheme with a semi-honest third party

  • Published:
Quantum Information Processing Aims and scope Submit manuscript

Abstract

In this paper, we propose a novel scheme with a semi-honest third party (TP) to compute the intersection of two parties’ sets privately. In our scheme, two groups of particles are firstly prepared by TP and then transmitted circularly among TP and two participants who need the intersection of their private sets. The two participants then perform the unitary operations on their received particles according to an initial encoding rule for their private sets, respectively, to help TP to obtain the result. We analyse the security of our scheme and show that it can resist both outside and inside attacks over ideal and noisy quantum channels. In addition, our scheme is feasible with current quantum technologies as it only requires simple quantum resources and operations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Data availability

Data sharing is not applicable to this article as no datasets were generated or analysed during the current study.

References

  1. Yao, Andrew C.: Protocols for secure computations. In: 23rd annual symposium on foundations of computer science (sfcs 1982), pp. 160–164. IEEE, (1982)

  2. Shamir, Adi: How to share a secret. Commun. ACM 22(11), 612–613 (1979)

    Article  MathSciNet  Google Scholar 

  3. Chen, Xiaoxiao, Lou, Xiaoping: An efficient verifiable quantum secret sharing scheme via quantum walk teleportation. Int. J. Theor. Phys. 61(4), 99 (2022)

    Article  MathSciNet  Google Scholar 

  4. Jiang, Shaohua, Liu, Zehong, Lou, Xiaoping, Fan, Zhou, Wang, Sheng, Shi, Jinjing: Efficient verifiable quantum secret sharing schemes via eight-quantum-entangled states. Int. J. Theor. Phys. 60, 1757–1766 (2021)

    Article  MathSciNet  Google Scholar 

  5. Khorrampanah, Mahsa, Houshmand, Monireh: Effectively combined multi-party quantum secret sharing and secure direct communication. Opt. Quantum Electron. 54(4), 213 (2022)

    Article  Google Scholar 

  6. Chor, Benny, Kushilevitz, Eyal, Goldreich, Oded, Sudan, Madhu: Private information retrieval. J. ACM (JACM) 45(6), 965–981 (1998)

    Article  MathSciNet  Google Scholar 

  7. Gao, Fei, Qin, SuJuan, Huang, Wei, Wen, QiaoYan: Quantum private query: a new kind of practical quantum cryptographic protocol. Sci. China Phys. Mech. Astron. 62, 1–12 (2019)

    Article  Google Scholar 

  8. Xiao, Min, Lei, Shumei: Quantum private query with authentication. Quantum Inf. Process. 20, 1–13 (2021)

    Article  MathSciNet  Google Scholar 

  9. Freedman, Michael J., Nissim Kobbi, Pinkas Benny. Efficient private matching and set intersection. In: Advances in Cryptology-EUROCRYPT 2004: international conference on the theory and applications of cryptographic techniques, Interlaken, Switzerland. Proceedings 23, pp. 1–19. Springer, (2004)

  10. Mu-En, Wu., Chang, Shih-Ying., Chi-Jen, Lu., Sun, Hung-Min.: A communication-efficient private matching scheme in client-server model. Inf. Sci. 275, 348–359 (2014)

    Article  MathSciNet  Google Scholar 

  11. Hazay, Carmit: Oblivious polynomial evaluation and secure set-intersection from algebraic PRFS. J. Cryptol. 31(2), 537–586 (2018)

    Article  MathSciNet  Google Scholar 

  12. Shi, Run-hua, Yi, Mu., Zhong, Hong, Cui, Jie, Zhang, Shun: An efficient quantum scheme for private set intersection. Quantum Inf. Process. 15, 363–371 (2016)

    Article  ADS  MathSciNet  Google Scholar 

  13. Liu, Wen, Yin, Han-Wen.: A novel quantum protocol for private set intersection. Int. J. Theor. Phys. 60(6), 2074–2083 (2021)

    Article  MathSciNet  Google Scholar 

  14. Cheng, Xiaogang, Guo, Ren, Chen, Yonghong: Cryptanalysis and improvement of a quantum private set intersection protocol. Quantum Inf. Process. 16, 1–8 (2017)

    Article  ADS  MathSciNet  Google Scholar 

  15. Maitra, Arpita: Quantum secure two-party computation for set intersection with rational players. Quantum Inf. Process. 17, 1–21 (2018)

    Article  MathSciNet  Google Scholar 

  16. Debnath, S.K., Dey, K., Kundu, N., Choudhury, T.: Feasible private set intersection in quantum domain. Quantum Inf. Process. 20, 1–11 (2021)

    Article  ADS  MathSciNet  Google Scholar 

  17. Liu, Wen-Jie., Li, Wen-Bo., Wang, Hai-Bin.: An improved quantum private set intersection protocol based on Hadamard gates. Int. J. Theor. Phys. 61(3), 53 (2022)

    Article  MathSciNet  Google Scholar 

  18. Shor Peter W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th annual symposium on foundations of computer science, pp. 124–134. IEEE, (1994)

  19. Grover Lov K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pp. 212–219, (1996)

  20. Shi, Run-hua, Yi, Mu., Zhong, Hong, Cui, Jie, Zhang, Shun: Two quantum protocols for oblivious set-member decision problem. Sci. Rep. 5(1), 1–9 (2015)

    Article  Google Scholar 

  21. Liu, Bai, Zhang, Mingwu, Shi, Runhua: Quantum secure multi-party private set intersection cardinality. Int. J. Theor. Phys. 59, 1992–2007 (2020)

    Article  MathSciNet  Google Scholar 

  22. Wang, Yongli, Peichu, Hu., Qiuliang, Xu.: Quantum protocols for private set intersection cardinality and union cardinality based on entanglement swapping. Int. J. Theor. Phys. 60, 3514–3528 (2021)

    Article  MathSciNet  Google Scholar 

  23. Zeng Guihua. Trojan horse attacking strategy on quantum cryptography. In: The Physics Of Communication, pp. 495–502. World Scientific, (2003)

Download references

Acknowledgements

This work was supported by the Guangdong Basic and Applied Basic Research Foundation (Grant No. 2021A1515011985), the National Natural Science Foundation of China (Grant No. 61902132), the Guangdong Basic and Applied Basic Research Foundation (Grant No. 2022A1515140116) and the National Natural Science Foundation of China (Grant No. 61872152).

Author information

Authors and Affiliations

  1. College of Mathematics and Informatics, South China Agricultural University, Guangzhou, 510642, China

    Yumeng Chen, Haozhen Situ, Qiong Huang & Cai Zhang

Authors
  1. Yumeng Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haozhen Situ
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Qiong Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Cai Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Cai Zhang.

Ethics declarations

Conflict of interest

The authors declare they have no competing interests.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, Y., Situ, H., Huang, Q. et al. A novel quantum private set intersection scheme with a semi-honest third party. Quantum Inf Process 22, 429 (2023). https://doi.org/10.1007/s11128-023-04195-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11128-023-04195-8

Keywords

Search

Navigation