RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS

DOI10.1142/S0129626412500028zbMath1253.68046MaRDI QIDQ3144930

No author found.

Publication date: 12 December 2012

Published in: Parallel Processing Letters (Search for Journal in Brave)

zbMATH Keywords

costvolunteer computingtask executiondependable computingmalicious processorspublic-resource computing

Mathematics Subject Classification ID

Distributed systems (68M14) Internet topics (68M11)

Related Items (1)

Verifiable crowd computing: coping with bounded rationality

Cites Work

• Computing Boolean functions from multiple faulty copies of input bits
• The Do-All problem with Byzantine processor failures
• Optimal decision strategies in Byzantine environments
• Voting mechanisms in distributed systems
• Finding parity in a simple broadcast network
• The Byzantine Generals Problem
• Performing Work Efficiently in the Presence of Faults
• Average-Case Lower Bounds for Noisy Boolean Decision Trees
• On boolean decision trees with faulty nodes
• Lower bounds for the complexity of reliable Boolean circuits with noisy gates
• Computing with Noisy Information
• Sabotage-tolerance mechanisms for volunteer computing systems
• Computation in Noisy Radio Networks
• Probability and Computing

This page was built for publication: RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS