Privacy-Preserving Graph Algorithms in the Semi-honest Model
From MaRDI portal
(Redirected from Publication:5451073)
Recommendations
Cited in
(15)- Private subgraph matching protocol
- Confidential gossip
- PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries
- Data-oblivious graph algorithms in outsourced external memory
- Communication-Efficient Private Protocols for Longest Common Subsequence
- scientific article; zbMATH DE number 1788241 (Why is no real title available?)
- Asynchronous privacy-preserving iterative computation on peer-to-peer networks
- A generalized approach for social network integration and analysis with privacy preservation
- scientific article; zbMATH DE number 7113032 (Why is no real title available?)
- Privacy-preserving subgraph matching protocol for two parties
- Distributed algorithms made secure: a graph theoretic approach
- Scalable multi-party private set union from multi-query secret-shared private membership test
- Privacy-preserving Dijkstra
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
This page was built for publication: Privacy-Preserving Graph Algorithms in the Semi-honest Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451073)