{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T10:52:38Z","timestamp":1794480758989,"version":"4.9.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662443804","type":"print"},{"value":"9783662443811","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","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-662-44381-1_26","type":"book-chapter","created":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T00:27:09Z","timestamp":1405297629000},"page":"458-475","source":"Crossref","is-referenced-by-count":50,"title":["Amortizing Garbled Circuits"],"prefix":"10.1007","author":[{"given":"Yan","family":"Huang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vladimir","family":"Kolesnikov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ranjit","family":"Kumaresan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alex J.","family":"Malozemoff","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-40084-1_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"B. Applebaum","year":"2013","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E., Waters, B.: Encoding functions with constant online rate or how to compress garbled circuits keys. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol.\u00a08043, pp. 166\u2013184. Springer, Heidelberg (2013)"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/3-540-44750-4_8","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"D. Beaver","year":"1995","unstructured":"Beaver, D.: Precomputing oblivious transfer. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 97\u2013109. Springer, Heidelberg (1995)"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-34961-4_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"M. Bellare","year":"2012","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Adaptively secure garbling with applications to one-time programs and secure outsourcing. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol.\u00a07658, pp. 134\u2013153. Springer, Heidelberg (2012)"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-642-40041-4_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D. Cash","year":"2013","unstructured":"Cash, D., Jarecki, S., Jutla, C., Krawczyk, H., Ro\u015fu, M.-C., Steiner, M.: Highly-scalable searchable symmetric encryption with support for boolean queries. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol.\u00a08042, pp. 353\u2013373. Springer, Heidelberg (2013)"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-642-14623-7_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"I. Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Orlandi, C.: Multiparty computation for dishonest majority: From passive to active security at low cost. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 558\u2013576. Springer, Heidelberg (2010)"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-642-38348-9_32","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"T.K. Frederiksen","year":"2013","unstructured":"Frederiksen, T.K., Jakobsen, T.P., Nielsen, J.B., Nordholt, P.S., Orlandi, C.: MiniLEGO: Efficient secure two-party computation from general assumptions. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol.\u00a07881, pp. 537\u2013556. Springer, Heidelberg (2013)"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-14623-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"R. Gennaro","year":"2010","unstructured":"Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 465\u2013482. Springer, Heidelberg (2010)"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Gordon, S.D., Katz, J., Kolesnikov, V., Krell, F., Malkin, T., Raykova, M., Vahlis, Y.: Secure two-party computation in sublinear (amortized) time. In: Yu, T., Danezis, G., Gligor, V.D. (eds.) ACM CCS 2012, pp. 513\u2013524. ACM Press (2012)","DOI":"10.1145\/2382196.2382251"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-40084-1_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"Y. Huang","year":"2013","unstructured":"Huang, Y., Katz, J., Evans, D.: Efficient secure two-party computation using symmetric cut-and-choose. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol.\u00a08043, pp. 18\u201335. Springer, Heidelberg (2013)"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y. Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 145\u2013161. Springer, Heidelberg (2003)"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y. Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer \u2013 efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 572\u2013591. Springer, Heidelberg (2008)"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Jutla, C.S., Krawczyk, H., Rosu, M.C., Steiner, M.: Outsourced symmetric private information retrieval. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, pp. 875\u2013888. ACM Press (2013)","DOI":"10.1145\/2508859.2516730"},{"key":"26_CR13","unstructured":"Kiraz, M., Schoenmakers, B.: A protocol issue for the malicious case of Yao\u2019s garbled-circuit construction. In: 27th Symposium on Information Theory in the Benelux, pp. 283\u2013290 (2006)"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40084-1_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"Y. Lindell","year":"2013","unstructured":"Lindell, Y.: Fast cut-and-choose based protocols for malicious and covert adversaries. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol.\u00a08043, pp. 1\u201317. Springer, Heidelberg (2013)"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-72540-4_4","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"Y. Lindell","year":"2007","unstructured":"Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 52\u201378. Springer, Heidelberg (2007)"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-642-19571-6_20","volume-title":"Theory of Cryptography","author":"Y. Lindell","year":"2011","unstructured":"Lindell, Y., Pinkas, B.: Secure two-party computation via cut-and-choose oblivious transfer. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 329\u2013346. Springer, Heidelberg (2011)"},{"key":"26_CR17","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1007\/978-3-662-44381-1_27","volume-title":"CRYPTO 2014, Part II","author":"Y. Lindell","year":"2014","unstructured":"Lindell, Y., Riva, B.: Cut-and-choose secure computation in the online\/offline and batch settings. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part II. LNCS, vol.\u00a08617, pp. 476\u2013494. Springer, Heidelberg (2014)"},{"key":"26_CR18","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay \u2014 a secure two-party computation system. In: Blaze, M. (ed.) 13th USENIX Security Symposium. USENIX Association (August 2004)"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/11745853_30","volume-title":"Public Key Cryptography - PKC 2006","author":"P. Mohassel","year":"2006","unstructured":"Mohassel, P., Franklin, M.: Efficiency tradeoffs for malicious two-party computation. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 458\u2013473. Springer, Heidelberg (2006)"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-40084-1_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"P. Mohassel","year":"2013","unstructured":"Mohassel, P., Riva, B.: Garbled circuits checking garbled circuits: More efficient and secure two-party computation. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol.\u00a08043, pp. 36\u201353. Springer, Heidelberg (2013)"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-642-32009-5_40","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"J.B. Nielsen","year":"2012","unstructured":"Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A new approach to practical active-secure two-party computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 681\u2013700. Springer, Heidelberg (2012)"},{"key":"26_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-00457-5_22","volume-title":"Theory of Cryptography","author":"J.B. Nielsen","year":"2009","unstructured":"Nielsen, J.B., Orlandi, C.: LEGO for two-party secure computation. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 368\u2013386. Springer, Heidelberg (2009)"},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"Pappas, V., Vo, B., Krell, F., Choi, S.G., Kolesnikov, V., Bellovin, S., Keromytis, A., Malkin, T.: Blind seer: A scalable private DBMS. In: 2014 IEEE Symposium on Security and Privacy. IEEE Computer Society Press (May 2014)","DOI":"10.1109\/SP.2014.30"},{"key":"26_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-39200-9_6","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"B. Pinkas","year":"2003","unstructured":"Pinkas, B.: Fair secure two-party computation. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 87\u2013105. Springer, Heidelberg (2003)"},{"key":"26_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-642-20465-4_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"A. shelat","year":"2011","unstructured":"shelat, A., Shen, C.-h.: Two-Output Secure Computation with Malicious Adversaries. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 386\u2013405. Springer, Heidelberg (2011)"},{"key":"26_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-72540-4_5","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"D.P. Woodruff","year":"2007","unstructured":"Woodruff, D.P.: Revisiting the efficiency of malicious two-party computation. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 79\u201396. Springer, Heidelberg (2007)"},{"key":"26_CR27","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th FOCS, pp. 162\u2013167. IEEE Computer Society Press (October 1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44381-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T15:20:30Z","timestamp":1565623230000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44381-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662443804","9783662443811"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44381-1_26","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-662-44381-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}