Uncheatable distributed computations

DOI10.1007/3-540-45353-9_31MaRDI QIDQ2724461zbMATH OpenFDO

Authors Philippe Golle, Ilya V. Mironov

Publication date 12 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45353-9_31

zbMATH Keywords

Internet

Mathematics Subject Classification ID

Distributed systems (68M14) Data encryption (aspects in computer science) (68P25)

Recommendations

• scientific article; zbMATH DE number 2088329
• Pipelined algorithms to detect cheating in long-term grid computations
• Financial Cryptography and Data Security
• Searching for High-Value Rare Events with Uncheatable Grid Computing
• Uncheatable Reputation for Distributed Computation Markets

Cited in

(14)

• Crowd computing as a cooperation problem: An evolutionary approach
• New publicly verifiable computation for batch matrix multiplication
• CRT-based outsourcing algorithms for modular exponentiations
• Covert distributed computing using Java through web spoofing
• Refereed delegation of computation
• Sabotage-tolerance mechanisms for volunteer computing systems
• scientific article; zbMATH DE number 2088329 (Why is no real title available?)
• Efficient algorithms for secure outsourcing of bilinear pairings
• Financial Cryptography and Data Security
• Outsourcing medical dataset analysis: a possible solution
• VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets
• Verifiable crowd computing: coping with bounded rationality
• Verifiable crowd computing: coping with bounded rationality
• Pipelined algorithms to detect cheating in long-term grid computations

This page was built for publication: Uncheatable distributed computations

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