Privacy-preserving Dijkstra
From MaRDI portal
distributed ORAMgarbled RAMMPCoblivious graph algorithmsoblivious RAMsecure Dijkstrasingle-source shortest path
Distance in graphs (05C12) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Data encryption (aspects in computer science) (68P25) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60)
Cites work
- \textsc{EpiGRAM}: practical garbled RAM
- A new approach to practical active-secure two-party computation
- Advances in Cryptology - CRYPTO 2003
- Asymptotically tight bounds for composing ORAM with PIR
- Black-box parallel garbled RAM
- Distributed Oblivious RAM for Secure Two-Party Computation
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
- Efficient 3-party distributed ORAM
- Efficient, oblivious data structures for MPC
- Garbled RAM from one-way functions
- How to garble RAM programs?
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1559545 (Why is no real title available?)
- scientific article; zbMATH DE number 871899 (Why is no real title available?)
- scientific article; zbMATH DE number 7706039 (Why is no real title available?)
- scientific article; zbMATH DE number 7788479 (Why is no real title available?)
- Linear-time 2-party secure merge from additively homomorphic encryption
- Low cost constant round MPC combining BMR and oblivious transfer
- More is less: perfectly secure oblivious algorithms in the multi-server setting
- Multiparty Computation from Somewhat Homomorphic Encryption
- Oblivious key-value stores and amplification for private set intersection
- Oblivious tight compaction in \(O(n)\) time with smaller constant
- Optimal oblivious parallel RAM
- OptORAMa: Optimal oblivious RAM
- Path ORAM
- Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions.
- Practically efficient multi-party sorting protocols from comparison sort algorithms
- Privacy-Preserving Graph Algorithms in the Semi-honest Model
- Secret-shared shuffle
- Security and composition of multiparty cryptographic protocols
- Semi-homomorphic encryption and multiparty computation
- Software protection and simulation on oblivious RAMs
- Strict Fibonacci heaps
- Tri-state circuits. A circuit model that captures RAM
- Universally composable security
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)
