Quantum Privacy-preserving Two-party Circle Intersection Protocol Based on Phase-encoded Query
Abstract: Privacy-preserving geometric intersection (PGI) is an important issue in Secure multiparty computation (SMC). The existing quantum PGI protocols are mainly based on grid coding, which requires a lot of computational complexity. The phase-encoded query method which has been used in some Quantum SMC protocols is suitable to solve the decision problem, but it needs to apply high dimensional Oracle operators. In this paper, we use the principle of phase-encoded query to solve an important PGI problem, namely privacy-preserving two-party circle intersection. We study the implementation of Oracle operator in detail, and achieve polynomial computational complexity by decompsing it into quantum arithmetic operations. Performance analysis shows that our protocol is correct and efficient, and can protect the privacy of all participants against internal and external attacks.
- Yao,A.C.:Protocols for secure computations.In:Proceeding of 23rd IEEE Symposium on Foundations of Computer Science,pp.160-164.IEEE,Piscataway(1982).https://doi.org/10.1109/SFCS.1982.38
- Atallah,M.J.,Du,W.:Secure Multi-party Computational Geometry.In:Dehne,F,J.Sack,J.-R.,Tamassia,R.(eds)Algorithms and Data Structures,pp.165–179.Springer Berlin Heidelberg(2001).https://doi.org/10.1007/3-540-44634-6-16
- Peng,Z.W.,Shi, R.H.,Zhong,H.,Cui,J.,Zhang,S.:A novel quantum scheme for secure two-party distance computation.Quantum Information Processing 16(12),316 (2017).https://doi.org/10.1007/s11128-017-1766-9
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.