Privacy-Preserving Graph Algorithms in the Semi-honest Model
From MaRDI portal
Publication:5451073
DOI10.1007/11593447_13zbMATH Open1154.94450OpenAlexW1567397627MaRDI QIDQ5451073FDOQ5451073
Authors: Justin Brickell, Vitaly Shmatikov
Publication date: 18 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11593447_13
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Authentication, digital signatures and secret sharing (94A62)
Cited In (13)
- Communication-Efficient Private Protocols for Longest Common Subsequence
- Title not available (Why is that?)
- Data-oblivious graph algorithms in outsourced external memory
- A generalized approach for social network integration and analysis with privacy preservation
- Privacy-preserving subgraph matching protocol for two parties
- Private subgraph matching protocol
- Distributed algorithms made secure: a graph theoretic approach
- Scalable multi-party private set union from multi-query secret-shared private membership test
- Asynchronous privacy-preserving iterative computation on peer-to-peer networks
- PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries
- Privacy-preserving Dijkstra
- Confidential gossip
- Title not available (Why is that?)
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)