Improved delegation of computation using fully homomorphic encryption

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6223 LNCS, Issue , 2010, Pages 483-501

  Chung, Kai Min ^a   Kalai, Yael ^b   Vadhan, Salil ^a  

^a HARVARD UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

computationally sound proofs; outsourcing computation; universal argument systems; verifiable computation; worst case average case reductions

Indexed keywords

ARGUMENT SYSTEMS; COMPUTATIONALLY SOUND PROOFS; CRYPTOLOGY; DELEGATING COMPUTATION; DELEGATORS; E-PRINTS; FIRST CONSTRUCTIONS; FULLY HOMOMORPHIC ENCRYPTION; IMPROVED SCHEME; OFFLINE; PUBLIC KEYS; TIME COMPLEXITY; VERIFIABLE COMPUTATION; WORST-CASE/AVERAGE-CASE REDUCTIONS;

ERRORS; IMAGE QUALITY; OUTSOURCING;

CRYPTOGRAPHY;

EID: 77957002840     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14623-7_26     Document Type: Conference Paper

References (25)

1. Anderson, D.P.: Public computing: Reconnecting people to science. In: Conference on Shared Knowledge and the Web (2003)
2. Anderson, D.P.: Boinc: A system for public-resource computing and storage. In: GRID, pp. 4-20 (2004)
3. Babai, L.: Trading group theory for randomness. In: STOC, pp. 421-429 (1985)
4. Barak, B.: How to go beyond the black-box simulation barrier. In: FOCS, pp. 106-115 (2001)
5. Brassard, G., Chaum, D., Crépeau, C.: Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences 37(2), 156-189 (1988)
6. Babai, L., Fortnow, L., Lund, C.: Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity 1, 3-40 (1991)
7. Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking computations in polylogarithmic time. In: STOC, pp. 21-31 (1991)
8. Barak, B., Goldreich, O.: Universal arguments and their applications. In: IEEE Conference on Computational Complexity, pp. 194-203 (2002)
9. Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. Journal of the ACM 51(4), 557-594 (2004)
10. Chung, K.-M., Kalai, Y., Vadhan, S.: Improved delegation of computation using fully homomorphic encryption. Cryptology ePrint Archive, Report 2010/241 (2010), http://eprint.iacr.org/
11. Fortnow, L., Lund, C.: Interactive proof systems and alternating time-space complexity. Theoretical Computer Science 113(1), 55-73 (1993)
12. Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186-194. Springer, Heidelberg (1987)
13. Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC, pp. 169-178 (2009)
14. Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: Outsourcing computation to untrusted workers. Cryptology ePrint Archive, Report 2009/547 (2009), http://eprint.iacr.org/
15. Goldwasser, S., Kalai, Y.T.: On the (in)security of the fiat-shamir paradigm, pp. 102-113 (2003)
16. Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. In: STOC, pp. 113-122 (2008)
17. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. SIAM Journal on Computing 18(1), 186-208 (1989)
18. Ishai, Y., Kushilevitz, E., Ostrovsky, R.: Sufficient conditions for collision-resistant hashing. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 445-456. Springer, Heidelberg (2005)
19. Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: STOC, pp. 723-732 (1992)
20. Kalai, Y.T., Raz, R.: Probabilistically checkable arguments. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 143-159. Springer, Heidelberg (2009)
21. Lund, C., Fortnow, L., Karloff, H.J., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM 39(4), 859-868 (1992) The great internet mersenne prime search, project webpag (2007), http://www.mersenne.org/
22. Micali, S.: Cs proofs (extended abstracts). In: FOCS, pp. 436-453 (1994)
23. Micali, S.: Computationally sound proofs. SIAM J. Comput. 30(4), 1253-1298 (2000)
24. Shamir, A.: IP = PSPACE. Journal of the ACM 39(4), 869-877 (1992)
25. von Ahn, L., Maurer, B., McMillen, C., Abraham, D., Blum, M.: re-CAPTCHA: Human-Based Character Recognition via Web Security Measures. Science 321(5895), 1465-1468 (2008)