Quantum private computation of cardinality of set intersection and union

  • Run-hua ShiEmail author
Regular Article


Private Set Intersection Cardinality (PSI-CA) and Private Set Union Cardinality (PSU-CA) are cryptographic tasks whose goals are to compute the cardinalities of the intersection and the union of two private sets, respectively. There are lots of important and practical applications of PSI-CA and PSU-CA, such as privacy-preserving data mining and data analysis. The existing classical PSI-CA and PSU-CA protocols could not resist the attacks of quantum computers. In this article, we present a novel quantum approach to solve the PSI-CA and PSU-CA problems based on the principle of quantum mechanics, which can resist well-known quantum attacks. The proposed protocols take Bell states as quantum resources and only need to apply simple single-particle operators and Bell-based measurements. Therefore, it is feasible to implement these protocols with the present technology.

Graphical abstract


Quantum Information 


  1. 1.
    R.H. Shi, Y. Mu, H. Zhong, S. Zhang, J. Cui, Inform. Sci. 370–371, 147 (2016) CrossRefGoogle Scholar
  2. 2.
    M.E. Wu, S.Y. Chang, C.J. Lu, H.M. Sun, Inform. Sci. 275, 348 (2014) MathSciNetCrossRefGoogle Scholar
  3. 3.
    M.J. Freedman, K. Nissim, B. Pinkas, Efficient private matching and set intersection, in Advances in Cryptology: EUROCRYPT 2004, LNCS 3027 (Springer, Berlin, 2004), pp. 1–19 Google Scholar
  4. 4.
    E.D. Cristofaro, P. Gasti, G. Tsudik, Fast and private computation of cardinality of set intersection and union, in Proceedings of the Cryptology and Network Security (CANC 2010), LNCS 7712 (Springer, Berlin, 2012), pp. 218–231 Google Scholar
  5. 5.
    L. Kissner, D. Song, Privacy-preserving set operations, in Advances in Cryptology: Crypto 2005, LNCS 3621 (Springer, Berlin, 2005), pp. 241–257 Google Scholar
  6. 6.
    J. Vaidya, C. Clifton, J. Comput. Secur. 13, 593 2005 Google Scholar
  7. 7.
    S. Zander, L.L.H. Andrew, G. Armitage, Scalable Private Set Intersection Cardinality for Capture-Recapture with Multiple Private Datasets, 2013, /CAIA-TR-130930A.pdf
  8. 8.
    S.K. Debnath, R. Dutta, Secure and efficient private set intersection cardinality using bloom filter, in Proceedings of the Information Security (ISC 2015), LNCS 9290 (Springer, Berlin, 2015), pp. 209–226 Google Scholar
  9. 9.
    P.W. Shor, Algorithms for quantum computation: discrete logarithms and factoring, in Proceedings of the 35th Annual Symposium on the Foundations of Computer Science (IEEE, Piscataway, NJ, 1994), pp. 124–134 Google Scholar
  10. 10.
    L.K. Grover, A fast quantum mechanical algorithm for database search, in Proceedings of the 28th Annual ACM Symposium on Theory of Computing (ACM, New York, 1996), pp. 212–219 Google Scholar
  11. 11.
    H.K. Lo, Phys. Rev. A 56, 1154 (1997) ADSCrossRefGoogle Scholar
  12. 12.
    R. Colbeck, Phys. Rev. A 76, 062308 (2007) ADSCrossRefGoogle Scholar
  13. 13.
    H. Buhrman, M. Christandl, C. Schaffner, Phys. Rev. Lett. 109, 160501 (2012) ADSCrossRefGoogle Scholar
  14. 14.
    R.H. Shi, Int. J. Theor. Phys. 56, 1208 (2017) CrossRefGoogle Scholar
  15. 15.
    C.H. Bennett, G. Brassard, Quantum cryptography: public key distribution and coin tossing, in Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing (IEEE, New York, 1984), pp. 175–179 Google Scholar
  16. 16.
    R.H. Shi, Y. Mu, H. Zhong et al. Phys. Rev. A 94, 066301 (2016) ADSCrossRefGoogle Scholar

Copyright information

© EDP Sciences, SIF, Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.School of Control and Computer Engineering, North China Electric Power UniversityBeijing CityP.R. China

Personalised recommendations