Privacy-Preserving Graph Algorithms in the Semi-honest Model

DOI10.1007/11593447_13MaRDI QIDQ5451073zbMATHOpenAlexFDO

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

zbMATH Keywords

Graph AlgorithmsPrivacySecure Multiparty Computation

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Distributed algorithms made secure: a graph theoretic approach
• scientific article; zbMATH DE number 1759770
• Constant-round privacy preserving multiset union
• Data-oblivious graph algorithms in outsourced external memory
• Private analysis of graph structure

Cited in

(13)

• Privacy-preserving subgraph matching protocol for two parties
• Communication-Efficient Private Protocols for Longest Common Subsequence
• Data-oblivious graph algorithms in outsourced external memory
• Privacy-preserving Dijkstra
• Distributed algorithms made secure: a graph theoretic approach
• Confidential gossip
• Private subgraph matching protocol
• A generalized approach for social network integration and analysis with privacy preservation
• scientific article; zbMATH DE number 7113032 (Why is no real title available?)
• PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries
• Scalable multi-party private set union from multi-query secret-shared private membership test
• scientific article; zbMATH DE number 1788241 (Why is no real title available?)
• Asynchronous privacy-preserving iterative computation on peer-to-peer networks

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)