Secure Remote Execution of Sequential Computations
By Ghassan O. Karame, Mario Strasser, Srdjan Čapkun. 2009
21 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications
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
- Srinath T. V. Setty
- Michael Walfish
- Andrew Justin Blumberg
- Dan Boneh
- Bryan Parno
- Mariana Raykova
- Eli Ben-Sasson
- Justin Thaler
In Computer Networks and Communications
- Michael Walfish
- Srinath T. V. Setty
- Andrew Justin Blumberg
- Riad S. Wahby
- Bryan Parno
- Jon Howell
- Mariana Raykova
- Craig Gentry
Citations in the corpus
- Geppetto: Versatile Verifiable Computation (2015, background): “∗Microsoft Research Intern work on verifying computation focused on narrow classes of computation [36, 57], relied on physical-security assumptions [45, 52, 54], assumed uncorrelated failures [21, 22, 40], or achieved good asymptotics [3, 32, 32, 34, 35, 37, 42, 48] but impractical concrete performa”
- Pinocchio: Nearly Practical Verifiable Computation (2013, background): “Other systems rely on replication, and hence assume failures are uncorrelated [1, 7, 8, 55].”
- Making argument systems for outsourced computation practical (sometimes) (2012, methodology): “[47] apply this to detect cheating in a distributed sequential computation.”
- Security and privacy for storage and computation in cloud computing (2014, background): “More closely related references are secure remote computation in distributed system [24].”
- Resolving the conflict between generality and plausibility in verified computation (2013, background): “Replication [6, 22, 36, 39, 44] is a classic strategy but assumes that failures are uncorrelated.”
- Efficient RAM and control flow in verifiable outsourced computation (2015, background): “Buffet allows the programmer to express programs in an expansive subset of C (disallowing only “goto” and function pointers), can handle essentially any example in the verifiable computation literature, and achieves the best performance in the area by multiple orders of magnitude.”