Table of Content

Open Access iconOpen Access

ARTICLE

Privacy-Preserving Quantum Two-Party Geometric Intersection

Wenjie Liu1,2,*, Yong Xu2, James C. N. Yang3, Wenbin Yu1,2, Lianhua Chi4

Jiangsu Engineering Center of Network Monitoring, Nanjing University of Information Science & Technology, Nanjing, 210044, China.
School of Computer and Software, Nanjing University of Information Science and Technology, Nanjing, 210044, China.
Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien, 974, Taiwan.
Department of Computer Science and Information Technology, La Trobe University, VIC, 3086, Australia.

* Corresponding Author: Wenjie Liu. Email: email.

Computers, Materials & Continua 2019, 60(3), 1237-1250. https://doi.org/10.32604/cmc.2019.03551

Abstract

Privacy-preserving computational geometry is the research area on the intersection of the domains of secure multi-party computation (SMC) and computational geometry. As an important field, the privacy-preserving geometric intersection (PGI) problem is when each of the multiple parties has a private geometric graph and seeks to determine whether their graphs intersect or not without revealing their private information. In this study, through representing Alice’s (Bob’s) private geometric graph GA (GB) as the set of numbered grids SA (SB), an efficient privacy-preserving quantum two-party geometric intersection (PQGI) protocol is proposed. In the protocol, the oracle operation OA (OB) is firstly utilized to encode the private elements of SA =(a0,a1,…,aM-1) (SB =(b0,b1,…,bN-1)) into the quantum states, and then the oracle operation Of is applied to obtain a new quantum state which includes the XOR results between each element of SA and SB. Finally, the quantum counting is introduced to get the amount (t) of the states |ai⊕bj| equaling to |0|, and the intersection result can be obtained by judging t >0 or not. Compared with classical PGI protocols, our proposed protocol not only has higher security, but also holds lower communication complexity.

Keywords


Cite This Article

APA Style
Liu, W., Xu, Y., Yang, J.C.N., Yu, W., Chi, L. (2019). Privacy-preserving quantum two-party geometric intersection. Computers, Materials & Continua, 60(3), 1237-1250. https://doi.org/10.32604/cmc.2019.03551
Vancouver Style
Liu W, Xu Y, Yang JCN, Yu W, Chi L. Privacy-preserving quantum two-party geometric intersection. Comput Mater Contin. 2019;60(3):1237-1250 https://doi.org/10.32604/cmc.2019.03551
IEEE Style
W. Liu, Y. Xu, J.C.N. Yang, W. Yu, and L. Chi "Privacy-Preserving Quantum Two-Party Geometric Intersection," Comput. Mater. Contin., vol. 60, no. 3, pp. 1237-1250. 2019. https://doi.org/10.32604/cmc.2019.03551

Citations




cc Copyright © 2019 The Author(s). Published by Tech Science Press.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 2519

    View

  • 1506

    Download

  • 0

    Like

Related articles

Share Link