Taking proof-based verified computation a few steps closer to practicality

Proceedings of the 21st USENIX Security Symposium

Volumn , Issue , 2012, Pages 253-268

  Setty, Srinath ^a   Vu, Victor ^a   Panpalia, Nikhil ^a   Braun, Benjamin ^a   Blumberg, Andrew J ^a   Walfish, Michael ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL ARITHMETIC; FOOD ADDITIVES;

ARGUMENT SYSTEMS; COMPUTATIONAL MODEL; CONTROL FLOWS; CRYPTOGRAPHIC TECHNIQUES; FLOATING POINTS; INTERACTIVE PROTOCOLS; LOGICAL OPERATIONS; VERIFIED COMPUTATIONS;

COMPUTATION THEORY;

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

References (52)

1. CUDA (http://developer.nvidia.com/what-cuda).
2. Open MPI (http://www.open-mpi.org).
3. PAPI: Performance Application Programming Interface.
4. B. Applebaum, Y. Ishai, and E. Kushilevitz. From secrecy to soundness: efficient verification via secure computation. In ICALP, 2010.
5. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. J. of the ACM, 45(3):501–555, May 1998.
6. S. Arora and S. Safra. Probabilistic checking of proofs: a new characterization of NP. J. of the ACM, 45(1):70–122, Jan. 1998.
7. L. Babai, L. Fortnow, L. A. Levin, and M. Szegedy. Checking computations in polylogarithmic time. In STOC, 1991.
8. M. Bellare, D. Coppersmith, J. Håstad, M. Kiwi, and M. Sudan. Linearity testing in characteristic two. IEEE Transactions on Information Theory, 42(6):1781–1795, Nov. 1996.
9. M. Bellare, S. Goldwasser, C. Lund, and A. Russell. Efficient probabilistically checkable proofs and applications to approximations. In STOC, 1993.
10. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-prover interactive proofs: how to remove intractability assumptions. In STOC, 1988.
11. E. Ben-Sasson, A. Chiesa, D. Genkin, and E. Tromer. Fast reductions from RAMs to delegatable succinct constraint satisfaction problems. Feb. 2012. Cryptology eprint 071.
12. E. Ben-Sasson, A. Chiesa, D. Genkin, and E. Tromer. On the concrete-efficiency threshold of probabilistically-checkable proofs. ECCC, (045), Apr. 2012.
13. E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, and S. Vadhan. Robust PCPs of proximity, shorter PCPs and applications to coding. SIAM J. on Comp., 36(4):889–974, Dec. 2006.
14. E. Ben-Sasson and M. Sudan. Short PCPs with polylog query complexity. SIAM J. on Comp., 38(2):551–607, May 2008.
15. M. Blum and S. Kannan. Designing programs that check their work. J. of the ACM, 42(1):269–291, 1995.
16. M. Blum, M. Luby, and R. Rubinfeld. Self-testing/correcting with applications to numerical problems. J. of Comp. and Sys. Sciences, 47(3):549–595, Dec. 1993.
17. D. Boneh and D. M. Freeman. Homomorphic signatures for polynomial functions. In EUROCRYPT, 2011.
18. D. Boneh, E. J. Goh, and K. Nissim. Evaluating 2-DNF formulas on ciphertexts. In TCC, 2005.
19. G. Brassard, D. Chaum, and C. Crépeau. Minimum disclosure proofs of knowledge. J. of Comp. and Sys. Sciences, 37(2):156–189, 1988.
20. K.-M. Chung, Y. Kalai, and S. Vadhan. Improved delegation of computation using fully homomorphic encryption. In CRYPTO, 2010.
21. G. Cormode, M. Mitzenmacher, and J. Thaler. Practical verified computation with streaming interactive proofs. In ITCS, 2012.
22. I. Dinur. The PCP theorem by gap amplification. J. of the ACM, 54(3), June 2007.
23. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31:469–472, 1985.
24. R. Gennaro, C. Gentry, and B. Parno. Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In CRYPTO, 2010.
25. R. Gennaro, C. Gentry, B. Parno, and M. Raykova. Quadratic span programs and succinct NIZKs without PCPs. Apr. 2012. Cryptology eprint 215.
26. R. Gennaro and D. Wichs. Fully homomorphic message authenticators. May 2012. Cryptology eprint 290.
27. C. Gentry. A fully homomorphic encryption scheme. PhD thesis, Stanford University, 2009.
28. C. Gentry, S. Halevi, and N. Smart. Homomorphic evaluation of the AES circuit. In CRYPTO, 2012.
29. D. Goldberg. What every computer scientist should know about floating-point arithmetic. ACM Computing Surveys, 23(1):5–48, Mar. 1991.
30. O. Goldreich. Foundations of Cryptography: II Basic Applications. Cambridge University Press, 2004.
31. S. Goldwasser, Y. T. Kalai, and G. N. Rothblum. Delegating computation: Interactive proofs for muggles. In STOC, 2008.
32. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM J. on Comp., 18(1):186–208, 1989.
33. J. Groth. Linear algebra with sub-linear zero-knowledge arguments. In CRYPTO, 2009.
34. Y. Huang, D. Evans, J. Katz, and L. Malka. Faster secure two-party computation using garbled circuits. In USENIX Security, 2011.
35. Y. Ishai, E. Kushilevitz, and R. Ostrovsky. Efficient arguments without short PCPs. In Conference on Computational Complexity (CCC), 2007.
36. K. Jang, S. Han, S. Han, S. Moon, and K. Park. SSLShader: Cheap SSL acceleration with commodity processors. In NSDI, 2011.
37. J. Kilian. A note on efficient zero-knowledge proofs and arguments (extended abstract). In STOC, 1992.
38. J. Kilian. Improved efficient arguments (preliminary version). In CRYPTO, 1995.
39. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay—a secure two-party computation system. In USENIX Security, 2004.
40. R. C. Merkle. Digital signature based on a conventional encryption function. In CRYPTO, 1987.
41. S. Micali. Computationally sound proofs. SIAM J. on Comp., 30(4):1253–1298, 2000.
42. M. Naehrig, K. Lauter, and V. Vaikuntanathan. Can homomorphic encryption be practical? In ACM Workshop on Cloud Computing Security, 2011.
43. A. Polishchuk and D. A. Spielman. Nearly-linear size holographic proofs. In STOC, 1994.
44. S. Setty, A. J. Blumberg, and M. Walfish. Toward practical and unconditional verification of remote computations. In HotOS, 2011.
45. S. Setty, R. McPherson, A. J. Blumberg, and M. Walfish. Making argument systems for outsourced computation practical (sometimes). In NDSS, 2012.
46. S. Setty, V. Vu, N. Panpalia, B. Braun, A. J. Blumberg, and M. Walfish. Taking proof-based verified computation a few steps closer to practicality (extended version). Technical Report TR-12-14, Dept. of CS, UT Austin, June 2012.
47. N. Smart and F. Vercauteren. Fully homomorphic SIMD operations. Aug. 2011. Cryptology eprint 133.
48. J. Thaler. Personal communication, June 2012.
49. J. Thaler, M. Roberts, M. Mitzenmacher, and H. Pfister. Verifiable computation with massively parallel interactive proofs. In USENIX HotCloud Workshop, June 2012. Full paper at http://arxiv.org/abs/1202.1350, Feb. 2012.
50. C. Wang, K. Ren, J. Wang, and K. M. R. Urs. Harnessing the cloud for securely outsourcing large-scale systems of linear equations. In Intl. Conf. on Dist. Computing Sys. (ICDCS), 2011.
51. D. A. Wheeler. SLOCCount.
52. A. C.-C. Yao. How to generate and exchange secrets. In FOCS, 1986.