Asynchronous privacy-preserving iterative computation on peer-to-peer networks

DOI10.1007/S00607-012-0200-5MaRDI QIDQ455943zbMATH OpenOpenAlexFDO

Authors J. A. M. Naranjo, Márk Jelasity, L. G. Casado

Publication date 23 October 2012

Published in Computing (Search for Journal in Brave)

Full work available at URL http://publicatio.bibl.u-szeged.hu/1519/1/comp12.pdf

zbMATH Keywords

asynchronyprivacy preservationpower iterationP2Pnode churn

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Privacy preserving protocols for eigenvector computation
• A distributed protocol for privacy preserving aggregation with non-permanent participants
• Privacy-Preserving Graph Algorithms in the Semi-honest Model
• Computing in social networks
• Privacy preserving link analysis on dynamic weighted graph

Cites work

• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius
• A decentralized algorithm for spectral analysis
• Fast Distributed Algorithms for Computing Separable Functions
• How to share a secret
• On asynchronous iterations
• Privacy preserving data mining
• Secure multi-party computation made simple
• Templates for the Solution of Algebraic Eigenvalue Problems

Cited in

(2)

• Privacy preserving protocols for eigenvector computation
• Iterative Constructions and Private Data Release

Describes a project that uses

Uses Software

• PeerSim
• JDQZ
• JDQR

This page was built for publication: Asynchronous privacy-preserving iterative computation on peer-to-peer networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q455943)