Privacy-preserving Dijkstra
From MaRDI portal
Publication:6653041
DOI10.1007/978-3-031-68400-5_3MaRDI QIDQ6653041
Publication date: 13 December 2024
MPCoblivious RAMgarbled RAMsingle-source shortest pathdistributed ORAMoblivious graph algorithmssecure Dijkstra
Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Paths and cycles (05C38) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Black-box parallel garbled RAM
- More is less: perfectly secure oblivious algorithms in the multi-server setting
- Security and composition of multiparty cryptographic protocols
- Efficient 3-party distributed ORAM
- Oblivious tight compaction in \(O(n)\) time with smaller constant
- Oblivious key-value stores and amplification for private set intersection
- \textsc{EpiGRAM}: practical garbled RAM
- Secret-shared shuffle
- Multiparty Computation from Somewhat Homomorphic Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- Efficient, Oblivious Data Structures for MPC
- Garbled RAM From One-Way Functions
- Semi-homomorphic Encryption and Multiparty Computation
- Software protection and simulation on oblivious RAMs
- Path ORAM
- Distributed Oblivious RAM for Secure Two-Party Computation
- Practically Efficient Multi-party Sorting Protocols from Comparison Sort Algorithms
- How to Garble RAM Programs?
- Universally Composable Security
- Strict fibonacci heaps
- Advances in Cryptology - CRYPTO 2003
- Privacy-Preserving Graph Algorithms in the Semi-honest Model
- Asymptotically Tight Bounds for Composing ORAM with PIR
- Low cost constant round MPC combining BMR and oblivious transfer
- Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions.
- 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)
