Secure Distributed Computing in a Commercial Environment
By Philippe Golle, Stuart G. Stubblebine. 2002
72 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Mariana Raykova
- Srinath T. V. Setty
- Bryan Parno
- Michael Walfish
- Andrew Justin Blumberg
- Jon Howell
- Craig Gentry
- Dan Boneh
In Computational Theory and Mathematics
- Mariana Raykova
- Bryan Parno
- Jon Howell
- Craig Gentry
- Michael T. Goodrich
- Srdjan Čapkun
- Ghassan O. Karame
- Mario Strasser
Citations in the corpus
- Pinocchio: Nearly Practical Verifiable Computation (2013, background): “Function specific solutions [2–6] are often efficient, but only for a narrow class of computations.”
- Secure Remote Execution of Sequential Computations (2009, background): “further propose in [7] a security framework for commercial distributed computations that equally relies on selective redundancy.”
- Searching for High-Value Rare Events with Uncheatable Grid Computing (2005, methodology): “Note that our chaff injection approach is therefore more efficient than task duplication approaches to uncheatable grid computing [5], which have a computational overhead of 46% to 243% for reasonable protection against lazy cheaters (while providing only modest protection against hoarding cheaters ”