{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T05:04:54Z","timestamp":1779426294390,"version":"3.53.1"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFB3102400"],"award-info":[{"award-number":["2022YFB3102400"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62572370"],"award-info":[{"award-number":["62572370"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272294"],"award-info":[{"award-number":["62272294"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.ins.2026.123503","type":"journal-article","created":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T07:38:52Z","timestamp":1776065932000},"page":"123503","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Lightweight multi-client order-revealing encryption with limited leakage"],"prefix":"10.1016","volume":"748","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3573-056X","authenticated-orcid":false,"given":"Chunyang","family":"Lv","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5297-0293","authenticated-orcid":false,"given":"Jianfeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shi-Feng","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0394-4432","authenticated-orcid":false,"given":"Saiyu","family":"Qi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1355-3870","authenticated-orcid":false,"given":"Chao","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9330-2662","authenticated-orcid":false,"given":"Leo Yu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kok-Leong","family":"Ong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2026.123503_bib0005","series-title":"ACM SIGMOD","first-page":"563","article-title":"Order-preserving encryption for numeric data","author":"Agrawal","year":"2004"},{"key":"10.1016\/j.ins.2026.123503_bib0010","series-title":"EUROCRYPT","first-page":"224","article-title":"Order-preserving symmetric encryption","author":"Boldyreva","year":"2009"},{"key":"10.1016\/j.ins.2026.123503_bib0015","series-title":"EUROCRYPT","first-page":"563","article-title":"Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation","author":"Boneh","year":"2015"},{"key":"10.1016\/j.ins.2026.123503_bib0020","series-title":"FSE","first-page":"474","article-title":"Practical order-revealing encryption with limited leakage","author":"Chenette","year":"2016"},{"key":"10.1016\/j.ins.2026.123503_bib0025","series-title":"ACM CCS","first-page":"1167","article-title":"Order-revealing encryption: new constructions, applications, and lower bounds","author":"Lewi","year":"2016"},{"key":"10.1016\/j.ins.2026.123503_bib0030","series-title":"ASIACRYPT","first-page":"181","article-title":"Parameter-hiding order revealing encryption","author":"Cash","year":"2018"},{"key":"10.1016\/j.ins.2026.123503_bib0035","series-title":"Public Key Cryptography (4), Vol. 14604 of LNCS","first-page":"227","article-title":"Parameter-hiding order-revealing encryption without pairings","author":"Peng","year":"2024"},{"key":"10.1016\/j.ins.2026.123503_bib0040","doi-asserted-by":"crossref","first-page":"45458","DOI":"10.1109\/ACCESS.2018.2864991","article-title":"Multi-client order-revealing encryption","volume":"6","author":"Eom","year":"2018","journal-title":"IEEE Access"},{"key":"10.1016\/j.ins.2026.123503_bib0045","series-title":"ACM AsiaCCS","first-page":"134","article-title":"Delegatable order-revealing encryption","author":"Li","year":"2019"},{"issue":"3","key":"10.1016\/j.ins.2026.123503_bib0050","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1109\/TDSC.2023.3268652","article-title":"Towards practical multi-client order-revealing encryption: improvement and application","volume":"21","author":"Lv","year":"2024","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"6","key":"10.1016\/j.ins.2026.123503_bib0055","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1109\/TPDS.2018.2885519","article-title":"Enabling encrypted rich queries in distributed key-value stores","volume":"30","author":"Guo","year":"2019","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"5","key":"10.1016\/j.ins.2026.123503_bib0060","doi-asserted-by":"crossref","first-page":"3401","DOI":"10.1109\/TDSC.2021.3095933","article-title":"Enabling privacy-preserving geographic range query in fog-enhanced IOT services","volume":"19","author":"Guo","year":"2022","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"10.1016\/j.ins.2026.123503_bib0065","series-title":"CRYPTO","first-page":"578","article-title":"Order-preserving encryption revisited: improved security analysis and alternative solutions","author":"Boldyreva","year":"2011"},{"key":"10.1016\/j.ins.2026.123503_bib0070","series-title":"IEEE","first-page":"463","article-title":"An ideal-security protocol for order-preserving encoding","author":"Popa","year":"2013"},{"key":"10.1016\/j.ins.2026.123503_bib0075","series-title":"ACM CCS","first-page":"656","article-title":"Frequency-hiding order-preserving encryption","author":"Kerschbaum","year":"2015"},{"key":"10.1016\/j.ins.2026.123503_bib0080","series-title":"ACM CCS","first-page":"275","article-title":"Optimal average-complexity ideal-security order-preserving encryption","author":"Kerschbaum","year":"2014"},{"issue":"13","key":"10.1016\/j.ins.2026.123503_bib0085","doi-asserted-by":"crossref","first-page":"3295","DOI":"10.14778\/3484224.3484228","article-title":"Frequency-hiding order-preserving encryption with small client storage","volume":"14","author":"Li","year":"2021","journal-title":"Proc. VLDB Endow."},{"issue":"7","key":"10.1016\/j.ins.2026.123503_bib0090","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","article-title":"Space\/time trade-offs in hash coding with allowable errors","volume":"13","author":"Bloom","year":"1970","journal-title":"Commun. ACM"},{"key":"10.1016\/j.ins.2026.123503_bib0095","series-title":"FOCS","first-page":"464","article-title":"How to construct random functions (extended abstract)","author":"Goldreich","year":"1984"},{"issue":"1","key":"10.1016\/j.ins.2026.123503_bib0100","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1109\/TDSC.2020.2973633","article-title":"Non-interactive multi-client searchable encryption: realization and implementation","volume":"19","author":"Sun","year":"2022","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"10.1016\/j.ins.2026.123503_bib0105","series-title":"ACM CCS","first-page":"79","article-title":"Searchable symmetric encryption: improved definitions and efficient constructions","author":"Curtmola","year":"2006"},{"key":"10.1016\/j.ins.2026.123503_bib0110","unstructured":"C. Lv, Multi-client order-revealing encryption implementation, [Online], 2026, https:\/\/github.com\/collisionl\/m-ORE"},{"key":"10.1016\/j.ins.2026.123503_bib0115","unstructured":"T. Barrus, Bloom filter implementation, [Online], 2025, https:\/\/github.com\/barrust\/bloom"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526004342?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526004342?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T04:06:10Z","timestamp":1779422770000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025526004342"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":23,"alternative-id":["S0020025526004342"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2026.123503","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Lightweight multi-client order-revealing encryption with limited leakage","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2026.123503","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"123503"}}