{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T08:40:35Z","timestamp":1774600835732,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642141645","type":"print"},{"value":"9783642141652","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_14","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T13:26:02Z","timestamp":1278336362000},"page":"152-163","source":"Crossref","is-referenced-by-count":92,"title":["From Secrecy to Soundness: Efficient Verification via Secure Computation"],"prefix":"10.1007","author":[{"given":"Benny","family":"Applebaum","sequence":"first","affiliation":[]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Feigenbaum, J., Kilian, J.: On hiding information from an oracle. In: STOC (1987)","DOI":"10.1145\/28395.28417"},{"issue":"2","key":"14_CR2","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00037-006-0211-8","volume":"15","author":"B. Applebaum","year":"2006","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Computationally private randomizing polynomials and their applications. Computional Complexity\u00a015(2), 115\u2013162 (2006)","journal-title":"Computional Complexity"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC0. In: SICOMP, vol.\u00a036(4), pp. 845\u2013888 (2006)","DOI":"10.1137\/S0097539705446950"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Babai, L.: Trading group theory for randomness. In: STOC (1985)","DOI":"10.1145\/22145.22192"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"STACS 1990","author":"D. Beaver","year":"1990","unstructured":"Beaver, D., Feigenbaum, J.: Hiding instances in multioracle queries. In: Choffrut, C., Lengauer, T. (eds.) STACS 1990. LNCS, vol.\u00a0415. Springer, Heidelberg (1990)"},{"issue":"2","key":"14_CR6","first-page":"195","volume":"59","author":"A. Beimel","year":"1999","unstructured":"Beimel, A., G\u00e1l, A.: On arithmetic branching programs. JCSS\u00a059(2), 195\u2013220 (1999)","journal-title":"JCSS"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Blum, M., Kannan, S.: Programs that check their work. In: STOC (1989)","DOI":"10.1145\/73007.73015"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Program result checking against adaptive programs and in cryptographic settings. In: Distributed Computing and Crypthography: DIMACS Workshop (1990)","DOI":"10.1090\/dimacs\/002\/06"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-testing\/correcting programs with applications to numerical problems. In: STOC (1990)","DOI":"10.1145\/100216.100225"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0020812","volume-title":"STACS 91","author":"G. Buntrock","year":"1991","unstructured":"Buntrock, G., Damm, C., Hertrampf, U., Meinel, C.: Structure and importance of logspace-MOD-classes. In: Jantzen, M., Choffrut, C. (eds.) STACS 1991. LNCS, vol.\u00a0480. Springer, Heidelberg (1991)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Chung, K.M., Kalai, Y.T., Vadhan, S.: Improved delegation of computation using fully homomorphic encryption (2010) (in submission)","DOI":"10.1007\/978-3-642-14623-7_26"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39200-9_37","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"R. Cramer","year":"2003","unstructured":"Cramer, R., Fehr, S., Ishai, Y., Kushilevitz, E.: Efficient multi-party computation over rings. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656. Springer, Heidelberg (2003)"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-540-45146-4_15","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"I. Damg\u00e5rd","year":"2003","unstructured":"Damg\u00e5rd, I., Nielsen, J.: Universally composable efficient multiparty computation from threshold homomorphic encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 247\u2013264. Springer, Heidelberg (2003)"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J.: Locally random reductions in interactive complexity theory. In: Advances in Computational Complexity Theory. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol.\u00a013, pp. 73\u201398 (1993)","DOI":"10.1090\/dimacs\/013\/05"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"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\/","DOI":"10.1007\/978-3-642-14623-7_25"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, vol.\u00a07 (1987)","DOI":"10.1145\/28395.28420"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Gutfreund, D., Healy, A., Kaufman, T., Rothblum, G.N.: Verifying and decoding in constant depth. In: STOC (2007)","DOI":"10.1145\/1250790.1250855"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Gutfreund, D., Healy, A., Kaufman, T., Rothblum, G.N.: A (de)constructive approach to program checking. In: STOC (2008)","DOI":"10.1145\/1374376.1374399"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. In: STOC (2008)","DOI":"10.1145\/1374376.1374396"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. In: SICOMP, vol.\u00a018 (1989)","DOI":"10.1137\/0218012"},{"key":"14_CR22","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":"14_CR23","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: A new representation with applications to round-efficient secure computation. In: FOCS (2000)"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E.: Perfect constant-round secure computation via perfect randomizing polynomials. In: ICALP (2002)","DOI":"10.1007\/3-540-45465-9_22"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-642-00457-5_18","volume-title":"Theory of Cryptography","author":"Y. Ishai","year":"2009","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Secure arithmetic computation with no honest majority. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 294\u2013314. Springer, Heidelberg (2009)"},{"key":"14_CR26","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":"Advances in Cryptology - CRYPTO 2009","author":"Y.T. Kalai","year":"2009","unstructured":"Kalai, Y.T., Raz, R.: Probabilistically checkable arguments. In: Halevi, S. (ed.) Advances in Cryptology - CRYPTO 2009. LNCS, vol.\u00a05677, pp. 143\u2013159. Springer, Heidelberg (2009)"},{"key":"14_CR27","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: Structure in Complexity Theory Conference (1993)"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Lipton, R.J.: New directions in testing. In: Distributed Computing and Cryptography. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a02, pp. 191\u2013202 (1991)","DOI":"10.1090\/dimacs\/002\/13"},{"key":"14_CR29","unstructured":"Mahajan, M., Vinay, V.: Determinant: combinatorics, algorithms and complexity. Chicago J. Theoret. Comput. Sci.\u00a0(5) (1997)"},{"key":"14_CR30","unstructured":"Micali, S.: CS proofs (extended abstracts). In: FOCS (1994)"},{"issue":"4","key":"14_CR31","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF01961540","volume":"15","author":"R. Rubinfeld","year":"1996","unstructured":"Rubinfeld, R.: Designing checkers for programs that run in parallel. Algorithmica\u00a015(4), 287\u2013301 (1996)","journal-title":"Algorithmica"},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: FOCS (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14165-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T16:31:30Z","timestamp":1740241890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_14"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}