Refereed delegation of computation

Information and Computation

Volumn 226, Issue , 2013, Pages 16-36

  Canetti, Ran ^a,b   Riva, Ben ^b   Rothblum, Guy N ^c  

^a BOSTON UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c MICROSOFT RESEARCH   (United States)

Author keywords

Delegation of Computation; Refereed Games; Verifiable Computation

Indexed keywords

CLOUD COMPUTING; COMPUTATION THEORY;

COMPUTABLE FUNCTIONS; COMPUTATION MODEL; GENERAL SOLUTIONS; PROTOTYPE IMPLEMENTATIONS; REFEREED GAMES; ROUND COMPLEXITY; SECURE PROTOCOLS; UNTRUSTED SERVER;

TURING MACHINES;

EID: 84874940192     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2013.03.003     Document Type: Article

References (41)

1. [1] Applebaum, B., Ishai, Y., Kushilevitz, E., From secrecy to soundness: efficient verification via secure computation. Proceedings of the 37th International Colloquium Conference on Automata, Languages and Programming, 2010, Springer-Verlag, 152–163.
2. [2] Arora, S., Safra, S., Probabilistic checking of proofs: a new characterization of NP. J. ACM 45 (1998), 70–122.
3. [3] Babai, L., Fortnow, L., Levin, L.A., Szegedy, M., Checking computations in polylogarithmic time. Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, 1991, ACM, 21–32.
4. [4] Barak, B., Goldreich, O., Universal arguments and their applications. SIAM J. Comput. 38 (2008), 1661–1694.
5. [5] Bellare, M., Impagliazzo, R., Naor, M., Does parallel repetition lower the error in computationally sound protocols?. Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997, IEEE Computer Society, 374–383.
6. [6] Ben-Or, M., Goldwasser, S., Kilian, J., Wigderson, A., Multi-prover interactive proofs: how to remove intractability assumptions. Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, 1988, ACM, 113–131.
7. [7] Benabbas, S., Gennaro, R., Vahlis, Y., Verifiable delegation of computation over large datasets. Proceedings of the 31st Annual Conference on Advances in Cryptology, 2011, Springer-Verlag, 111–131.
8. [8] Bitansky, N., Canetti, R., Chiesa, A., Tromer, E., From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, 2012, ACM, 326–349.
9. [9] BOINC, Validation and replication. http://boinc.berkeley.edu/trac/wiki/ValidationSummary, 2011.
10. [10] Canetti, R., Halevi, S., Steiner, M., Hardness amplification of weakly verifiable puzzles. Proceedings of the Second Theory of Cryptography Conference, 2005, Springer-Verlag, 17–33.
11. [11] Canetti, R., Riva, B., Rothblum, G.N., Practical delegation of computation using multiple servers. Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011, ACM, 445–454.
12. [12] Canetti, R., Riva, B., Rothblum, G.N., Refereed delegation of computation. http://www.cs.tau.ac.il/~canetti/CRR11.pdf, 2011.
13. [13] Canetti, R., Riva, B., Rothblum, G.N., Verifiable computation with two or more clouds. in: Workshop on Cryptography and Security in Clouds http://www.zurich.ibm.com/~cca/csc2011, 2011.
14. [14] Canetti, R., Riva, B., Rothblum, G.N., Two protocols for delegation of computation. Proceedings of the 6th International Conference on Information Theoretic Security, 2012, Springer-Verlag, 37–61.
15. [15] Chung, K.M., Kalai, Y., Vadhan, S., Improved delegation of computation using fully homomorphic encryption. Proceedings of the 30th Annual Conference on Advances in Cryptology, 2010, Springer-Verlag, 483–501.
16. [16] Chung, K.M., Kalai, Y.T., Liu, F.H., Raz, R., Memory delegation. Proceedings of the 31st Annual Conference on Advances in Cryptology, 2011, Springer-Verlag, 151–165.
17. [17] Cormode, G., Mitzenmacher, M., Thaler, J., Practical verified computation with streaming interactive proofs. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, 2012, ACM, 90–112.
18. [18] Crescenzo, G., Lipmaa, H., Succinct NP proofs from an extractability assumption. Proceedings of the 4th Conference on Computability in Europe: Logic and Theory of Algorithms, 2008, Springer-Verlag, 175–185.
19. [19] Damgård, I., Faust, S., Hazay, C., Secure two-party computation with low communication. Proceedings of the 9th Theory of Cryptography Conference, 2012, Springer, 54–74.
20. [20] DynInst, an application program interface for runtime code generation. http://www.dyninst.org, 2011.
21. [21] Feige, U., Kilian, J., Making games short (extended abstract). Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, 1997, ACM, 506–516.
22. [22] Gennaro, R., Gentry, C., Parno, B., Non-interactive verifiable computing: outsourcing computation to untrusted workers. Proceedings of the 30th Annual Conference on Advances in Cryptology, 2010, Springer-Verlag, 465–482.
23. [23] Goldwasser, S., Kalai, Y.T., Rothblum, G.N., Delegating computation: interactive proofs for muggles. Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008, ACM, 113–122.
24. [24] Goldwasser, S., Lin, H., Rubinstein, A., Delegation of computation without rejection problem from designated verifier cs-proofs. Cryptology ePrint Archive, Report 2011/456, 2011.
25. [25] Golle, P., Mironov, I., Uncheatable distributed computations. Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographerʼs Track at RSA, 2001, Springer, 425–440.
26. [26] Groth, J., Short pairing-based non-interactive zero-knowledge arguments. Advances in Cryptology – ASIACRYPT 2010 – 16th International Conference on the Theory and Application of Cryptology and Information Security, 2010, Springer, 321–340.
27. [27] Haeberlen, A., Kuznetsov, P., Druschel, P., PeerReview: Practical accountability for distributed systems. Proceedings of the 21st ACM Symposium on Operating Systems Principles, 2007, ACM, 175–188.
28. [28] Kalai, Y.T., Raz, R., Probabilistically checkable arguments. Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology, 2009, Springer-Verlag, 143–159.
29. [29] Kilian, J., A note on efficient zero-knowledge proofs and arguments (extended abstract). Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, 1992, ACM, 723–732.
30. [30] Kol, G., Raz, R., Competing provers protocols for circuit evaluation. Technical Report TR11-122, Electronic Colloquium on Computational Complexity, 2011 http://eccc.hpi-web.de/.
31. [31] M. Laurenzano, M.M. Tikir, L. Carrington, A. Snavely, PEBIL: Efficient static binary instrumentation for linux, in: ISPASS, pp. 175–183.
32. [32] Luk, C.K., Cohn, R., Muth, R., Patil, H., Klauser, A., Lowney, G., Wallace, S., Reddi, V.J., Hazelwood, K., Pin: building customized program analysis tools with dynamic instrumentation. Proceedings of the 2005 ACM SIGPLAN Conference on Programming Language Design and Implementation, 2005, ACM, 190–200.
33. [33] Lund, C., Fortnow, L., Karloff, H., Nisan, N., Algebraic methods for interactive proof systems. J. ACM 39 (1992), 859–868.
34. [34] McCune, J.M., Parno, B.J., Perrig, A., Reiter, M.K., Isozaki, H., Flicker: an execution infrastructure for tcb minimization. Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008, 2008, ACM, 315–328.
35. [35] Merkle, R.C., A digital signature based on a conventional encryption function. A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology, 1988, Springer-Verlag, 369–378.
36. [36] Micali, S., Computationally sound proofs. SIAM J. Comput. 30 (2000), 1253–1298.
37. [37] Monrose, F., Wycko, P., Rubin, A.D., Distributed execution with remote audit. Proceedings of the 1999 ISOC Network and Distributed System Security Symposium, 1999, The Internet Society, 103–113.
38. [38] PyEmu, a python IA-32 emulator. http://code.google.com/p/pyemu, 2011.
39. [39] Quinʼs source code. http://www.cs.tau.ac.il/~benriva/quin, 2011.
40. [40] Rothblum, G.N., Delegating computation reliably: paradigms and constructions. PhD thesis, 2009, Massachusetts Institute of Technology.
41. [41] Shi, E., Perrig, A., Doorn Bind, L.V., A fine-grained attestation service for secure distributed systems. Proceedings of the 2005 IEEE Symposium on Security and Privacy, 2005, IEEE Computer Society, 154–168.