Privacy-preserving Dijkstra
DOI10.1007/978-3-031-68400-5_3MaRDI QIDQ6653041FDOQ6653041
Authors: Benjamin Ostrovsky 
Publication date: 13 December 2024
MPCoblivious RAMgarbled RAMsingle-source shortest pathdistributed ORAMoblivious graph algorithmssecure Dijkstra
Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Data encryption (aspects in computer science) (68P25) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- Security and composition of multiparty cryptographic protocols
- Multiparty Computation from Somewhat Homomorphic Encryption
- A new approach to practical active-secure two-party computation
- Semi-homomorphic encryption and multiparty computation
- Title not available (Why is that?)
- Software protection and simulation on oblivious RAMs
- Path ORAM
- Advances in Cryptology - CRYPTO 2003
- Universally composable security
- Title not available (Why is that?)
- Low cost constant round MPC combining BMR and oblivious transfer
- Strict Fibonacci heaps
- More is less: perfectly secure oblivious algorithms in the multi-server setting
- Garbled RAM from one-way functions
- How to garble RAM programs?
- Distributed Oblivious RAM for Secure Two-Party Computation
- Asymptotically tight bounds for composing ORAM with PIR
- Black-box parallel garbled RAM
- Efficient 3-party distributed ORAM
- Efficient, oblivious data structures for MPC
- Oblivious key-value stores and amplification for private set intersection
- Oblivious tight compaction in \(O(n)\) time with smaller constant
- \textsc{EpiGRAM}: practical garbled RAM
- Privacy-Preserving Graph Algorithms in the Semi-honest Model
- Practically efficient multi-party sorting protocols from comparison sort algorithms
- Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions.
- Secret-shared shuffle
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear-time 2-party secure merge from additively homomorphic encryption
- Tri-state circuits. A circuit model that captures RAM
- OptORAMa: Optimal oblivious RAM
- Optimal oblivious parallel RAM
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
This page was built for publication: Privacy-preserving Dijkstra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653041)
