Verifiable computation with massively parallel interactive proofs

4th USENIX Workshop on Hot Topics in Cloud Computing, HotCloud 2012

Volumn , Issue , 2012, Pages

  Thaler, Justin ^a   Roberts, Mike ^a   Mitzenmacher, Michael ^a   Pfister, Hanspeter ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM PROCESSORS;

BENCH-MARK PROBLEMS; COMPUTATIONAL BURDEN; DATA PARALLELISM; INTERACTIVE PROOFS; MASSIVELY PARALLELS; PARALLEL PROCESSING; SEQUENTIAL IMPLEMENTATION; UNTRUSTED SERVER;

CLOUD COMPUTING;

EID: 85088779599     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. J. Applequist. New assured cloud computing center to be established at Illinois. May 2011.
2. S. Arora and B. Barak. Computational Complexity: A Modern Approach. Cambridge University Press, 2009.
3. G. Cormode, M. Mitzenmacher, and J. Thaler. Practical verified computation with streaming interactive proofs. In Proc. ITCS, 2012.
4. G. Cormode, J. Thaler, and K. Yi. Verifying computations with streaming interactive proofs. In Proc. VLDB Endowment, 2011.
5. S. Goldwasser, Y. T. Kalai, and G. N. Rothblum. Delegating computation: Interactive proofs for muggles. In Proc. STOC, pages 113-122, 2008.
6. Y. Ishai, E. Kushilevitz, and R. Ostrovsky. Efficient arguments without short PCPs. In Proc. CCC, pages 278-291, 2007.
7. S. Setty, R. McPherson, A. J. Blumberg, and M. Walfish. Making argument systems for outsourced computation practical (sometimes). In Proc. NDSS, 2012.
8. J. Thaler, M. Roberts, M. Mitzenmacher, and H. Pfister. Source code. http://people.seas.harvard.edu/-jthaler/TRMPcode.htm. 2012.
9. J. Thaler, M. Roberts, M. Mitzenmacher, and H. Pfister. Verifiable computation with massively parallel interactive proofs. CoRR, abs/1202.1350, 2012.