{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,7]],"date-time":"2026-11-07T18:31:14Z","timestamp":1794076274494,"version":"4.8.0"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642146220","type":"print"},{"value":"9783642146237","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14623-7_25","type":"book-chapter","created":{"date-parts":[[2010,8,10]],"date-time":"2010-08-10T04:15:26Z","timestamp":1281413726000},"page":"465-482","source":"Crossref","is-referenced-by-count":651,"title":["Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers"],"prefix":"10.1007","author":[{"given":"Rosario","family":"Gennaro","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Craig","family":"Gentry","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bryan","family":"Parno","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Amazon Elastic Compute Cloud, http:\/\/aws.amazon.com\/ec2"},{"key":"25_CR2","unstructured":"The Folding@home project. Stanford University, http:\/\/www.stanford.edu\/group\/pandegroup\/cosm\/"},{"key":"25_CR3","unstructured":"Sun Utility Computing, http:\/\/www.sun.com\/service\/sungrid\/index.jsp"},{"key":"25_CR4","unstructured":"The Great Internet Mersenne Prime Search, http:\/\/www.mersenne.org\/"},{"issue":"11","key":"25_CR5","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/581571.581573","volume":"45","author":"D.P. Anderson","year":"2002","unstructured":"Anderson, D.P., Cobb, J., Korpela, E., Lebofsky, M., Werthimer, D.: SETI@Home: An experiment in public-resource computing. Communications of the ACM\u00a045(11), 56\u201361 (2002)","journal-title":"Communications of the ACM"},{"key":"25_CR6","first-page":"421","volume-title":"Proceedings of the ACM Symposium on Theory of Computing (STOC)","author":"L. Babai","year":"1985","unstructured":"Babai, L.: Trading group theory for randomness. In: Proceedings of the ACM Symposium on Theory of Computing (STOC), pp. 421\u2013429. ACM, New York (1985)"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44647-8_1","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"B. Barak","year":"2001","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahay, A., Vadhan, S., Yang, K.: On the (im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 1\u201318. Springer, Heidelberg (2001)"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Barak, B., Haitner, I., Hofheinz, D., Ishai, Y.: Bounded key-dependent message security. In: Proceedings of EuroCrypt (June 2010)","DOI":"10.1007\/978-3-642-13190-5_22"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/1403027.1403046","volume-title":"Proceedings of the Workshop on Economics of Networked Systems (NetEcon)","author":"M. Belenkiy","year":"2008","unstructured":"Belenkiy, M., Chase, M., Erway, C.C., Jannotti, J., K\u00fcp\u00e7\u00fc, A., Lysyanskaya, A.: Incentivizing outsourced computation. In: Proceedings of the Workshop on Economics of Networked Systems (NetEcon), pp. 85\u201390. ACM, New York (2008)"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"D. Chaum","year":"1993","unstructured":"Chaum, D., Pedersen, T.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 89\u2013105. Springer, Heidelberg (1993)"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Gentry, C., Parno, B.: Non-Interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers, http:\/\/eprint.iacr.org\/2009\/547","DOI":"10.1007\/978-3-642-14623-7_25"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. PhD thesis, Stanford University (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the ACM Symposium on the Theory of Computing (STOC) (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. In: Proceedings of the ACM Symposium on the Theory of Computing (2008)","DOI":"10.1145\/1374376.1374396"},{"issue":"1","key":"25_CR15","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. SIAM Journal on Computing\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Golle, P., Mironov, I.: Uncheatable distributed computations. In: Proceedings of the RSA Conference (2001)","DOI":"10.1007\/3-540-45353-9_31"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-540-30576-7_15","volume-title":"Theory of Cryptography","author":"S. Hohenberger","year":"2005","unstructured":"Hohenberger, S., Lysyanskaya, A.: How to securely outsource cryptographic computations. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 264\u2013282. Springer, Heidelberg (2005)"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-03356-8_9","volume-title":"CRYPTO 2009","author":"Y.T. Kalai","year":"2009","unstructured":"Kalai, Y.T., Raz, R.: Probabilistically checkable arguments. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 143\u2013159. Springer, Heidelberg (2009)"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: Proceedings of the ACM Symposium on Theory of Computing (STOC) (1992)","DOI":"10.1145\/129712.129782"},{"key":"25_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/3-540-44750-4_25","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"J. Kilian","year":"1995","unstructured":"Kilian, J.: Improved efficient arguments (preliminary version). In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 311\u2013324. Springer, Heidelberg (1995)"},{"issue":"2","key":"25_CR21","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y. Lindell","year":"2009","unstructured":"Lindell, Y., Pinkas, B.: A proof of Yao\u2019s protocol for secure two-party computation. Journal of Cryptology\u00a022(2), 161\u2013188 (2009)","journal-title":"Journal of Cryptology"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Micali, S.: CS proofs (extended abstract). In: Proceedings of the IEEE Symposium on Foundations of Computer Science (1994)","DOI":"10.1109\/SFCS.1994.365746"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Molnar, D.: The SETI@Home problem. ACM Crossroads, 7.1 (2000)","DOI":"10.1145\/351092.351096"},{"key":"25_CR24","unstructured":"Monrose, F., Wyckoff, P., Rubin, A.: Distributed execution with remote audit. In: Proceedings of ISOC Network and Distributed System Security Symposium (NDSS) (February 1999)"},{"key":"25_CR25","unstructured":"Rothblum, G.: Delegating Computation Reliably: Paradigms and Constructions. PhD thesis, Massachusetts Institute of Technology (2009)"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Rothblum, G., Vadhan, S.: Are PCPs inherent in efficient arguments? In: Proceedings of Computational Complexity (CCC) (2009)","DOI":"10.1109\/CCC.2009.40"},{"key":"25_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-642-13013-7_25","volume-title":"PKC 2010","author":"N.P. Smart","year":"2010","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 420\u2013443. Springer, Heidelberg (2010)"},{"key":"25_CR28","first-page":"831","volume":"31","author":"S. Smith","year":"1999","unstructured":"Smith, S., Weingart, S.: Building a high-performance, programmable secure coprocessor. Computer Networks (Special Issue on Computer Network Security)\u00a031, 831\u2013960 (1999)","journal-title":"Computer Networks (Special Issue on Computer Network Security)"},{"key":"25_CR29","unstructured":"Trusted Computing Group. Trusted platform module main specification. Version 1.2, Revision 103 (July 2007)"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Proceedings of EuroCrypt (June 2010)","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"25_CR31","doi-asserted-by":"crossref","unstructured":"Yao, A.: Protocols for secure computations. In: Proceedings of the IEEE Symposium on Foundations of Computer Science (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"25_CR32","doi-asserted-by":"crossref","unstructured":"Yao, A.: How to generate and exchange secrets. In: Proceedings of the IEEE Symposium on Foundations of Computer Science (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"25_CR33","unstructured":"Yee, B.S.: Using Secure Coprocessors. PhD thesis, Carnegie Mellon University (1994)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14623-7_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:55:39Z","timestamp":1606168539000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14623-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642146220","9783642146237"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14623-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}