{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:26:48Z","timestamp":1743089208625,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319112022"},{"type":"electronic","value":"9783319112039"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11203-9_17","type":"book-chapter","created":{"date-parts":[[2014,8,14]],"date-time":"2014-08-14T20:36:46Z","timestamp":1408048606000},"page":"292-309","source":"Crossref","is-referenced-by-count":3,"title":["Verifiable Computation with Reduced Informational Costs and Computational Costs"],"prefix":"10.1007","author":[{"given":"Gang","family":"Xu","sequence":"first","affiliation":[]},{"given":"George T.","family":"Amariucai","sequence":"additional","affiliation":[]},{"given":"Yong","family":"Guan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-22792-9_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"S. Benabbas","year":"2011","unstructured":"Benabbas, S., Gennaro, R., Vahlis, Y.: Verifiable delegation of computation over large datasets. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 111\u2013131. Springer, Heidelberg (2011)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-20465-4_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D. Boneh","year":"2011","unstructured":"Boneh, D., Freeman, D.M.: Homomorphic signatures for polynomial functions. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 149\u2013168. Springer, Heidelberg (2011)"},{"key":"17_CR3","first-page":"592","volume-title":"Proceedings of the 37th Annual Symposium on Foundations of Computer Science","author":"F. Ergun","year":"1996","unstructured":"Ergun, F., Kumar, S.R.: Approximate checking of polynomials and functional equations. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pp. 592\u2013607. IEEE Computer Society, Washington, DC (1996)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/3-540-45353-9_31","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"P. Golle","year":"2001","unstructured":"Golle, P., Mironov, I.: Uncheatable distributed computations. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 425\u2013440. Springer, Heidelberg (2001)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-11145-7_15","volume-title":"Information and Communications Security","author":"G.O. Karame","year":"2009","unstructured":"Karame, G.O., Strasser, M., \u010capkun, S.: Secure remote execution of sequential computations. In: Qing, S., Mitchell, C.J., Wang, G. (eds.) ICICS 2009. LNCS, vol.\u00a05927, pp. 181\u2013197. Springer, Heidelberg (2009)"},{"key":"17_CR6","unstructured":"Sion, R.: Query execution assurance for outsourced databases. In: Proceedings of the 31st International Conference on Very Large Data Bases, VLDB 2005, pp. 601\u2013612. VLDB Endowment (2005)"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-642-03168-7_11","volume-title":"Privacy Enhancing Technologies","author":"B. Thompson","year":"2009","unstructured":"Thompson, B., Haber, S., Horne, W.G., Sander, T., Yao, D.: Privacy-preserving computation and verification of aggregate queries on outsourced databases. In: Goldberg, I., Atallah, M.J. (eds.) PETS 2009. LNCS, vol.\u00a05672, pp. 185\u2013201. Springer, Heidelberg (2009)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Wang, C., Ren, K., Wang, J.: Secure and practical outsourcing of linear programming in cloud computing. In: INFOCOM, pp. 820\u2013828. IEEE (2011)","DOI":"10.1109\/INFCOM.2011.5935305"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1109\/ICDCS.2011.41","volume-title":"Proceedings of the 2011 31st International Conference on Distributed Computing Systems, ICDCS 2011","author":"C. Wang","year":"2011","unstructured":"Wang, C., Ren, K., Wang, J., Urs, K.M.R.: Harnessing the cloud for securely solving large-scale systems of linear equations. In: Proceedings of the 2011 31st International Conference on Distributed Computing Systems, ICDCS 2011, pp. 549\u2013558. IEEE Computer Society, Washington, DC (2011)"},{"key":"17_CR10","first-page":"48","volume-title":"Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security, ASIACCS 2010","author":"M.J. Atallah","year":"2010","unstructured":"Atallah, M.J., Frikken, K.B.: Securely outsourcing linear algebra computations. In: Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security, ASIACCS 2010, pp. 48\u201359. ACM, New York (2010)"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Garofalakis, M.: Proof sketches: Verifiable in-network aggregation. In: IEEE Internation Conference on Data Engineering, ICDE (2007)","DOI":"10.1109\/ICDE.2007.368958"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1145\/958491.958521","volume-title":"Proceedings of the 1st International Conference on Embedded Networked Sensor Systems, SenSys 2003","author":"B. Przydatek","year":"2003","unstructured":"Przydatek, B., Song, D., Perrig, A.: Sia: secure information aggregation in sensor networks. In: Proceedings of the 1st International Conference on Embedded Networked Sensor Systems, SenSys 2003, pp. 255\u2013265. ACM, New York (2003)"},{"issue":"1","key":"17_CR13","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 J. Comput.\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"17_CR14","first-page":"113","volume-title":"Proceedings of the 40th Annual ACM Symposium on Theory of Computing, STOC 2008","author":"S. Goldwasser","year":"2008","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, STOC 2008, pp. 113\u2013122. ACM, New York (2008)"},{"key":"17_CR15","unstructured":"Canetti, R., Riva, B., Rothblum, G.N.: Two 1-round protocols for delegation of computation. Cryptology ePrint Archive, Report 2011\/518 (2011), http:\/\/eprint.iacr.org\/"},{"key":"17_CR16","first-page":"90","volume-title":"Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS 2012","author":"G. Cormode","year":"2012","unstructured":"Cormode, G., Mitzenmacher, M., Thaler, J.: Practical verified computation with streaming interactive proofs. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS 2012, pp. 90\u2013112. ACM, New York (2012)"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-38348-9_37","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"R. Gennaro","year":"2013","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol.\u00a07881, pp. 626\u2013645. Springer, Heidelberg (2013)"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Parno, B., Gentry, C., Howell, J., Raykova, M.: Pinocchio: nearly practical verifiable computation. In: The IEEE Symposium on Security and Privacy, IEEE S&P 2013 (2013)","DOI":"10.1109\/SP.2013.47"},{"key":"17_CR19","first-page":"2","volume-title":"Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, SFCS 1992","author":"S. Arora","year":"1992","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs; a new characterization of np. In: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, SFCS 1992, pp. 2\u201313. IEEE Computer Society, Washington, DC (1992)"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/103418.103428","volume-title":"Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, STOC 1991","author":"L. Babai","year":"1991","unstructured":"Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking computations in polylogarithmic time. In: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, STOC 1991, pp. 21\u201332. ACM, New York (1991)"},{"issue":"2","key":"17_CR21","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., Cr\u00e9peau, C.: Minimum disclosure proofs of knowledge. J. Comput. Syst. Sci.\u00a037(2), 156\u2013189 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR22","first-page":"278","volume-title":"Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity, CCC 2007","author":"Y. Ishai","year":"2007","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R.: Efficient arguments without short pcps. In: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity, CCC 2007, pp. 278\u2013291. IEEE Computer Society, Washington, DC (2007)"},{"key":"17_CR23","unstructured":"Setty, S., McPherson, R., Blumberg, A.J., Walfish, M.: Making argument systems for outsourced computation practical (sometimes). In: NDSS (2012)"},{"key":"17_CR24","unstructured":"Setty, S., Vu, V., Panpalia, N., Braun, B., Blumberg, A.J., Walfish, M.: Taking proof-based verified computation a few steps closer to practicality. In: USENIX Security (2012)"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Xu, G., Amariucai, G., Guan, Y.: Delegation of computation with verification outsourcing: Curious verifiers. In: Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2013. ACM (2013)","DOI":"10.1145\/2484239.2484253"},{"key":"17_CR26","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1145\/2465351.2465359","volume-title":"Proceedings of the 8th ACM European Conference on Computer Systems, EuroSys 2013","author":"S. Setty","year":"2013","unstructured":"Setty, S., Braun, B., Vu, V., Blumberg, A.J., Parno, B., Walfish, M.: Resolving the conflict between generality and plausibility in verified computation. In: Proceedings of the 8th ACM European Conference on Computer Systems, EuroSys 2013, pp. 71\u201384. ACM, New York (2013)"},{"key":"17_CR27","first-page":"29","volume-title":"Proceedings of the 13th USENIX Conference on Hot Topics in Operating Systems, HotOS 2013","author":"S. Setty","year":"2011","unstructured":"Setty, S., Blumberg, A.J., Walfish, M.: Toward practical and unconditional verification of remote computations. In: Proceedings of the 13th USENIX Conference on Hot Topics in Operating Systems, HotOS 2013, p. 29. USENIX Association, Berkeley (2011)"},{"issue":"3","key":"17_CR28","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"J. ACM"},{"key":"17_CR29","doi-asserted-by":"crossref","unstructured":"Knuth, D.E.: Seminumerical Algorithms, the art of computer programming, 3rd edn. Addison-Wesley (2007)","DOI":"10.1145\/1283920.1283929"},{"key":"17_CR30","unstructured":"Setty, S., Vu, V., Panpalia, N., Braun, B., Ali, M., Blumberg, A.J., Walfish, M.: Taking proof-based verified computation a few steps closer to practicality (extended version). Cryptology ePrint Archive, Report 2012\/598 (2012), http:\/\/eprint.iacr.org\/"}],"container-title":["Lecture Notes in Computer Science","Computer Security - ESORICS 2014"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11203-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T10:19:57Z","timestamp":1717237197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11203-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319112022","9783319112039"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11203-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}