# A New Quantum Private Protocol for Set Intersection Cardinality Based on a Quantum Homomorphic Encryption Scheme for Toffoli Gate

^{1}

^{2}

^{3}

^{4}

^{*}

^{†}

## Abstract

**:**

## 1. Introduction

## 2. Preliminary

#### 2.1. Pauli Gates

#### 2.2. Quantum Toffoli Gate

#### 2.3. Information-Theoretic Security

## 3. Quantum Private Computation Protocol for Set Intersection Cardinality

## 4. Analysis and Comparison

#### 4.1. Correctness Analysis

#### 4.2. Implementation of Quantum PSI-CA Protocols on IBM Quantum Experience Platform

#### 4.3. Security Analysis

#### 4.3.1. Outside Attacks

#### 4.3.2. Participant Attack

#### 4.4. Comparison

## 5. Discussion and Conclusions

## Author Contributions

## Funding

## Institutional Review Board Statement

## Data Availability Statement

## Acknowledgments

## Conflicts of Interest

## Sample Availability

## References

- Gordon, S.D.; Hazay, C.; Katz, J.; Lindell, Y. Complete fairness in secure two-party computation. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing(STOC), Victoria, Canada, 17–20 May 2008; ACM Press: New York, NY, USA, 2008; pp. 413–422. [Google Scholar]
- Asharov, G.; Canetti, R.; Hazay, C. Towards a game theoretic viewof secure computation. In Advances in Cryptology-EUROCRYPT 2011; Springer: Berlin/Heidelberg, Germany, 2011; Volume 6632, pp. 426–445. [Google Scholar]
- Groce, A.; Katz, J. Fair computation with rational players. In Advances in Cryptology- EUROCRYPT 2012; Springer: Berlin/Heidelberg, Germany, 2012; pp. 81–98. [Google Scholar]
- Freedman, M.J.; Nissim, K.; Pinkas, B. Efficient Private Matching and Set Intersection. In Proceedings of the Advances in Cryptology-EUROCRYPT 2004: International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, 2–6 May 2004; Springer: Berlin/Heidelberg, Germany, 2004; pp. 1–19. [Google Scholar]
- Chun, J.Y.; Hong, D.; Jeong, I.R.; Lee, D.H. Privacy-preserving disjunctive normal form operations on distributed sets. Inform. Sci.
**2013**, 231, 113–122. [Google Scholar] [CrossRef] - 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.
**2013**, 63, 538–560. [Google Scholar] [CrossRef] - Schlegel, R.; Chow, C.Y.; Huang, Q.; Wong, D.S. Privacy-preserving location sharing services for social networks. IEEE Trans. Serv. Comput.
**2016**, 10, 811–825. [Google Scholar] [CrossRef] - Baldi, P.; Baronio, R.; De Cristofaro, E.; Gasti, P.; Tsudik, G. Countering GATTACA: Efficient and secure testing of fully-sequenced human genomes. In Proceedings of the 18th ACM Conference on Computer and Communications Security, Chicago, IL, USA, 17–21 October 2011; pp. 691–702. [Google Scholar]
- 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, 6–9 February 2011. [Google Scholar]
- Bursztein, E.; Hamburg, M.; Lagarenne, J.; Boneh, D. Openconflict: Preventing real time map hacks in online games. In 2011 IEEE Symposium on Security and Privacy; IEEE: Manhattan, NY, USA, 2011; pp. 506–520. [Google Scholar]
- Rivest, R.L.; Adleman, L.; Dertouzos, M.L. On data banks and privacy homomorphisms. Found. Secur. Comput.
**1978**, 4, 169–180. [Google Scholar] - Kuang, R.; Perepechaenko, M.; Toth, R. A New Symmetric Homomorphic Functional Encryption over a Hidden Ring for Polynomial Public Key Encapsulations. arXiv
**2023**, arXiv:2301.11995. [Google Scholar] - Wu, M.E.; Chang, S.Y.; Lu, C.J.; Sun, H.M. A communication-efficient private matching scheme in client-server model. Inform. Sci.
**2014**, 275, 348–359. [Google Scholar] [CrossRef] - Shao, Z.Y.; Yan, B. Private set intersection via public key encryption with keywords search. Secur. Commun. Netw.
**2015**, 8, 396–402. [Google Scholar] [CrossRef] - Hazay, C.; Nissim, K. Efficient set operations in the presence of malicious adversaries. J. Cryptol.
**2012**, 25, 383–433. [Google Scholar] [CrossRef] [Green Version] - Hazay, C. Oblivious polynomial evaluation and secure set intersection from algebraic PRFs. J. Cryptol.
**2018**, 31, 537–586. [Google Scholar] [CrossRef] - Vaidya, J.; Clifton, C. Secure set intersection cardinality with application to association rule mining. J. Comput. Secur.
**2005**, 13, 593–622. [Google Scholar] [CrossRef] [Green Version] - Debnath, S.K.; Dutta, R. Secure and efficient private set intersection cardinality using bloom filter. In Information Security (Lecture Notes in Computer Science); Springer: Berlin/Heidelberg, Germany, 2015; Volume 9290, pp. 209–226. [Google Scholar]
- Cristofaro, E.D.; Gasti, P.; Tsudik, G. Fast and private computation of cardinality of set intersection and union. In Cryptology and Network Security (CANC 2010) LNCS 7712; Springer: Berlin/Heidelberg, Germany, 2012; pp. 218–231. [Google Scholar]
- Shor, P.W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. Siam Rev.
**1999**, 41, 303–332. [Google Scholar] [CrossRef] - Grover, L.K. A fast quantum mechanical algorithm for database search. In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, Philadelphia, PA, USA, 22–24 May 1996; pp. 212–219. [Google Scholar]
- Li, Z.; Cai, B.; Sun, H.; Liu, H.; Wan, L.; Qin, S.; Wen, Q.; Gao, F. Novel quantum circuit implementation of AES with low costs. Sci. China Phys. Mech. Astron.
**2022**, 65, 290311. [Google Scholar] [CrossRef] - Shi, R.H.; Mu, Y.; Zhong, H.; Zhang, S. Quantum oblivious set-member decision protocol. Phys. Rev. A
**2015**, 92, 022309. [Google Scholar] [CrossRef] [Green Version] - Shi, R.H.; Mu, Y.; Zhong, H.; Cui, J.; Zhang, S. An efficient quantum scheme for Private Set Intersection. Quantum Inf. Process.
**2016**, 15, 363–371. [Google Scholar] [CrossRef] [Green Version] - Maitra, A. Quantum secure two-party computation for set intersection with rational players. Quantum Inf. Process.
**2018**, 17, 1–21. [Google Scholar] [CrossRef] [Green Version] - Shi, R.H. Quantum private computation of cardinality of set intersection and union. Eur. Phys. J.
**2018**, 12, 1–6. [Google Scholar] [CrossRef] - Shi, R.H.; Mu, Y.; Zhong, H.; Zhang, S.; Cui, J. Quantum private set intersection cardinality and its application to anonymous authentication. Inform. Sci.
**2016**, 370–371, 147–158. [Google Scholar] [CrossRef] [Green Version] - Shi, R.H. Efficient quantum protocol for private set intersection cardinality. IEEE Access
**2018**, 6, 73102–73109. [Google Scholar] [CrossRef] - Gao, F.; Qin, S.J.; Wen, Q.Y.; Zhu, F.C. A simple participant attack on the Bradler–Dusek protocol. Quantum Inf. Comput.
**2007**, 7, 329. [Google Scholar] [CrossRef]

**Figure 3.**The circuit U used to privately calculate $T\left|{\psi}_{k}^{A}\right.\u232a\left|{\psi}_{k}^{B}\right.\u232a\left|{\psi}_{k}^{C}\right.\u232a$.

**Figure 4.**The circuit used to privately calculate $T\left|1\right.\u232a\left|1\right.\u232a\left|1\right.\u232a$ and the experiment results.

**Figure 5.**The circuit used to privately calculate $T\left|0\right.\u232a\left|0\right.\u232a\left|0\right.\u232a$ and the experiment results.

**Figure 6.**The circuit used to privately calculate $T\left|1\right.\u232a\left|1\right.\u232a\left|0\right.\u232a$ and the experiment results.

**Figure 7.**The circuit used to privately calculate $T\left|1\right.\u232a\left|0\right.\u232a\left|1\right.\u232a$ and the experiment results.

**Figure 8.**The circuit used to privately calculate $T\left|0\right.\u232a\left|1\right.\u232a\left|1\right.\u232a$ and the experiment results.

**Figure 9.**The circuit used to privately calculate $T\left|0\right.\u232a\left|1\right.\u232a\left|0\right.\u232a$ and the experiment results.

**Figure 10.**The circuit used to privately calculate $T\left|0\right.\u232a\left|0\right.\u232a\left|1\right.\u232a$ and the experiment results.

**Figure 11.**The circuit used to privately calculate $T\left|1\right.\u232a\left|0\right.\u232a\left|0\right.\u232a$ and the experiment results.

Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |

© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).

## Share and Cite

**MDPI and ACS Style**

Liu, W.; Li, Y.; Wang, Z.; Li, Y.
A New Quantum Private Protocol for Set Intersection Cardinality Based on a Quantum Homomorphic Encryption Scheme for Toffoli Gate. *Entropy* **2023**, *25*, 516.
https://doi.org/10.3390/e25030516

**AMA Style**

Liu W, Li Y, Wang Z, Li Y.
A New Quantum Private Protocol for Set Intersection Cardinality Based on a Quantum Homomorphic Encryption Scheme for Toffoli Gate. *Entropy*. 2023; 25(3):516.
https://doi.org/10.3390/e25030516

**Chicago/Turabian Style**

Liu, Wen, Yangzhi Li, Zhirao Wang, and Yugang Li.
2023. "A New Quantum Private Protocol for Set Intersection Cardinality Based on a Quantum Homomorphic Encryption Scheme for Toffoli Gate" *Entropy* 25, no. 3: 516.
https://doi.org/10.3390/e25030516