Frequency-Hiding Order-Preserving Encryption with Small Client Storage
Summary: Introduces FH-OPE with O(N) client storage and one interaction per query, replacing prior O(n) storage or O(log n) rounds and benefiting N≪n. A coding tree reduces encoding churn on insertions while preserving order and hiding frequencies. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Dongjie Li (Nankai University)
- 2. Siyi Lv (Nankai University)
- 3. Yanyu Huang (Nankai University)
- 4. Yijing Liu (Nankai University)
- 5. Tong Li (Nankai University)
- 6. Zheli Liu (Nankai University)
- 7. Liang Guo (Huawei Technology)
BibTeX Citation
@article{li_vldb21,
title = {{Frequency-Hiding Order-Preserving Encryption with Small Client Storage}},
author = {Li, Dongjie and Lv, Siyi and Huang, Yanyu and Liu, Yijing and Li, Tong and Liu, Zheli and Guo, Liang},
journal = {PVLDB},
series = {{VLDB} '21},
volume = {14},
number = {13},
pages = {3295--3307},
doi = {10.14778/3484224.3484228},
url = {https://doi.org/10.14778/3484224.3484228},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,570 | Enabling Index-free Adjacency in Oblivious Graph Processing with Delayed Duplications | 2026 | VLDB | 5.093636e-05 |
| 11,457 | Frequency-revealing attacks against Frequency-hiding Order-preserving Encryption | 2023 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,615 | Arx: An Encrypted Database using Semantically Secure Encryption | 2019 | VLDB | 0.00010214058 |
| 1,674 | The Tao of Inference in Privacy-Protected Databases | 2018 | VLDB | 0.00010037562 |
| 3,293 | Modular Order-Preserving Encryption, Revisited | 2015 | SIGMOD | 7.5517336e-05 |
| 4,625 | Practical Private Range Search Revisited | 2016 | SIGMOD | 6.5989597e-05 |
| 5,128 | A Comparative Evaluation of Order-Revealing Encryption Schemes and Secure Range-Query Protocols | 2019 | VLDB | 6.355964e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,996 | Fast Searchable Encryption With Tunable Locality | 2017 | SIGMOD |
| 2 | 6,537 | Range Search over Encrypted Multi-Attribute Data | 2023 | VLDB |
| 3 | 10,610 | A Workload-Aware Encrypted Index for Efficient Privacy-Preserving Range Queries | 2026 | VLDB |
| 4 | 6,797 | Efficient Searchable Encryption Through Compression | 2018 | VLDB |
| 5 | 5,285 | Order-Preserving Key Compression for In-Memory Search Trees | 2020 | SIGMOD |
| 6 | 310 | Order Preserving Encryption for Numeric Data | 2004 | SIGMOD |
| 7 | 8,531 | Adaptive Indexing over Encrypted Numeric Data | 2016 | SIGMOD |
| 8 | 5,128 | A Comparative Evaluation of Order-Revealing Encryption Schemes and Secure Range-Query Protocols | 2019 | VLDB |
| 9 | 3,293 | Modular Order-Preserving Encryption, Revisited | 2015 | SIGMOD |
| 10 | 11,457 | Frequency-revealing attacks against Frequency-hiding Order-preserving Encryption | 2023 | VLDB |