Cryptanalysis and improvement of the novel quantum scheme for secure two-party distance computation
- 132 Downloads
Secure multiparty computational geometry is a vital field of secure multiparty computation, which computes a computation geometric problem without revealing any private information of each party. A recent paper proposed a scheme about a novel quantum scheme for secure two-party distance computation. We cryptanalyze the scheme in the following three aspects: (1) There exists an entangle-and-measure attack method for Bob to detect Alice’s location with a probability of 50% and the attack cannot be detected whether this attack is successful or not. (2) There is a loophole for Alice to get more information if she submits a different point in the second chance. The amount of information exposed by Bob is unacceptable. (3) In the definition of S2PDC, only Alice can get the distance between both positions while Bob gets nothing. However, under some circumstances, as a participant in the scheme, Bob has right to get the distance. Above all, we have improved the agreement from different items: (1) Security: the improved scheme can defend our new type attack based on the original security. (2) Fairness: The amount of information leaked by Bob is minimum in the new scheme. (3) Symmetric: Our scheme allows that both parties can get the distance from the scheme directly. (4) Efficiency: The information complexity of the new scheme is no more than the former one.
KeywordsCryptanalysis Secure multiparty computation Computational geometry
This work was supported by the National Natural Science Foundation of China (No. 61572456) and the Anhui Initiative in Quantum Information Technologies (No. AHY150300).
- 1.Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), pp. 160–164 (1982)Google Scholar
- 2.Atallah, M.J., Du, W.: Secure multi-party computational geometry. In: Dehne, F., Sack, J.R., Tamassia, R. (eds.) Algorithms and Data Structures, Ser. Lecture Notes in Computer Science, pp. 165–179. Springer, Berlin (2001)Google Scholar
- 4.Frikken, K.B., Atallah, M.J.: Privacy preserving route planning. In: Proceedings of the 2004 ACM Workshop on Privacy in the Electronic Society—WPES ’04. Washington DC, USA: ACM Press, p. 8. (2004). http://portal.acm.org/citation.cfm?doid=1029179.1029182
- 5.Yang, B., Sun, A., Zhang, W.: Secure two-party protocols on planar circles. J. Inf. 8, 12 (2011)Google Scholar
- 6.Wen, L., Luo, S.S., Yang, Y.X., Yang, X., Qian, X.: A study of secure two-party circle computation problem. J. Beijing Univ. Posts Telecommun. 32(3), 32–35 (2009)Google Scholar
- 9.Zhang, Y.S., Li, C.F., Guo, G.C.: Comment on quantum key distribution without alternative measurements [Phys. Rev. A, 052312 (2000)]. Physics 63(3), 052312 (2012)Google Scholar
- 17.Cai, Q.: The ping-pong protocol can be attacked without eavesdropping. Phys. Rev. Lett. 91(10), (2003). arXiv:quant-ph/0402052
- 23.Deng, F.G., Li, X.H., Zhou, H.Y., Zhang, Z.J.: Erratum: improving the security of multiparty quantum secret sharing against Trojan horse attack [Phys. Rev. A 72, 044302 (2005)]. Phys. Rev. A 72(4), 440–450 (2005)Google Scholar