Asynchronous privacy-preserving iterative computation on peer-to-peer networks
DOI10.1007/S00607-012-0200-5zbMATH Open1250.68077OpenAlexW2039785711MaRDI QIDQ455943FDOQ455943
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
Recommendations
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Templates for the Solution of Algebraic Eigenvalue Problems
- Title not available (Why is that?)
- How to share a secret
- Fast Distributed Algorithms for Computing Separable Functions
- On asynchronous iterations
- Privacy preserving data mining
- Secure multi-party computation made simple
- A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius
- A decentralized algorithm for spectral analysis
Cited In (2)
Uses Software
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)