Data-Oblivious Graph Algorithms in Outsourced External Memory
From MaRDI portal
Publication:2942400
DOI10.1007/978-3-319-12691-3_19zbMath1431.68126arXiv1409.0597OpenAlexW1486317382MaRDI QIDQ2942400
Joseph A. Simons, Michael T. Goodrich
Publication date: 11 September 2015
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.0597
Nonnumerical algorithms (68W05) Mathematical problems of computer architecture (68M07) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On efficient parallel strong orientation
- Parallel ear decomposition search (EDS) and st-numbering in graphs
- Optimizing ORAM and Using It Efficiently for Secure Computation
- Data-Oblivious Graph Algorithms in Outsourced External Memory
- Perfectly Secure Oblivious RAM without Random Oracles
- Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
- An Efficient Parallel Biconnectivity Algorithm
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Software protection and simulation on oblivious RAMs
- Path ORAM
- Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage
This page was built for publication: Data-Oblivious Graph Algorithms in Outsourced External Memory