{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T20:16:17Z","timestamp":1783196177306,"version":"3.54.6"},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100014717","name":"National Natural Science Foundation of China National Outstanding Youth Science Fund Project","doi-asserted-by":"publisher","award":["62102085"],"award-info":[{"award-number":["62102085"]}],"id":[{"id":"10.13039\/100014717","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010909","name":"Excellent Young Scientists Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010909","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972089"],"award-info":[{"award-number":["61972089"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Information Security and Applications"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.jisa.2026.104504","type":"journal-article","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T19:46:17Z","timestamp":1779479177000},"page":"104504","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Searchable encryption scheme for static Hamming distance range queries"],"prefix":"10.1016","volume":"100","author":[{"given":"Rui","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xufei","family":"Mao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zixing","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1021-8121","authenticated-orcid":false,"given":"Bruhadeshwar","family":"Bezawada","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jisa.2026.104504_bib0001","series-title":"Perceptrons","author":"Minshky","year":"1969"},{"key":"10.1016\/j.jisa.2026.104504_bib0002","series-title":"Proc. 28th ACM symposium on theory of computing (STOC)","first-page":"639","article-title":"Adaptively secure multi-party computation","author":"Canetti","year":"1996"},{"key":"10.1016\/j.jisa.2026.104504_bib0003","series-title":"Proc. of the financial cryptography and data security (FC)","first-page":"258","article-title":"Parallel and dynamic searchable symmetric encryption","author":"Kamara","year":"2013"},{"key":"10.1016\/j.jisa.2026.104504_bib0004","series-title":"Proc. of the IEEE international conference on computer communications (INFOCOM)","article-title":"Enabling effcient fuzzy keyword search over encrypted data in cloud computing","author":"Li","year":"2009"},{"key":"10.1016\/j.jisa.2026.104504_bib0005","series-title":"Proc. of the IEEE transactions on pattern analysis and machine intelligence","first-page":"1611","article-title":"Inference-based similarity search in randomized montgomery domains for privacy-preserving biometric identification","author":"Wang","year":"2017"},{"key":"10.1016\/j.jisa.2026.104504_bib0006","series-title":"Advances in cryptology\u2013CRYPTO 2013: 33rd annual cryptology conference, Santa Barbara, CA, USA, August 18\u201322, 2013. proceedings, Part I","first-page":"353","article-title":"Highly-scalable searchable symmetric encryption with support for boolean queries","author":"Cash","year":"2013"},{"key":"10.1016\/j.jisa.2026.104504_bib0007","series-title":"Proc. of the 2nd ACM workshop on information hiding and multimedia security","first-page":"187","article-title":"Gshade:faster privacy-preserving distance computation and biometric identification","author":"Bringer","year":"2014"},{"key":"10.1016\/j.jisa.2026.104504_bib0008","series-title":"Proc. of IEEE INFOCOM 2018 - IEEE conference on computer communications","first-page":"2222","article-title":"Instantcryptogram: secure image retrieval service","author":"Li","year":"2018"},{"key":"10.1016\/j.jisa.2026.104504_bib0009","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.120592","article-title":"Enabling privacy-preserving non-interactive computation for hamming distance","volume":"670","author":"Gao","year":"2024","journal-title":"Inf Sci"},{"issue":"4","key":"10.1016\/j.jisa.2026.104504_bib0010","doi-asserted-by":"crossref","first-page":"3341","DOI":"10.1109\/TNSM.2025.3565943","article-title":"Enabling privacy-preserving top-k hamming distance query on the cloud","volume":"22","author":"Gao","year":"2025","journal-title":"IEEE Trans Netw Serv Manag"},{"key":"10.1016\/j.jisa.2026.104504_bib0011","series-title":"Proc. TR-81 Aiken computation lab, harvard university","article-title":"How to exchange secrets with oblivious transfer","author":"Rabin","year":"1981"},{"issue":"3","key":"10.1016\/j.jisa.2026.104504_bib0012","doi-asserted-by":"crossref","first-page":"2478","DOI":"10.1109\/TDSC.2024.3519584","article-title":"Forward secure similarity search over encrypted data for hamming distance","volume":"22","author":"Wang","year":"2024","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"10.1016\/j.jisa.2026.104504_bib0013","series-title":"Proc. of the 36th Inte. Conf. on very large data bases (VLDB)","first-page":"619","article-title":"Nearest neighbor search with strong location privacy","author":"Papadopoulos","year":"2010"},{"issue":"1","key":"10.1016\/j.jisa.2026.104504_bib0014","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1109\/TDSC.2020.2998039","article-title":"Adaptive secure nearest neighbor query processing over encrypted data","volume":"19","author":"Li","year":"2022","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"10.1016\/j.jisa.2026.104504_bib0015","series-title":"Proc. of the international conference on management of data (SIGMOD)","article-title":"Practical private range search revisited","author":"Demertzis","year":"2016"},{"key":"10.1016\/j.jisa.2026.104504_bib0016","series-title":"Proc. of the international conference on information and communications security","first-page":"489","article-title":"Forward secure dynamic searchable symmetric encryption with efficient updatas","author":"Kim","year":"2017"},{"key":"10.1016\/j.jisa.2026.104504_bib0017","series-title":"Annual international conference on the theory and applications of cryptographic techniques","first-page":"94","article-title":"Boolean searchable symmetric encryption with worst-case sub-linear complexity","author":"Kamara","year":"2017"},{"key":"10.1016\/j.jisa.2026.104504_bib0018","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.120592","article-title":"Enabling privacy-preserving non-interactive computation for hamming distance","volume":"670","author":"Gao","year":"2024","journal-title":"Inf Sci"},{"key":"10.1016\/j.jisa.2026.104504_bib0019","series-title":"Proc. of the advances in cryptology eurocrypt (EUROCRYPT)","first-page":"224","article-title":"Order-preserving symmetric encryption","author":"Boldyreva","year":"2009"},{"key":"10.1016\/j.jisa.2026.104504_bib0020","series-title":"Proc. Inte. Cryptology Conf. (CRYPTO)","first-page":"578","article-title":"Order-preserving encryption revisited: improved security analysis and alternative solutions","author":"Boldyreva","year":"2011"},{"key":"10.1016\/j.jisa.2026.104504_bib0021","unstructured":"TAN L.. Old newspapers. 2017. https:\/\/www.kaggle.com\/datasets\/alvations\/old-newspapers."},{"key":"10.1016\/j.jisa.2026.104504_bib0022","unstructured":"Bache K., Lichman M.. UCI machine learning repository. 2013. http:\/\/archive.ics.uci.edu\/ml."}],"container-title":["Journal of Information Security and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2214212626001341?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2214212626001341?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T19:29:28Z","timestamp":1783193368000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2214212626001341"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":22,"alternative-id":["S2214212626001341"],"URL":"https:\/\/doi.org\/10.1016\/j.jisa.2026.104504","relation":{},"ISSN":["2214-2126"],"issn-type":[{"value":"2214-2126","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Searchable encryption scheme for static Hamming distance range queries","name":"articletitle","label":"Article Title"},{"value":"Journal of Information Security and Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jisa.2026.104504","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104504"}}