Concurrent encrypted multimaps
From MaRDI portal
Cites work
- \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
- Boolean searchable symmetric encryption with worst-case sub-linear complexity
- Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
- Encrypted key-value stores
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- Improved structured encryption for SQL databases via hybrid indexing
- Injection-secure structured and searchable symmetric encryption
- Introduction to modern cryptography.
- Lock-free linked lists using compare-and-swap
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
- Oblivious parallel RAM and applications
- Oblivious parallel RAM: improved efficiency and generic constructions
- On the depth of oblivious parallel RAM
- Optimal oblivious parallel RAM
- Perfectly secure oblivious parallel RAM
- Searchable encryption with optimal locality: achieving sublogarithmic read efficiency
- Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
- Security and composition of multiparty cryptographic protocols
- Split-ordered lists
- Structured encryption and controlled disclosure
- Structured encryption and dynamic leakage suppression
- The locality of searchable symmetric encryption
- Tight tradeoffs in searchable symmetric encryption
- Two-handed emulation, how to build non-blocking implementations of complex data-structures using DCAS
This page was built for publication: Concurrent encrypted multimaps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965239)
