Bootstrapping Trust in Modern Computers

By Bryan Parno, Jonathan M. McCune, Adrian Perrig. 2011

85 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Information Systems, Signal Processing

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

In Information Systems

In Signal Processing

Citations in the corpus

Geppetto: Versatile Verifiable Computation (2015, background): “Prior work on verifying computation focused on narrow classes of computation [32, 51], relied on physical-security assumptions [41, 47], assumed uncorrelated failures [19, 20], or achieved good asymptotics [2, 28, 30, 31, 33, 38, 44] but impractical concrete performance [46, 50].”
Pinocchio: Nearly Practical Verifiable Computation (2013, methodology): “Finally, to aid development, Pinocchio provides an end-to-end toolchain that compiles a subset of C into programs that implement the verifiable computation protocol.”
Verifying computations with state (2013, background): “Indeed, when a job completes, after having processed petabytes of data, how can the client be sure that the output is correct [77]?”
Verifying computations without reexecuting them (2015, background): “Still other solutions involve trusted hardware [39] or attestation [37], but these mechanisms require a chain of trust and assumptions that the hardware or a hypervisor works correctly.”
A Hybrid Architecture for Interactive Verifiable Computation (2013, unknown): “Experimental results indicate that our system performs better and applies more widely than the best in the literature.”
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.”
Resolving the conflict between generality and plausibility in verified computation (2013, background): “The systems literature contains many practical, implemented systems (see recent surveys [46, 52]); however, these are either specialpurpose or conditional (e.”
The Efficient Server Audit Problem, Deduplicated Re-execution, and the Web (2017, methodology): “This includes TPM-based approaches [27, 44, 58, 59, 66, 71, 74, 79] and systems [14, 17, 48, 73, 77] built on SGX hardware [49].”