{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T12:47:31Z","timestamp":1754398051701,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T00:00:00Z","timestamp":1714348800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T00:00:00Z","timestamp":1714348800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003995","name":"Anhui Provincial Natural Science Foundation","doi-asserted-by":"crossref","award":["2108085QF274"],"award-info":[{"award-number":["2108085QF274"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61772001"],"award-info":[{"award-number":["61772001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Beijing Municipal Natural Science Foundation","award":["4242030"],"award-info":[{"award-number":["4242030"]}]},{"name":"Scientific Research Project of Universities in Anhui Province","award":["2023AH050582","2022AH050659"],"award-info":[{"award-number":["2023AH050582","2022AH050659"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-024-04357-2","type":"journal-article","created":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T06:02:46Z","timestamp":1714370566000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A novel quantum protocol for secure hamming distance computation"],"prefix":"10.1007","volume":"23","author":[{"given":"Zhen-wan","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Run-hua","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei-fan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"key":"4357_CR1","doi-asserted-by":"crossref","unstructured":"Yao, A. C.: Protocols for secure computations. In: Proc. 23rd IEEE symposium on foundations of computer science (FOCS\u2019 82), 160 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"4357_CR2","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S. & Wigderson, A.: How to play any mental game. In Proc. 19th Annual ACM symposium on theory of computing, pp 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"4357_CR3","doi-asserted-by":"crossref","unstructured":"Du, W. L., Atallah, M. J.: Secure multi-party computation problems and their applications: a review and open problems. In Proc. the 2001 ACM workshop on New security paradigms, pp 13\u201322 (2001)","DOI":"10.1145\/508171.508174"},{"key":"4357_CR4","doi-asserted-by":"crossref","unstructured":"Yao, A. C.: How to generate and exchange secrets. In Proc. 27th annual IEEE symposium on foundations of computer science, pp 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"4357_CR5","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y Lindell","year":"2009","unstructured":"Lindell, Y., Pinkas, B.: A proof of security of Yao\u2019s protocol for two-party computation. J. Cryptology 22, 161\u2013188 (2009)","journal-title":"J. Cryptology"},{"issue":"110","key":"4357_CR6","first-page":"1","volume":"78","author":"O Goldreich","year":"1998","unstructured":"Goldreich, O.: Secure multi-party computation. Manuscript Preliminary version 78(110), 1\u2013108 (1998)","journal-title":"Manuscript Preliminary version"},{"issue":"4","key":"4357_CR7","doi-asserted-by":"publisher","first-page":"116","DOI":"10.3390\/a14040116","volume":"14","author":"S Mitsuya","year":"2021","unstructured":"Mitsuya, S., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Compressed communication complexity of Hamming distance. Algorithms 14(4), 116 (2021)","journal-title":"Algorithms"},{"key":"4357_CR8","doi-asserted-by":"crossref","unstructured":"Kulkarni, R., Namboodiri, A.: Secure hamming distance based biometric authentication. In Proc. the 2013 IEEE international conference on biometrics (ICB), pp 1\u20136 (2013)","DOI":"10.1109\/ICB.2013.6613008"},{"key":"4357_CR9","first-page":"107","volume":"9","author":"A Jarrous","year":"2009","unstructured":"Jarrous, A., Pinkas, B.: Secure hamming distance based computation and its applications. ACNS. 9, 107\u2013124 (2009)","journal-title":"ACNS."},{"key":"4357_CR10","doi-asserted-by":"crossref","unstructured":"Osadchy, M., Pinkas, B., Jarrous, A., Moskovich, B.: Scifi-a system for secure face identification. In Proc. the 2010 IEEE symposium on security and privacy, 239\u2013254 (2010)","DOI":"10.1109\/SP.2010.39"},{"key":"4357_CR11","doi-asserted-by":"crossref","unstructured":"Blanton, M., Gasti, P.: Secure and efficient protocols for iris and fingerprint identification. In Proc. European Symposium on Research in Computer Security, 190\u2013209 (2011)","DOI":"10.1007\/978-3-642-23822-2_11"},{"key":"4357_CR12","doi-asserted-by":"crossref","unstructured":"Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In Proc. USENIX Security Symposium, 201 (2011)","DOI":"10.1007\/978-3-642-25560-1_2"},{"key":"4357_CR13","doi-asserted-by":"crossref","unstructured":"Bringer, J., Chabanne, H., Patey, A.: Shade: Secure hamming distance computation from oblivious transfer. In Proc. international conference on financial cryptography and data security, 164\u2013176 (2013)","DOI":"10.1007\/978-3-642-41320-9_11"},{"key":"4357_CR14","doi-asserted-by":"crossref","unstructured":"Bringer, J., Chabanne, H., Favre, M., Patey, A., Schneider, T., Zohner, M.: GSHADE: faster privacy-preserving distance computation and biometric identification. In Proc. the 2nd ACM workshop on Information hiding and multimedia security, 187\u2013198 (2014)","DOI":"10.1145\/2600918.2600922"},{"key":"4357_CR15","doi-asserted-by":"publisher","first-page":"4123","DOI":"10.1002\/sec.1329","volume":"8","author":"MS Kiraz","year":"2015","unstructured":"Kiraz, M.S., Gen\u00e7, Z.A., Kardas, S.: Security and efficiency analysis of the Hamming distance computation protocol based on oblivious transfer. Secur. Commun. Netw. 8, 4123\u20134135 (2015)","journal-title":"Secur. Commun. Netw."},{"key":"4357_CR16","first-page":"85","volume":"26","author":"M Yasuda","year":"2017","unstructured":"Yasuda, M.: Secure Hamming distance computation for biometrics using ideal-lattice and ring-LWE homomorphic encryption. Inf. Secur. J. 26, 85\u2013103 (2017)","journal-title":"Inf. Secur. J."},{"key":"4357_CR17","doi-asserted-by":"crossref","unstructured":"Shor, P. W.: Algorithms for quantum computation: Discrete logarithms and factoring. In Proc. 35th annual IEEE symposium on foundations of computer science, 124\u2013134 (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"4357_CR18","doi-asserted-by":"crossref","unstructured":"Grover, L. K.: A fast quantum mechanical algorithm for database search. In Proc. 28th annual ACM symposium on Theory of computing, 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"4357_CR19","doi-asserted-by":"crossref","unstructured":"Chehimi, M., Saad, W.: Quantum federated learning with quantum data. In: IEEE international conference on acoustics, speech and signal processing, 8617\u20138621(2022)","DOI":"10.1109\/ICASSP43922.2022.9746622"},{"issue":"11","key":"4357_CR20","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/s11128-022-03732-1","volume":"21","author":"S SamadderChaudhury","year":"2022","unstructured":"SamadderChaudhury, S., Dutta, S.: Quantum multi-secret sharing via trap codes and discrete quantum walks. Quantum Inf. Process. 21(11), 380 (2022)","journal-title":"Quantum Inf. Process."},{"issue":"6","key":"4357_CR21","first-page":"2399","volume":"69","author":"RH Shi","year":"2022","unstructured":"Shi, R.H., Li, Y.F.: Quantum private set intersection cardinality protocol with application to privacy-preserving condition query. IEEE T CIRCUITS-I. 69(6), 2399\u20132411 (2022)","journal-title":"IEEE T CIRCUITS-I."},{"key":"4357_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-021-03048-6","volume":"20","author":"YR Li","year":"2021","unstructured":"Li, Y.R., Jiang, D.H., Zhang, Y.H., Liang, X.Q.: A quantum voting protocol using single-particle states. Quantum Inf. Process. 20, 1\u201317 (2021)","journal-title":"Quantum Inf. Process."},{"issue":"2","key":"4357_CR23","first-page":"414","volume":"69","author":"RH Shi","year":"2021","unstructured":"Shi, R.H.: Anonymous quantum sealed-bid auction. IEEE T CIRCUITS-II. 69(2), 414\u2013418 (2021)","journal-title":"IEEE T CIRCUITS-II."},{"key":"4357_CR24","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1103\/PhysRevA.56.1154","volume":"56","author":"HK Lo","year":"1997","unstructured":"Lo, H.K.: Insecurity of quantum secure computations. Phys. Rev. A 56, 1154 (1997)","journal-title":"Phys. Rev. A"},{"key":"4357_CR25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.76.062308","volume":"76","author":"R Colbeck","year":"2007","unstructured":"Colbeck, R.: Impossibility of secure two-party classical computation. Phys. Rev. A 76, 062308 (2007)","journal-title":"Phys. Rev. A"},{"key":"4357_CR26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.109.160501","volume":"109","author":"H Buhrman","year":"2012","unstructured":"Buhrman, H., Christandl, M., Schaffner, C.: Complete insecurity of quantum protocols for classical two-party computation. Phys. Rev. Lett. 109, 160501 (2012)","journal-title":"Phys. Rev. Lett."},{"key":"4357_CR27","unstructured":"Bennett, C. H., Brassard, G.: Quantum cryptography: Public key distribution and coin tossing. In Proc. international IEEE conference on computer system and signal processing, 175\u2013179 (1984)"},{"key":"4357_CR28","doi-asserted-by":"publisher","first-page":"3121","DOI":"10.1103\/PhysRevLett.68.3121","volume":"68","author":"CH Bennett","year":"1992","unstructured":"Bennett, C.H.: Quantum cryptography using any two nonorthogonal states. Phys. Rev. Lett. 68, 3121 (1992)","journal-title":"Phys. Rev. Lett."},{"key":"4357_CR29","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.92.077902","volume":"92","author":"XB Wang","year":"2004","unstructured":"Wang, X.B.: Quantum key distribution with two-qubit quantum codes. Phys. Rev. Lett. 92, 077902 (2004)","journal-title":"Phys. Rev. Lett."},{"key":"4357_CR30","doi-asserted-by":"publisher","first-page":"054302","DOI":"10.1103\/PhysRevA.74.054302","volume":"74","author":"XH Li","year":"2006","unstructured":"Li, X.H., Deng, F.G., Zhou, H.Y.: Improving the security of secure direct communication based on the secret transmitting order of particles. Phys. Rev. A 74, 054302 (2006)","journal-title":"Phys. Rev. A"},{"key":"4357_CR31","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.73.022320","volume":"73","author":"N Gisin","year":"2006","unstructured":"Gisin, N., Fasel, S., Kraus, B., Zbinden, H., Ribordy, G.: Trojan-horse attacks on quantum-key-distribution systems. Phys. Rev. A 73, 022320 (2006)","journal-title":"Phys. Rev. A"},{"key":"4357_CR32","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.physleta.2005.10.050","volume":"351","author":"QY Cai","year":"2006","unstructured":"Cai, Q.Y.: Eavesdropping on the two-way quantum communication protocols with invisible photons. Phys. Lett. A 351, 23\u201325 (2006)","journal-title":"Phys. Lett. A"},{"key":"4357_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-018-2140-2","volume":"18","author":"ZW Peng","year":"2019","unstructured":"Peng, Z.W., Shi, R.H., Wang, P.H., Zhang, S.: Two quantum protocols for secure hamming distance computation. Quantum Inf. Process. 18, 1\u201315 (2019)","journal-title":"Quantum Inf. Process."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-024-04357-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-024-04357-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-024-04357-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T06:14:48Z","timestamp":1731824088000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-024-04357-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,29]]},"references-count":33,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2024,5]]}},"alternative-id":["4357"],"URL":"https:\/\/doi.org\/10.1007\/s11128-024-04357-2","relation":{},"ISSN":["1573-1332"],"issn-type":[{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2024,4,29]]},"assertion":[{"value":"10 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"165"}}