Privacy-preserving group data access via stateless oblivious RAM simulation
From MaRDI portal
Publication:5743386
zbMATH Open1421.68040MaRDI QIDQ5743386FDOQ5743386
Authors: Olga Ohrimenko, Roberto Tamassia, Michael T. Goodrich, Michael Mitzenmacher 
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095130
Recommendations
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- On the (in)security of hash-based oblivious RAM and a new balancing scheme
- Oblivious RAM Revisited
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
Data encryption (aspects in computer science) (68P25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- Introduction to algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Relations Among Complexity Measures
- Cuckoo hashing
- Probability and Computing
- Sorting in \(c \log n\) parallel steps
- Title not available (Why is that?)
- The complexity of approximating a nonlinear program
- Sorting networks of logarithmic depth, further simplified
- Improved sorting networks with O(log N) depth
- Oblivious RAM Revisited
- Software protection and simulation on oblivious RAMs
- Algorithm design: Foundations, analysis, and Internet examples
- Hypercubic Sorting Networks
- Randomized Shellsort, a simple oblivious sorting algorithm
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- More robust hashing: cuckoo hashing with a stash
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- Privacy-preserving group data access via stateless oblivious RAM simulation
- Getting the Best Out of Existing Hash Functions; or What if We Are Stuck with SHA?
- Oblivious RAMs without cryptogarphic assumptions
- Perfectly secure oblivious RAM without random oracles
- On the (in)security of hash-based oblivious RAM and a new balancing scheme
- Some Open Questions Related to Cuckoo Hashing
Cited In (22)
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- OptORAMa: optimal oblivious RAM
- 3-party distributed ORAM from oblivious set membership
- Lower bound framework for differentially private and oblivious data structures
- Is there an oblivious RAM lower bound for online reads?
- OptORAMa: Optimal oblivious RAM
- Data-oblivious graph algorithms in outsourced external memory
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
- Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs
- Constant-round maliciously secure two-party computation in the RAM model
- Privacy-preserving group data access via stateless oblivious RAM simulation
- Perfectly secure oblivious parallel RAM
- Multi-client oblivious RAM with poly-logarithmic communication
- Oblivious RAM with \textit{worst-case} logarithmic overhead
- Is there an oblivious RAM lower bound for online reads?
- Multi-client Oblivious RAM Secure Against Malicious Servers
- Limits of breach-resistant and snapshot-oblivious RAMs
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
- The complexity of secure RAMs
- Oblivious RAM with worst-case logarithmic overhead
- Dynamic proofs of retrievability via oblivious RAM
- Privacy-preserving access of outsourced data via oblivious RAM simulation
This page was built for publication: Privacy-preserving group data access via stateless oblivious RAM simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743386)
