{"id":117275,"date":"2020-12-17T19:22:21","date_gmt":"2020-12-18T03:22:21","guid":{"rendered":"https:\/\/lifeboat.com\/blog\/2020\/12\/three-party-quantum-private-computation-of-cardinalities-of-set-intersection-and-union-based-on-ghz-states"},"modified":"2020-12-17T19:22:21","modified_gmt":"2020-12-18T03:22:21","slug":"three-party-quantum-private-computation-of-cardinalities-of-set-intersection-and-union-based-on-ghz-states","status":"publish","type":"post","link":"https:\/\/lifeboat.com\/blog\/2020\/12\/three-party-quantum-private-computation-of-cardinalities-of-set-intersection-and-union-based-on-ghz-states","title":{"rendered":"Three-party quantum private computation of cardinalities of set intersection and union based on GHZ states"},"content":{"rendered":"<p><a class=\"aligncenter blog-photo\" href=\"https:\/\/lifeboat.com\/blog.images\/three-party-quantum-private-computation-of-cardinalities-of-set-intersection-and-union-based-on-ghz-states.jpg\"><\/a><\/p>\n<p>Quantum key distribution is one kind of important cryptographic protocols based on quantum mechanics, in which any outside eavesdropper attempting to obtain the secret key shared by two users will be detected. The successful detection comes from Heisenberg\u2019s uncertainty principle: the measurement of a quantum system, which is required to obtain information of that system, will generally disturb it. The disturbances provide two users with the information that there exists an outside eavesdropper, and they can therefore abort the communication. Nowadays, most people need to share some of their private information for certain services such as products recommendation for online shopping and collaborations between two companies depending on their comm interests. Private Set Intersection Cardinality (PSI-CA) and Private Set Union Cardinality (PSU-CA), which are two primitives in cryptography, involve two or more users who intend to obtain the cardinalities of the intersection and the union of their private sets through the minimum information disclosure of their sets<sup><a data-track=\"click\" data-track-action=\"reference anchor\" data-track-label=\"link\" data-test=\"citation-ref\" title=\"De Cristofaro, E., Gasti, P. & Tsudik, G. Fast and private computation of cardinality of set intersection and union. In International Conference on Cryptology and Network Security, 218&ndash;231 (Springer, 2012).\" href=\"https:\/\/www.nature.com\/articles\/s41598-020-77579-w#ref-CR1\" id=\"ref-link-section-d36898e433\">1<\/a>,<a data-track=\"click\" data-track-action=\"reference anchor\" data-track-label=\"link\" data-test=\"citation-ref\" title=\"Wu, M.-E., Chang, S.-Y., Lu, C.-J. & Sun, H.-M. A communication-efficient private matching scheme in client-server model. Information Sciences 275, 348&ndash;359 (2014).\" href=\"https:\/\/www.nature.com\/articles\/s41598-020-77579-w#ref-CR2\" id=\"ref-link-section-d36898e433_1\">2<\/a>,<a data-track=\"click\" data-track-action=\"reference anchor\" data-track-label=\"link\" data-test=\"citation-ref\" aria-label=\"Reference 3\" title=\"Shi, R.-H., Mu, Y., Zhong, H., Zhang, S. & Cui, J. Quantum private set intersection cardinality and its application to anonymous authentication. Information Sciences 370, 147&ndash;158 (2016).\" href=\"https:\/\/www.nature.com\/articles\/s41598-020-77579-w#ref-CR3\" id=\"ref-link-section-d36898e436\">3<\/a><\/sup>.<\/p>\n<p>The definition of Private Set Intersection (PSI), also called Private Matching (PM), was proposed by Freedman<sup><a data-track=\"click\" data-track-action=\"reference anchor\" data-track-label=\"link\" data-test=\"citation-ref\" aria-label=\"Reference 4\" title=\"Freedman, M. J., Nissim, K. & Pinkas, B. Efficient private matching and set intersection. In International conference on the theory and applications of cryptographic techniques, 1&ndash;19 (Springer, 2004).\" href=\"https:\/\/www.nature.com\/articles\/s41598-020-77579-w#ref-CR4\" id=\"ref-link-section-d36898e443\">4<\/a><\/sup>. They employed balanced hashing and homomorphic encryption to design two PSI protocols and also investigated some variants of PSI. In 2012, Cristofaro <i>et al.<\/i><sup><a data-track=\"click\" data-track-action=\"reference anchor\" data-track-label=\"link\" data-test=\"citation-ref\" aria-label=\"Reference 1\" title=\"De Cristofaro, E., Gasti, P. & Tsudik, G. Fast and private computation of cardinality of set intersection and union. In International Conference on Cryptology and Network Security, 218&ndash;231 (Springer, 2012).\" href=\"https:\/\/www.nature.com\/articles\/s41598-020-77579-w#ref-CR1\" id=\"ref-link-section-d36898e447\">1<\/a><\/sup> developed several PSI-CA and PSU-CA protocols with linear computation and communication complexity based on the Diffie-Hellman key exchange which blinds the private information. Their protocols were the most efficient compared with the previous classical related ones. There are also other classical PSI-CA or PSU-CA protocols<sup><a data-track=\"click\" data-track-action=\"reference anchor\" data-track-label=\"link\" data-test=\"citation-ref\" title=\"Vaidya, J. & Clifton, C. Secure set intersection cardinality with application to association rule mining. Journal of Computer Security 13, 593&ndash;622 (2005).\" href=\"https:\/\/www.nature.com\/articles\/s41598-020-77579-w#ref-CR5\" id=\"ref-link-section-d36898e451\">5<\/a>,<a data-track=\"click\" data-track-action=\"reference anchor\" data-track-label=\"link\" data-test=\"citation-ref\" title=\"Kissner, L. & Song, D. Privacy-preserving set operations. In Annual International Cryptology Conference, 241&ndash;257 (Springer, 2005).\" href=\"https:\/\/www.nature.com\/articles\/s41598-020-77579-w#ref-CR6\" id=\"ref-link-section-d36898e451_1\">6<\/a>,<a data-track=\"click\" data-track-action=\"reference anchor\" data-track-label=\"link\" data-test=\"citation-ref\" title=\"Zander, S., Andrew, L. L. & Armitage, G. Scalable private set intersection cardinality for capture-recapture with multiple private datasets. Centre for Advanced Internet Architectures, Technical Report 130930A (2013).\" href=\"https:\/\/www.nature.com\/articles\/s41598-020-77579-w#ref-CR7\" id=\"ref-link-section-d36898e451_2\">7<\/a>,<a data-track=\"click\" data-track-action=\"reference anchor\" data-track-label=\"link\" data-test=\"citation-ref\" aria-label=\"Reference 8\" title=\"Debnath, S. K. & Dutta, R. Secure and efficient private set intersection cardinality using bloom filter. In International Conference on Information Security, 209&ndash;226 (Springer, 2015).\" href=\"https:\/\/www.nature.com\/articles\/s41598-020-77579-w#ref-CR8\" id=\"ref-link-section-d36898e454\">8<\/a><\/sup>. Nevertheless, the security of these protocols relies on the unproven difficulty assumptions, such as discrete logarithm, factoring, and quadratic residues assumptions, which will be insecure when quantum computers are available<sup><a data-track=\"click\" data-track-action=\"reference anchor\" data-track-label=\"link\" data-test=\"citation-ref\" title=\"Shor, P. W. Algorithms for quantum computation: Discrete logarithms and factoring. In Proceedings 35th annual symposium on foundations of computer science, 124&ndash;134 (IEEE, 1994).\" href=\"https:\/\/www.nature.com\/articles\/s41598-020-77579-w#ref-CR9\" id=\"ref-link-section-d36898e458\">9<\/a>,<a data-track=\"click\" data-track-action=\"reference anchor\" data-track-label=\"link\" data-test=\"citation-ref\" title=\"Grover, L. Algorithms for quantum computation: Discrete logarithms and factoring. In Proceedings 28th Annual ACM Symposium on the Theory of computation, 212&ndash;219 (ACM Press, 1996).\" href=\"https:\/\/www.nature.com\/articles\/s41598-020-77579-w#ref-CR10\" id=\"ref-link-section-d36898e458_1\">10<\/a>,<a data-track=\"click\" data-track-action=\"reference anchor\" data-track-label=\"link\" data-test=\"citation-ref\" aria-label=\"Reference 11\" title=\"Grover, L. Quantum mechanics helps in searching for a needle in a haystack. Physics Review Letter 79, 325 (1997).\" href=\"https:\/\/www.nature.com\/articles\/s41598-020-77579-w#ref-CR11\" id=\"ref-link-section-d36898e461\">11<\/a><\/sup>.<\/p>\n<p>For the sake of improving the security of PSI-CA protocols for two parties, Shi <i>et al.<\/i><sup><a data-track=\"click\" data-track-action=\"reference anchor\" data-track-label=\"link\" data-test=\"citation-ref\" aria-label=\"Reference 3\" title=\"Shi, R.-H., Mu, Y., Zhong, H., Zhang, S. & Cui, J. Quantum private set intersection cardinality and its application to anonymous authentication. Information Sciences 370, 147&ndash;158 (2016).\" href=\"https:\/\/www.nature.com\/articles\/s41598-020-77579-w#ref-CR3\" id=\"ref-link-section-d36898e468\">3<\/a><\/sup> designed a probabilistic protocol where multi-qubit entangled states, complicated oracle operators, and measurements in high <i>N<\/i>-dimensional Hilbert space were utilized. And the same method in Ref.<sup><a data-track=\"click\" data-track-action=\"reference anchor\" data-track-label=\"link\" data-test=\"citation-ref\" aria-label=\"Reference 3\" title=\"Shi, R.-H., Mu, Y., Zhong, H., Zhang, S. & Cui, J. Quantum private set intersection cardinality and its application to anonymous authentication. Information Sciences 370, 147&ndash;158 (2016).\" href=\"https:\/\/www.nature.com\/articles\/s41598-020-77579-w#ref-CR3\" id=\"ref-link-section-d36898e475\">3<\/a><\/sup> was later used to develop a PSI-CA protocol for multiple parties<sup><a data-track=\"click\" data-track-action=\"reference anchor\" data-track-label=\"link\" data-test=\"citation-ref\" aria-label=\"Reference 12\" title=\"Liu, B., Zhang, M. & Shi, R. Quantum secure multi-party private set intersection cardinality. International Journal of Theoretical Physics 59, 1992&ndash;2007 (2020).\" href=\"https:\/\/www.nature.com\/articles\/s41598-020-77579-w#ref-CR12\" id=\"ref-link-section-d36898e479\">12<\/a><\/sup>. For easy implementation of a protocol, Shi <i>et al.<\/i><sup><a data-track=\"click\" data-track-action=\"reference anchor\" data-track-label=\"link\" data-test=\"citation-ref\" aria-label=\"Reference 13\" title=\"Shi, R.-H. Quantum private computation of cardinality of set intersection and union. The European Physical Journal D 72, 221 (2018).\" href=\"https:\/\/www.nature.com\/articles\/s41598-020-77579-w#ref-CR13\" id=\"ref-link-section-d36898e483\">13<\/a><\/sup> leveraged Bell states to construct another protocol for PSI-CA and PSU-CA problems that was more practical than that in Ref.<sup><a data-track=\"click\" data-track-action=\"reference anchor\" data-track-label=\"link\" data-test=\"citation-ref\" aria-label=\"Reference 3\" title=\"Shi, R.-H., Mu, Y., Zhong, H., Zhang, S. & Cui, J. Quantum private set intersection cardinality and its application to anonymous authentication. Information Sciences 370, 147&ndash;158 (2016).\" href=\"https:\/\/www.nature.com\/articles\/s41598-020-77579-w#ref-CR3\" id=\"ref-link-section-d36898e488\">3<\/a><\/sup>. In both protocols Ref.<sup><a data-track=\"click\" data-track-action=\"reference anchor\" data-track-label=\"link\" data-test=\"citation-ref\" aria-label=\"Reference 3\" title=\"Shi, R.-H., Mu, Y., Zhong, H., Zhang, S. & Cui, J. Quantum private set intersection cardinality and its application to anonymous authentication. Information Sciences 370, 147&ndash;158 (2016).\" href=\"https:\/\/www.nature.com\/articles\/s41598-020-77579-w#ref-CR3\" id=\"ref-link-section-d36898e492\">3<\/a><\/sup> and Ref.<sup><a data-track=\"click\" data-track-action=\"reference anchor\" data-track-label=\"link\" data-test=\"citation-ref\" aria-label=\"Reference 13\" title=\"Shi, R.-H. Quantum private computation of cardinality of set intersection and union. The European Physical Journal D 72, 221 (2018).\" href=\"https:\/\/www.nature.com\/articles\/s41598-020-77579-w#ref-CR13\" id=\"ref-link-section-d36898e496\">13<\/a><\/sup>, only two parties who intend to get the cardinalities of the intersection and the union of their private sets are involved. Although Ref.<sup><a data-track=\"click\" data-track-action=\"reference anchor\" data-track-label=\"link\" data-test=\"citation-ref\" aria-label=\"Reference 12\" title=\"Liu, B., Zhang, M. & Shi, R. Quantum secure multi-party private set intersection cardinality. International Journal of Theoretical Physics 59, 1992&ndash;2007 (2020).\" href=\"https:\/\/www.nature.com\/articles\/s41598-020-77579-w#ref-CR12\" id=\"ref-link-section-d36898e500\">12<\/a><\/sup> works for multiple parties, it only solves the PSI-CA problem and requires multi-qubit entangled states, complicated oracle operators, and measurements. It then interests us that how we could design a more practical protocol for multiple parties to simultaneously solve PSI-CA and PSU-CA problems. Inspired by Shi <i>et al.<\/i>\u2019s work, we are thus trying to design a three-party protocol to solve PSI-CA and PSU-CA problems, where every two and three parties can obtain the cardinalities of the intersection and the union of their respective private sets with the aid of a semi-honest third party (TP). TP is semi-honest means that he loyally executes the protocol, makes a note of all the intermediate results, and might desire to take other parties\u2019 private information, but he cannot collude with dishonest parties. We then give a detailed analysis of the presented protocol\u2019s security. Besides, the influence of six typical kinds of Markovian noise on our protocol is also analyzed.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Quantum key distribution is one kind of important cryptographic protocols based on quantum mechanics, in which any outside eavesdropper attempting to obtain the secret key shared by two users will be detected. The successful detection comes from Heisenberg\u2019s uncertainty principle: the measurement of a quantum system, which is required to obtain information of that system, [\u2026]<\/p>\n","protected":false},"author":427,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1523,1625,1617,1492],"tags":[],"class_list":["post-117275","post","type-post","status-publish","format-standard","hentry","category-computing","category-encryption","category-quantum-physics","category-security"],"_links":{"self":[{"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/posts\/117275","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/users\/427"}],"replies":[{"embeddable":true,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/comments?post=117275"}],"version-history":[{"count":0,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/posts\/117275\/revisions"}],"wp:attachment":[{"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/media?parent=117275"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/categories?post=117275"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/tags?post=117275"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}