Locality-preserving oblivious RAM

DOI10.1007/S00145-022-09419-1MaRDI QIDQ5925543zbMATH OpenOpenAlexFDO

Authors Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi

Publication date 3 March 2022

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00145-022-09419-1

zbMATH Keywords

localityoblivious RAMrandomized algorithms

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Randomized algorithms (68W20) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Locality-preserving oblivious RAM
• On the (in)security of hash-based oblivious RAM and a new balancing scheme
• Yes, there is an oblivious RAM lower bound!
• Oblivious RAM Revisited
• Oblivious RAM with worst-case logarithmic overhead

Cites work

• Algorithms and data structures for external memory
• Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
• Foundations of Cryptography
• Foundations of differentially oblivious algorithms
• Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
• scientific article; zbMATH DE number 1559569 (Why is no real title available?)
• Is there an oblivious RAM lower bound?
• Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
• On the (in)security of hash-based oblivious RAM and a new balancing scheme
• Onion ORAM: a constant bandwidth blowup oblivious RAM
• OptORAMa: optimal oblivious RAM
• Path ORAM
• Perfectly secure oblivious parallel RAM
• Privacy-preserving access of outsourced data via oblivious RAM simulation
• 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
• Software protection and simulation on oblivious RAMs
• Sorting in \(c \log n\) parallel steps
• Statistically-secure ORAM with \(\tilde{O}(\log^2 n)\) overhead
• Structured encryption and controlled disclosure
• The locality of searchable symmetric encryption
• Tight tradeoffs in searchable symmetric encryption
• Verifiable oblivious storage
• Yes, there is an oblivious RAM lower bound!
• Zig-zag sort

Cited in

(8)

• \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
• CacheShuffle: a family of oblivious shuffles
• Foundations of differentially oblivious algorithms
• On the (in)security of hash-based oblivious RAM and a new balancing scheme
• Locality-preserving oblivious RAM
• Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts
• Weighted oblivious RAM, with applications to searchable symmetric encryption
• Random-index oblivious RAM

This page was built for publication: Locality-preserving oblivious RAM

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