Privacy-preserving group data access via stateless oblivious RAM simulation
From MaRDI portal
Publication:5743386
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
Cites work
- scientific article; zbMATH DE number 3767009 (Why is no real title available?)
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- Algorithm design: Foundations, analysis, and Internet examples
- Cuckoo hashing
- Getting the Best Out of Existing Hash Functions; or What if We Are Stuck with SHA?
- Hypercubic Sorting Networks
- Improved sorting networks with O(log N) depth
- Introduction to algorithms
- More robust hashing: cuckoo hashing with a stash
- Oblivious RAM Revisited
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- Oblivious RAMs without cryptogarphic assumptions
- On the (in)security of hash-based oblivious RAM and a new balancing scheme
- Perfectly secure oblivious RAM without random oracles
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- Privacy-preserving group data access via stateless oblivious RAM simulation
- Probability and Computing
- Randomized Shellsort, a simple oblivious sorting algorithm
- Relations Among Complexity Measures
- Software protection and simulation on oblivious RAMs
- Some Open Questions Related to Cuckoo Hashing
- Sorting in \(c \log n\) parallel steps
- Sorting networks of logarithmic depth, further simplified
- The complexity of approximating a nonlinear program
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
- Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs
- Constant-round maliciously secure two-party computation in the RAM model
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
- 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
- Dynamic proofs of retrievability via oblivious RAM
- Oblivious RAM with worst-case logarithmic overhead
- 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)
