Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Quantum Information Processing
Published in: Quantum Information Processing 1/2019

01-01-2019

Two quantum protocols for secure hamming distance computation

Authors: Zhen-wan Peng, Run-hua Shi, Pan-hong Wang, Shun Zhang

Published in: Quantum Information Processing | Issue 1/2019

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Secure hamming distance computation occupies a vital position in secure multiparty computation, which allows two parties to jointly compute the hamming distance without disclosing their respective private information. There are a lot of significant applications of secure hamming distance computation in private similarity determination fields, such as in biometric identification and e-commerce. In this paper, we present two quantum protocols for secure hamming distance computation. Protocol I subtly makes use of quantum CNOT operator and quantum Shift operator, which are simple quantum operators, while Protocol II utilizes the features of measurement-device-independent quantum key distribution, which can solve the security loopholes in practical realizations due to the imperfection in the detectors. Both two protocols can ensure the fairness of two parties and a higher security than the classical related protocols.
previous article Non-Gaussian swapping of entangled resources
next article Spin–orbit hybrid entangled channel for spin state quantum teleportation using genetic algorithms

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
Literature
1.
Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science, SFCS’08, pp. 160–164. IEEE (1982)
2.
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 218–229. ACM (1987)
3.
Chaum, D., Crépeau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 11–19. ACM (1988)
4.
Du, W., Atallah, M.J.: Secure multi-party computation problems and their applications: a review and open problems. In: Proceedings of the 2001 Workshop on New Security Paradigms, pp. 13–22. ACM (2001)
5.
Bringer, J., Chabanne, H., Patey, A.: Shade: secure hamming distance computation from oblivious transfer. In: International Conference on Financial Cryptography and Data Security, pp. 164–176. Springer, Berlin, Heidelberg (2013)
6.
Bringer, J., Chabanne, H., Favre, M. et al.: GSHADE: faster privacy-preserving distance computation and biometric identification. In: Proceedings of the 2nd ACM Workshop on Information Hiding and Multimedia Security, pp. 187–198. ACM (2014)
7.
Kiraz, M.S., Genç, Z.A., Kardas, S.: Security and efficiency analysis of the Hamming distance computation protocol based on oblivious transfer. Secur. Commun. Netw. 8(18), 4123–4135 (2015)CrossRef
8.
Yasuda, M.: Secure Hamming distance computation for biometrics using ideal-lattice and ring-LWE homomorphic encryption. Inf. Secur. J. A Glob. Perspect. 26(2), 85–103 (2017)CrossRef
9.
Jarrous, A., Pinkas, B.: Secure Hamming distance based computation and its applications. In: ACNS, vol. 9, pp. 107–124 (2009)CrossRef
10.
Osadchy, M., Pinkas, B., Jarrous, A. et al.: Scifi-a system for secure face identification. In: Proceedings of the 2010 IEEE Symposium on Security and Privacy (SP), pp. 239–254. IEEE (2010)
11.
Huang, Y., Evans, D., Katz, J. et al.: Faster secure two-party computation using garbled circuits. In: USENIX Security Symposium, vol. 201(1). (2011)
12.
Blanton, M., Gasti, P.: Secure and efficient protocols for iris and fingerprint identification. In: European Symposium on Research in Computer Security, pp. 190–209. Springer, Berlin, Heidelberg (2011)CrossRef
13.
Kulkarni, R., Namboodiri, A.: Secure hamming distance based biometric authentication. In: 2013 International Conference on Biometrics (ICB), pp. 1–6. IEEE (2013)
14.
Shor, P.W.: Algorithms for quantum computation: Discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 124–134. IEEE (1994)
15.
Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 212–219. ACM (1996)
16.
17.
Colbeck, R.: Impossibility of secure two-party classical computation. Phys. Rev. A 76(6), 062308 (2007)ADSCrossRef
18.
Buhrman, H., Christandl, M., Schaffner, C.: Complete insecurity of quantum protocols for classical two-party computation. Phys. Rev. Lett. 109(16), 160501 (2012)ADSCrossRef
19.
Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)MATH
20.
Lo, H.K., Curty, M., Qi, B.: Measurement-device-independent quantum key distribution. Phys. Rev. Lett. 108(13), 130503 (2012)ADSCrossRef
21.
Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. In: International Conference on Computer System and Signal Processing, pp. 175–179. IEEE (1984)
22.
23.
Wang, X.B.: Quantum key distribution with two-qubit quantum codes. Phys. Rev. Lett. 92(7), 077902 (2004)ADSCrossRef
Metadata
Title
Two quantum protocols for secure hamming distance computation
Authors
Zhen-wan Peng
Run-hua Shi
Pan-hong Wang
Shun Zhang
Publication date
01-01-2019
Publisher
Springer US
Published in
Quantum Information Processing / Issue 1/2019
Print ISSN: 1570-0755
Electronic ISSN: 1573-1332
DOI
https://doi.org/10.1007/s11128-018-2140-2

Other articles of this Issue 1/2019

Quantum Information Processing 1/2019 Go to the issue

OriginalPaper

Quantum image edge extraction based on Laplacian operator and zero-cross method

Correction

Correction to: New scheme for measurement-device-independent quantum key distribution

OriginalPaper

Proposal of realizing superadiabatic geometric quantum computation in decoherence-free subspaces

OriginalPaper

An improved multidimensional reconciliation algorithm for continuous-variable quantum key distribution

OriginalPaper

Real-time selection for free-space measurement device independent quantum key distribution

OriginalPaper

Cryptanalysis and improvement of the novel quantum scheme for secure two-party distance computation