SQL on structurally-encrypted databases

DOI10.1007/978-3-030-03326-2_6zbMath1440.68057OpenAlexW2898477690MaRDI QIDQ1633448

Seny Kamara, Tarik Moataz

Publication date: 20 December 2018

Full work available at URL: https://doi.org/10.1007/978-3-030-03326-2_6

zbMATH Keywords

relational databasequery complexitystructured encryption (STE)

Mathematics Subject Classification ID

Database theory (68P15) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (7)

Encrypted key-value stores ⋮ Efficient searchable symmetric encryption for join queries ⋮ Efficient Boolean search over encrypted data with reduced leakage ⋮ Limits of breach-resistant and snapshot-oblivious RAMs ⋮ Structured encryption and dynamic leakage suppression ⋮ Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model ⋮ Improved structured encryption for SQL databases via hybrid indexing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Three-Party ORAM for Secure Computation
• TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption
• Optimizing ORAM and Using It Efficiently for Secure Computation
• Function Secret Sharing
• Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
• Oblivious RAM with O((logN)3) Worst-Case Cost
• Oblivious RAM Revisited
• Software protection and simulation on oblivious RAMs
• Distributed Oblivious RAM for Secure Two-Party Computation
• Verifiable Oblivious Storage
• Automata, Languages and Programming
• Asymptotically Tight Bounds for Composing ORAM with PIR

This page was built for publication: SQL on structurally-encrypted databases