Skip to main content
SpringerLink
Log in

An efficient quantum scheme for Private Set Intersection

  • Published:
Quantum Information Processing Aims and scope Submit manuscript

Abstract

Private Set Intersection allows a client to privately compute set intersection with the collaboration of the server, which is one of the most fundamental and key problems within the multiparty collaborative computation of protecting the privacy of the parties. In this paper, we first present a cheat-sensitive quantum scheme for Private Set Intersection. Compared with classical schemes, our scheme has lower communication complexity, which is independent of the size of the server’s set. Therefore, it is very suitable for big data services in Cloud or large-scale client–server networks.

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

References

  1. Freedman, M.J., Nissim, K., Pinkas, B.: Efficient Private Matching and Set Intersection. In Proc. of EUROCRYPT, LNCS 3027, (Interlaken, Switzerland, 2004) 1–19 (2004)

  2. Wu, M.E., Chang, S.Y., Lu, C.J., Sun, H.M.: A communication-efficient private matching scheme in Client-Server model. Inform. Sci. 275(10), 348–359 (2014)

    Article  MathSciNet  Google Scholar 

  3. De Cristofaro, E., Tsudik, G.: Fast and private computation of cardinality of set intersection and union. In Proceedings of Financial Crypto, LNCS 6052, (Canary Islands, Spain, 2010) pp. 143–159 (2010)

  4. Zhan, J., Cabrera, L., Osman, G., Shah, R.: Using private matching for securely querying genomic sequences. In Proceedings of IEEE Third International Conference on Privacy, Security, Risk and Trust (passat) and Third International Conference On Social Computing (socialcom), (IEEE 2011) pp. 1163–1168 (2011)

  5. Li, Y., Tygar, J., Hellerstein, J.: Private matching. In: Proceedings of Computer Security in the 21st Century, pp 25–50 (2005)

  6. Chun, J.Y., Hong, D., Jeong, I.R., Lee, D.H.: Privacy-preserving disjunctive normal form operations on distributed sets. Inform. Sci. 231(10), 113–122 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  7. Pervez, Z., Awan, A.A., Khattak, A.M., Lee, S., Huh, E.N.: Privacy-aware searching with oblivious term matching for cloud storage. J. Supercomput. 63(2), 538–560 (2013)

    Article  Google Scholar 

  8. Narayanan, A., Thiagarajan, N., Lakhani, M., Hamburg, M., Boneh, D.: Location privacy via private proximity testing. In Proceedings of the Network and Distributed System Security Symposium (NDSS 2011), (San Diego, CA, USA), (2011)

  9. Bursztein, E., Hamburg, M., Lagarenne, J., Boneh, D.: Openconflict: preventing real time map hacks in online games. In: Proceedings of IEEE S&P 2011, pp 506–520 (2011)

  10. Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In: Proceedings of Theory of Cryptography Conference (TCC), LNCS 4948, (New York, USA, 2008), pp 155–175 (2008)

  11. Liu, L., Cao, Z.: Private matching protocols without error probability. In: Proceedings of the IEEE International Conference on Computer Science and Automation Engineering (CSAE), vol. 4, (IEEE, 2011) pp. 363–366 (2011)

  12. Marconi, L., Conti, M., Di Pietro, R.: Cassandra: a probabilistic, efficient, and privacy-preserving solution to compute set intersection. Int. J. Inform. Secur. 10(5), 1–19 (2011)

    Google Scholar 

  13. Kerschbaum, F.: Outsourced private set intersection using homomorphic encryption. Proc. ACM ASIACCS 2012, 85–86 (2012)

    Google Scholar 

  14. Cristofaro, E.D., Tsudik, G.: Experimenting with fast private set intersection. In Proceedings of the 5th International Conference on Trust and Trustworthy Computing (TRUST 2012), LNCS 7344, pp. 55–73 (2012)

  15. Shao, Z.Y., Yan, B.: Private set intersection via public key encryption with keywords search. Secur. Commun. Netw. 8(3), 396–402 (2015)

    Article  Google Scholar 

  16. Barnum, H., Cr’epeau, C., Gottesman, D., Smith, A. and Tapp, A.: Authentication of quantum messages. In: Proceedings of 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 449–458 (2002)

  17. Aharonov, D., Ben-Or, M. and Eban, E.: Interactive proofs for quantum computations. In: Proceedings of Innovations in Computer Science, arXiv:0810.5375 (2008)

  18. Grover, L. K: A fast quantum mechanical algorithm for database search. In: Proceedings of 28th Annual ACM Symposium on Theory of Computing, pp. 212–219 (1996)

  19. Giovannetti, V., Lloyd, S., Maccone, L.: Quantum private queries. Phys. Rev. Lett. 100(23), 230502 (2008)

    Article  MathSciNet  ADS  Google Scholar 

  20. Olejnik, L.: Secure quantum private information retrieval using phase-encoded queries. Phys. Rev. A 84(2), 022313 (2011)

    Article  ADS  Google Scholar 

  21. Li, Y.B., Wen, Q.Y., Li, Z.C., Qin, S.J., Yang, Y.T.: Cheat sensitive quantum bit commitment via pre- and post- selected quantum states. Quantum Inf. Process. 13(1), 141–149 (2014)

    Article  MATH  ADS  Google Scholar 

  22. Li, Y.B., Qin, S.J., Yuan, Z., Huang, W., Sun, Y.: Quantum private comparison against decoherence noise. Quantum Inf. Process. 12(6), 2191–2205 (2013)

    Article  MATH  MathSciNet  ADS  Google Scholar 

  23. Li, Y.B., Wang, T.Y., Chen, H.Y., Li, M.D., Yang, Y.T.: Fault-tolerate quantum private comparison based on GHZ states and ECC. Int. J. Theory Phys. 52(8), 2818–2825 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  24. Yu, K.F., Yang, C.W., Liao, C.H., Hwang, T.: Authenticated semi-quantum key distribution protocol using Bell states. Quantum Inf. Process. 13(6), 1457–1465 (2014)

    Article  MathSciNet  ADS  Google Scholar 

  25. Guan, D.J., Wang, Y.J., Zhuang, E.S.: A practical protocol for three-party authenticated quantum key distribution. Quantum Inf. Process. 13(11), 2355–2374 (2014)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

This work was supported by National Natural Science Foundation of China (Nos. 61173187, 61173188, and 11301002), the Ministry of Education Institution of Higher Learning Doctor Discipline and Scientific Research Fund aids a project financially (No. 20133401110004), Natural Science Foundation of Anhui Province (Nos. 11040606M141 and 1408085QF107), and the 211 Project of Anhui University (Nos. 33190187 and 17110099).

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Anhui University, Hefei City, 230601, China

    Run-hua Shi, Hong Zhong, Jie Cui & Shun Zhang

  2. Centre for Computer and Information Security Research, School of Computing and Information Technology, University of Wollongong, Wollongong, NSW, 2522, Australia

    Run-hua Shi & Yi Mu

Authors
  1. Run-hua Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yi Mu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hong Zhong
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jie Cui
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Shun Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Run-hua Shi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shi, Rh., Mu, Y., Zhong, H. et al. An efficient quantum scheme for Private Set Intersection. Quantum Inf Process 15, 363–371 (2016). https://doi.org/10.1007/s11128-015-1165-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11128-015-1165-z

Keywords

Search

Navigation