Limits of breach-resistant and snapshot-oblivious RAMs

DOI10.1007/978-3-031-38551-3_6MaRDI QIDQ6190101zbMATH OpenFDO

Authors Giuseppe Persiano, Kevin Yeo

Publication date 6 February 2024

Published in Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-38551-3_6

zbMATH Keywords

hash queue data structuresecure memory access primitive

Mathematics Subject Classification ID

Data structures (68P05) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts
• Yes, there is an oblivious RAM lower bound!
• Stronger lower bounds for online ORAM
• \textsf{MacORAMa}: optimal oblivious RAM with integrity

Cites work

• A logarithmic lower bound for oblivious RAM (for all Parameters)
• A lower bound for one-round oblivious RAM
• Advances in Cryptology - EUROCRYPT 2004
• Boolean searchable symmetric encryption with worst-case sub-linear complexity
• Computationally volume-hiding structured encryption
• Dynamic local searchable symmetric encryption
• Efficient Boolean search over encrypted data with reduced leakage
• Encapsulated search index: public-key, sub-linear, distributed, and delegatable
• Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
• Is there an oblivious RAM lower bound for online reads?
• Is there an oblivious RAM lower bound?
• Logarithmic Lower Bounds in the Cell-Probe Model
• Lower bounds for differentially private RAMs
• Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
• Lower bounds for multi-server oblivious RAMs
• Lower bounds for oblivious data structures
• Lower Bounds for Oblivious Near-Neighbor Search
• Oblivious parallel RAM and applications
• Oblivious parallel RAM: improved efficiency and generic constructions
• Oblivious RAM with \textit{worst-case} logarithmic overhead
• On the (in)security of hash-based oblivious RAM and a new balancing scheme
• OptORAMa: optimal oblivious RAM
• Privacy-preserving group data access via stateless oblivious RAM simulation
• Private information retrieval with sublinear online time
• Reducing the servers' computation in private information retrieval: PIR with preprocessing
• Should Tables Be Sorted?
• Single-server private information retrieval with sublinear amortized time
• Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts
• Software protection and simulation on oblivious RAMs
• SQL on structurally-encrypted databases
• SSE and SSD: page-efficient searchable symmetric encryption
• Stronger lower bounds for online ORAM
• Structured encryption and controlled disclosure
• Structured encryption and dynamic leakage suppression
• Structured encryption and leakage suppression
• The locality of searchable symmetric encryption
• Yes, there is an oblivious RAM lower bound!

Cited in

(2)

• MetaDORAM: info-theoretic distributed ORAM with less communication
• Resizable oblivious RAM

This page was built for publication: Limits of breach-resistant and snapshot-oblivious RAMs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6190101)