{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T18:05:29Z","timestamp":1779041129775,"version":"3.51.4"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"13","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:p>\n            The range query on encrypted databases is usually implemented using the order-preserving encryption (OPE) technique which preserves the order of plaintexts. Since the frequency leakage of plaintexts makes OPE vulnerable to frequency-analyzing attacks, some frequency-hiding order-preserving encryption (FH-OPE) schemes are proposed. However, existing FH-OPE schemes require either the large client storage of size\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            ) or\n            <jats:italic>O<\/jats:italic>\n            (log\n            <jats:italic>n<\/jats:italic>\n            ) rounds of interactions for each query, where\n            <jats:italic>n<\/jats:italic>\n            is the total number of plaintexts. To this end, we propose a FH-OPE scheme that achieves the small client storage without additional client-server interactions. In detail, our scheme achieves\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>N<\/jats:italic>\n            ) client storage and 1 interaction per query, where\n            <jats:italic>N<\/jats:italic>\n            is the number of distinct plaintexts and\n            <jats:italic>N<\/jats:italic>\n            \u2264\n            <jats:italic>n<\/jats:italic>\n            . Especially, our scheme has a remarkable performance when\n            <jats:italic>N \u226a n<\/jats:italic>\n            . Moreover, we design a new coding tree for producing the order-preserving encoding which indicates the order of each ciphertext in the database. The coding strategy of our coding tree ensures that encodings update in the low frequency when inserting new ciphertexts. Experimental results show that the single round interaction and low-frequency encoding updates make our scheme more efficient than previous FH-OPE schemes.\n          <\/jats:p>","DOI":"10.14778\/3484224.3484228","type":"journal-article","created":{"date-parts":[[2021,10,28]],"date-time":"2021-10-28T22:36:50Z","timestamp":1635460610000},"page":"3295-3307","source":"Crossref","is-referenced-by-count":17,"title":["Frequency-hiding order-preserving encryption with small client storage"],"prefix":"10.14778","volume":"14","author":[{"given":"Dongjie","family":"Li","sequence":"first","affiliation":[{"name":"Nankai University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siyi","family":"Lv","sequence":"additional","affiliation":[{"name":"Nankai University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanyu","family":"Huang","sequence":"additional","affiliation":[{"name":"Nankai University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yijing","family":"Liu","sequence":"additional","affiliation":[{"name":"Nankai University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tong","family":"Li","sequence":"additional","affiliation":[{"name":"Nankai University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheli","family":"Liu","sequence":"additional","affiliation":[{"name":"Nankai University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Guo","sequence":"additional","affiliation":[{"name":"Huawei Technology Co., Ltd, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,10,28]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"111","article-title":"Semi-Order Preserving Encryption Technique for Numeric","volume":"9","author":"Ahmed Saleh","year":"2019","unstructured":"Saleh Ahmed , Annisa, Asif Zaman , Zhan Zhang , Kazi Md. Rokibul Alam , and Yasuhiko Morimoto . 2019 . Semi-Order Preserving Encryption Technique for Numeric Database. Int. J. Netw. Comput. 9 , 1 (2019), 111 -- 129 . Saleh Ahmed, Annisa, Asif Zaman, Zhan Zhang, Kazi Md. Rokibul Alam, and Yasuhiko Morimoto. 2019. Semi-Order Preserving Encryption Technique for Numeric Database. Int. J. Netw. Comput. 9, 1 (2019), 111--129.","journal-title":"Database. Int. J. Netw. Comput."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236217"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/3324301.3324309"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01001-9_13"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033036.2033080"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_19"},{"key":"e_1_2_1_7_1","first-page":"661","article-title":"Reducing the Leakage in Practical Order-Revealing Encryption","volume":"2016","author":"Cash David","year":"2016","unstructured":"David Cash , Feng-Hao Liu , Adam O'Neill , and Cong Zhang . 2016 . Reducing the Leakage in Practical Order-Revealing Encryption . IACR Cryptol. ePrint Arch. 2016 (2016), 661 . http:\/\/eprint.iacr.org\/2016\/661 David Cash, Feng-Hao Liu, Adam O'Neill, and Cong Zhang. 2016. Reducing the Leakage in Practical Order-Revealing Encryption. IACR Cryptol. ePrint Arch. 2016 (2016), 661. http:\/\/eprint.iacr.org\/2016\/661","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-52993-5_24"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2590701.2590705"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882911"},{"key":"e_1_2_1_11_1","unstructured":"Michael Egorov and MacLane Wilkison. 2016. ZeroDB white paper. abs\/1602.07168. arXiv:1602.07168 http:\/\/arxiv.org\/abs\/1602.07168  Michael Egorov and MacLane Wilkison. 2016. ZeroDB white paper. abs\/1602.07168. arXiv:1602.07168 http:\/\/arxiv.org\/abs\/1602.07168"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2864991"},{"key":"e_1_2_1_13_1","volume-title":"Encdbdb: Searchable encrypted, fast, compressed, in-memory database using enclaves. CoRR abs\/2002.05097","author":"Fuhry Benny","year":"2020","unstructured":"Benny Fuhry , Florian Kerschbaum , 2020 . Encdbdb: Searchable encrypted, fast, compressed, in-memory database using enclaves. CoRR abs\/2002.05097 (2020). https:\/\/arxiv.org\/abs\/2002.05097 Benny Fuhry, Florian Kerschbaum, et al. 2020. Encdbdb: Searchable encrypted, fast, compressed, in-memory database using enclaves. CoRR abs\/2002.05097 (2020). https:\/\/arxiv.org\/abs\/2002.05097"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243864"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.44"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3363210"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-71045-7_1"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.E93.D.2520"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978386"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813629"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29962-0_17"},{"key":"e_1_2_1_22_1","first-page":"1211","article-title":"New Construction of Order-Preserving Encryption Based on Order-Revealing Encryption","volume":"15","author":"Kim Kee S.","year":"2019","unstructured":"Kee S. Kim . 2019 . New Construction of Order-Preserving Encryption Based on Order-Revealing Encryption . J. Inf. Process. Syst. 15 , 5 (2019), 1211 -- 1217 . http:\/\/www.jips-k.org:80\/q.jips?cp=pp&pn=715 Kee S. Kim. 2019. New Construction of Order-Preserving Encryption Based on Order-Revealing Encryption. J. Inf. Process. Syst. 15, 5 (2019), 1211--1217. http:\/\/www.jips-k.org:80\/q.jips?cp=pp&pn=715","journal-title":"J. Inf. Process. Syst."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.13154\/tosc.v2018.i1.277-313"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978376"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLOUD.2012.65"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2016.12.006"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749455"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813651"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342641"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.38"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2330667.2330691"},{"key":"e_1_2_1_32_1","first-page":"1098","article-title":"The Strength of Weak Randomization: Efficiently Searchable Encryption with Minimal Leakage","volume":"2017","author":"Pouliot David","year":"2017","unstructured":"David Pouliot , Scott Griffy , and Charles V. Wright . 2017 . The Strength of Weak Randomization: Efficiently Searchable Encryption with Minimal Leakage . IACR Cryptol. ePrint Arch. 2017 (2017), 1098 . http:\/\/eprint.iacr.org\/2017\/1098 David Pouliot, Scott Griffy, and Charles V. Wright. 2017. The Strength of Weak Randomization: Efficiently Searchable Encryption with Minimal Leakage. IACR Cryptol. ePrint Arch. 2017 (2017), 1098. http:\/\/eprint.iacr.org\/2017\/1098","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978345"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3484224.3484228","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:38:50Z","timestamp":1672220330000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3484224.3484228"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":33,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["10.14778\/3484224.3484228"],"URL":"https:\/\/doi.org\/10.14778\/3484224.3484228","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2021,9]]}}}