Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts

DOI10.1007/978-3-031-15985-5_6zbMath1517.94098MaRDI QIDQ6111544

Daniel Genkin, Yang Du, Paul Grubbs

Publication date: 7 July 2023

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

zbMATH Keywords

hash queue data structure; secure memory access primitive

Mathematics Subject Classification ID

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

68P05: Data structures

Related Items

The complexity of secure RAMs, Limits of breach-resistant and snapshot-oblivious RAMs

Cites Work

• Unnamed Item
• Structured encryption and leakage suppression
• Yes, there is an oblivious RAM lower bound!
• A lower bound for one-round oblivious RAM
• Lower bounds for multi-server oblivious RAMs
• Structured encryption and dynamic leakage suppression
• Two-server distributed ORAM with sublinear computation and constant rounds
• OptORAMa: optimal oblivious RAM
• A logarithmic lower bound for oblivious RAM (for all Parameters)
• Oblivious RAM with \textit{worst-case} logarithmic overhead
• Lower bounds for differentially private RAMs
• Computationally volume-hiding structured encryption
• Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
• Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM
• Is There an Oblivious RAM Lower Bound?
• Optimizing ORAM and Using It Efficiently for Secure Computation
• Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead
• Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
• Structured Encryption and Controlled Disclosure
• Oblivious RAM with O((logN)3) Worst-Case Cost
• Oblivious RAM Revisited
• Software protection and simulation on oblivious RAMs
• Path ORAM
• Lower Bounds for Oblivious Data Structures
• Asymptotically Tight Bounds for Composing ORAM with PIR
• Is there an oblivious RAM lower bound for online reads?