Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:455943
Jump to:navigation, search

DOI10.1007/s00607-012-0200-5zbMath1250.68077OpenAlexW2039785711MaRDI QIDQ455943

J. A. M. Naranjo, Márk Jelasity, Leocadio 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

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



Uses Software

  • JDQR
  • JDQZ
  • PeerSim


Cites Work

  • Unnamed Item
  • On asynchronous iterations
  • Secure multi-party computation made simple
  • How to share a secret
  • Fast Distributed Algorithms for Computing Separable Functions
  • A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius
  • Templates for the Solution of Algebraic Eigenvalue Problems
  • A decentralized algorithm for spectral analysis
  • Privacy preserving data mining




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:455943&oldid=12333582"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 04:26.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki