Secure and Practical Functional Dependency Discovery in Outsourced Databases
Xinle Cao, Yuhan Li, Dmytro Bogatov, Jian Liu, Kui Ren
Abstract
The popularity of cloud computing has made outsourced databases prevalent in real-world applications. To protect data security, numerous encrypted outsourced databases have been proposed for this paradigm. However, the maintenance of encrypted databases has scarcely been addressed. In this paper, we focus on a typical maintenance task -functional dependency (FD) discovery. We develop novel FD protocols in encrypted databases while guaranteeing minimal leakages: nothing is revealed besides the database size and the actual discovered FDs. As far as we know, we are the first to formally define secure FD discovery with minimal leakage.
We present two oblivious FD protocols and prove them secure in the presence of the persistent adversary (monitoring processes on the server). The first protocol leverages Oblivious RAM (ORAM) and is suitable for dynamic databases. The second protocol relies on oblivious sorting and is more practical in static databases due to high parallelism. We also present a thorough experimental evaluation of the proposed methods.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext a2dfd766-3d7b-4a9a-b3d4-3ffe7f3321f7Cited by top-tier papers2
- Towards Practical Oblivious MapXinle Cao, Weiqi Feng, Jian Liu, Jinjin Zhou et al.VLDB 2025 · 4 citations
- Enabling Index-free Adjacency in Oblivious Graph Processing with Delayed DuplicationsWeiqi Feng, Xinle Cao, Adam O'Neill, Chuanhui YangVLDB 2026
Builds on20
- Generic Attacks on Secure Outsourced DatabasesGeorgios Kellaris, George Kollios, Kobbi Nissim, Adam O'NeillCCS 2016 · 327 citations
- Leakage-Abuse Attacks against Order-Revealing EncryptionPaul Grubbs, Kevin Sekniqi, Vincent Bindschaedler, Muhammad Naveed et al.S&P 2017 · 204 citations
- Oblix: An Efficient Oblivious Search IndexPratyush Mishra, Rishabh Poddar, Jerry Chen, Alessandro Chiesa et al.S&P 2018 · 200 citations
- Improved Reconstruction Attacks on Encrypted Data Using Range Query LeakageMarie-Sarah Lacharité, Brice Minaud, Kenneth G. PatersonS&P 2018 · 183 citations
- What Else is Revealed by Order-Revealing Encryption?F. Betül Durak, Thomas M. DuBuisson, David CashCCS 2016 · 128 citations
Related papers
- Towards Practical Oblivious JoinZhao Chang, Dong Xie, Sheng Wang, Feifei LiSIGMOD 2022 · 20 citations
- Efficient Oblivious Database JoinsSimeon Krastnikov, Florian Kerschbaum, Douglas StebilaVLDB 2020 · 57 citations
- QuORAM: A Quorum-Replicated Fault Tolerant ORAM DatastoreSujaya Maiyya, Seif Ibrahim, Caitlin Scarberry, Divyakant Agrawal et al.USENIX Security 2022
- Equi-Joins over Encrypted Data for Series of QueriesMasoumeh Shafieinejad, Suraj Gupta, Jin Yang Liu, Koray Karabina et al.ICDE 2022 · 14 citations
- Secure Multi-Party Functional Dependency DiscoveryChang Ge, Ihab F. Ilyas, Florian KerschbaumVLDB 2020 · 23 citations
