Structured encryption and dynamic leakage suppression
From MaRDI portal
Publication:2056799
Recommendations
Cites work
- scientific article; zbMATH DE number 1559545 (Why is no real title available?)
- Boolean searchable symmetric encryption with worst-case sub-linear complexity
- Computationally volume-hiding structured encryption
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- On the (in)security of hash-based oblivious RAM and a new balancing scheme
- Path ORAM
- SQL on structurally-encrypted databases
- Searchable encryption with optimal locality: achieving sublogarithmic read efficiency
- Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
- Software protection and simulation on oblivious RAMs
- Sorting in \(c \log n\) parallel steps
- Structured encryption and controlled disclosure
- Structured encryption and leakage suppression
- The locality of searchable symmetric encryption
- Tight tradeoffs in searchable symmetric encryption
- \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
Cited in
(10)- SQL on structurally-encrypted databases
- Injection-secure structured and searchable symmetric encryption
- Computationally volume-hiding structured encryption
- Structured encryption and controlled disclosure
- Efficient fully secure leakage-deterring encryption
- Structured encryption and leakage suppression
- Encrypted multi-map that hides query, access, and volume patterns
- Limits of breach-resistant and snapshot-oblivious RAMs
- Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts
- Structured encryption for knowledge graphs
This page was built for publication: Structured encryption and dynamic leakage suppression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056799)