A Quantum Protocol for Secure Manhattan Distance Computation

Secure Manhattan distance computation allows two parties to privately compute the Manhattan distance of their points, which is important and has broad applications. In this paper, we present a protocol for secure Manhattan distance computation based on phase shift operation. Because of quantum mechanics’ physical principle, our protocol can also resist outside attacks and don’t leak any private information of participants.

[1]  Qiao-Yan Wen,et al.  Comment on "experimental demonstration of a quantum protocol for Byzantine agreement and liar detection". , 2008, Physical review letters.

[2]  Dongyang Long,et al.  High-Capacity Quantum Summation with Single Photons in Both Polarization and Spatial-Mode Degrees of Freedom , 2014 .

[3]  M. Koashi,et al.  Quantum entanglement for secret sharing and secret splitting , 1999 .

[4]  Wen Liu,et al.  An efficient protocol for the quantum private comparison of equality with W state , 2011 .

[5]  Wen Liu,et al.  A Protocol for the Quantum Private Comparison of Equality with χ-Type State , 2012 .

[6]  Fei Gao,et al.  Quantum private comparison protocol based on entanglement swapping of $$d$$-level Bell states , 2013, Quantum Inf. Process..

[7]  Qiaoyan Wen,et al.  An efficient two-party quantum private comparison protocol with decoy photons and two-photon entanglement , 2009 .

[8]  Fei Gao,et al.  A simple participant attack on the brádler-dušek protocol , 2007, Quantum Inf. Comput..

[9]  宋婷婷,et al.  Participant attack on quantum secret sharing based on entanglement swapping , 2009 .

[10]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[11]  Bin Liu,et al.  A Generic Construction of Quantum-Oblivious-Key-Transfer-Based Private Query with Ideal Database Security and Zero Failure , 2017, IEEE Transactions on Computers.

[12]  Fuguo Deng,et al.  Bidirectional quantum secret sharing and secret splitting with polarized single photons , 2005, quant-ph/0504119.

[13]  Qiao-Yan Wen,et al.  Quantum private query: A new kind of practical quantum cryptographic protocol , 2019, Science China Physics, Mechanics & Astronomy.

[14]  Zhi-Wei Sun,et al.  Three-party quantum summation without a trusted third party , 2015 .

[15]  Bin Liu,et al.  QKD-based quantum private query without a failure probability , 2015, Science China Physics, Mechanics & Astronomy.

[16]  Ying Sun,et al.  Quantum private comparison protocol with d-dimensional Bell states , 2012, Quantum Information Processing.

[17]  Wei-Wei Zhang,et al.  A quantum protocol for millionaire problem with Bell states , 2013, Quantum Inf. Process..

[18]  Zhou Yi.  A Quantum Protocol for Millionaire Problem with Continuous Variables , 2014 .

[19]  Jian-Wei Pan,et al.  Efficient multiparty quantum-secret-sharing schemes , 2004, quant-ph/0405179.

[20]  Qiaoyan Wen,et al.  Cryptanalysis of the Hillery-Buzek-Berthiaume quantum secret-sharing protocol , 2007, 0801.2418.

[21]  Tang Chao-jing,et al.  Quantum Secure Communication Scheme with W State , 2007 .

[22]  Ekert,et al.  Quantum cryptography based on Bell's theorem. , 1991, Physical review letters.

[23]  Lixiang Li,et al.  Efficient Post-Quantum Secure Network Coding Signatures in the Standard Model , 2016, KSII Trans. Internet Inf. Syst..

[24]  Yixian Yang,et al.  An efficient protocol for the private comparison of equal information based on the triplet entangled state and single-particle measurement , 2010 .

[25]  Charles H. Bennett,et al.  Quantum cryptography without Bell's theorem. , 1992, Physical review letters.

[26]  Christoph Simon,et al.  Practical private database queries based on a quantum-key-distribution protocol , 2010, 1002.4360.

[27]  Gilles Brassard,et al.  Quantum cryptography: Public key distribution and coin tossing , 2014, Theor. Comput. Sci..

[28]  Fei Gao,et al.  Improving the security of multiparty quantum secret sharing based on the improved Boström–Felbinger protocol , 2008 .

[29]  Haipeng Peng,et al.  Restricted (k, n)-threshold quantum secret sharing scheme based on local distinguishability of orthogonal multiqudit entangled states , 2017, Quantum Inf. Process..

[30]  Fei Gao,et al.  Comment on “Multiparty quantum secret sharing of classical messages based on entanglement swapping” , 2007 .

[31]  Yi Mu,et al.  Secure Multiparty Quantum Computation for Summation and Multiplication , 2016, Scientific Reports.

[32]  Fuguo Deng,et al.  Quantum secure direct communication with high-dimension quantum superdense coding , 2005 .

[33]  Fei Gao,et al.  Quantum protocol for millionaire problem , 2011 .

[34]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[35]  Qiaoyan Wen,et al.  An Efficient Protocol for the Secure Multi-party Quantum Summation , 2010 .

[36]  Fuguo Deng,et al.  Reply to ``Comment on `Secure direct communication with a quantum one-time-pad' '' , 2004, quant-ph/0405177.