{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T11:45:39Z","timestamp":1777376739733,"version":"3.51.4"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,12,11]],"date-time":"2017-12-11T00:00:00Z","timestamp":1512950400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s00145-017-9271-y","type":"journal-article","created":{"date-parts":[[2017,12,11]],"date-time":"2017-12-11T19:58:14Z","timestamp":1513022294000},"page":"798-844","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Fast Garbling of Circuits Under Standard Assumptions"],"prefix":"10.1007","volume":"31","author":[{"given":"Shay","family":"Gueron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yehuda","family":"Lindell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ariel","family":"Nof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benny","family":"Pinkas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,11]]},"reference":[{"key":"9271_CR1","unstructured":"Circuits of Basic Functions Suitable For MPC and FHE. \n                    http:\/\/www.cs.bris.ac.uk\/Research\/CryptographySecurity\/MPC\n                    \n                  . Accessed April 2015"},{"key":"9271_CR2","unstructured":"G.\u00a0Asharov, Y.\u00a0Lindell, T.\u00a0Schneier, M.\u00a0Zohner, More efficient oblivious transfer and extensions for faster secure computation, in the 20th ACM Conference on Computer and Communications Security (ACM CCS). (2013), pp. 535\u2013548"},{"key":"9271_CR3","unstructured":"M.\u00a0Bellare, V.T.\u00a0Hoang, P.\u00a0Rogaway. Foundations of garbled circuits, in the 19th ACM Conference on Computer and Communications Security (ACM CCS). (2012), pp. 784\u2013796"},{"key":"9271_CR4","doi-asserted-by":"crossref","unstructured":"J.\u00a0Black. The ideal-cipher model, revisited: an uninstantiable blockcipher-based hash function, in FSE 2006. LNCS, vol. 4047 (Springer, Berlin, 2006), pp. 328\u2013340","DOI":"10.1007\/11799313_21"},{"key":"9271_CR5","unstructured":"M.\u00a0Bellare, V.T.\u00a0Hoang, S.\u00a0Keelveedhi, P.\u00a0Rogaway. Efficient garbling from a fixed-key blockcipher, in the IEEE Symposium on Security and Privacy 2013 (2013), pp. 478\u2013492"},{"key":"9271_CR6","doi-asserted-by":"crossref","unstructured":"A.\u00a0Biryukov, D.\u00a0Khovratovich, I.\u00a0Nikolic. Distinguisher and related-key attack on the full AES-256, in CRYPTO 2009, LNCS, vol. 5677 (Springer, Berlin, 2009), pp. 231\u2013249","DOI":"10.1007\/978-3-642-03356-8_14"},{"key":"9271_CR7","doi-asserted-by":"crossref","unstructured":"S.G.\u00a0Choi, J.\u00a0Katz, R.\u00a0Kumaresan, H.\u00a0Zhou. On the security of the \u201cFree-XOR\u201d technique, in the 9th TCC, LNCS, vol. 7194 (Springer, Berlin, 2012), pp. 39\u201353","DOI":"10.1007\/978-3-642-28914-9_3"},{"key":"9271_CR8","unstructured":"S.\u00a0Gueron. Intel Advanced Encryption Standard (AES) Instructions Set, Rev 3.01 (2012). \n                    https:\/\/software.intel.com\/en-us\/articles\/intel-advanced-encryption-standard-aes-instructions-set"},{"key":"9271_CR9","doi-asserted-by":"crossref","unstructured":"S.\u00a0Gueron. Intel\u2019s new AES instructions for enhanced performance and security, in the 16th FSE (FSE 2009). LNCS, vol. 5665 (Springer, Berlin, 2009), pp. 51\u201366","DOI":"10.1007\/978-3-642-03317-9_4"},{"key":"9271_CR10","unstructured":"S.\u00a0Gueron. Optimized implementation of AES 128\/192\/256 key expansion (2015). Software patch in \n                    https:\/\/bugzilla.mozilla.org\/show_bug.cgi?id=1122903"},{"key":"9271_CR11","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Huang, D.\u00a0Evans, J.\u00a0Katz, L.\u00a0Malka, Faster secure two-party computation using garbled circuits, in the 20th USENIX Security Symposium, 2011","DOI":"10.1007\/978-3-642-25560-1_2"},{"key":"9271_CR12","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Ishai, J.\u00a0Kilian, K.\u00a0Nissim, E.\u00a0Petrank, Extending oblivious transfer efficiently, in CRYPTO 2003, LNCS vol. 2729 (Springer, Berlin, 2003), pp. 145\u2013161","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"9271_CR13","doi-asserted-by":"crossref","unstructured":"L.R.\u00a0Knudsen, V.\u00a0Rijmen, Known-key distinguishers for some block ciphers, in ASIACRYPT 2007. LNCS, vol. 4833 (Springer, Berlin, 2007), pp. 315\u2013324","DOI":"10.1007\/978-3-540-76900-2_19"},{"key":"9271_CR14","doi-asserted-by":"crossref","unstructured":"V.\u00a0Kolesnikov, P.\u00a0Mohassel, M.\u00a0Rosulek. FleXOR: flexible garbling for XOR gates that beats free-XOR, in CRYPTO 2014. LNCS, vol. 8617 (Springer, Berlin, 2014), pp. 440\u2013457","DOI":"10.1007\/978-3-662-44381-1_25"},{"key":"9271_CR15","doi-asserted-by":"crossref","unstructured":"V.\u00a0Kolesnikov, T.\u00a0Schneider, Improved garbled circuit: free XOR gates and applications, in the 35th ICALP. LNCS, vol. 5126 (Springer, Berlin, 2008), pp. 486\u2013498","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"9271_CR16","unstructured":"V.\u00a0Kolesnikov, T.\u00a0Schneider, Secure function evaluation techniques for circuits containing XOR gates with applications to universal circuits. Patent No.\u00a0US 8,443,205 B2 (2013)"},{"key":"9271_CR17","unstructured":"B.\u00a0Kreuter, A.\u00a0Shelat, C.\u00a0Shen, Billion-gate secure computation with malicious adversaries, in the 21st USENIX Security Symposium (2012)"},{"issue":"2","key":"9271_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y Lindell","year":"2009","unstructured":"Y. Lindell, B. Pinkas, A proof of Yao\u2019s protocol for secure two-party computation. J. Cryptol.\n                    22(2), 161\u2013188 (2009)","journal-title":"J. Cryptol."},{"key":"9271_CR19","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Lindell, B.\u00a0Pinkas, N.\u00a0Smart. Implementing two-party computation efficiently with security against malicious adversaries, in the 6th Conference on Security and Cryptography for Networks. LNCS, vol. 5229 (Springer, Berlin, 2008), pp. 2\u201320","DOI":"10.1007\/978-3-540-85855-3_2"},{"key":"9271_CR20","unstructured":"M.\u00a0Naor, B.\u00a0Pinkas, R.\u00a0Sumner. Privacy preserving auctions and mechanism design, in the ACM Conference on Electronic Commerce. (1999), pp. 129\u2013139"},{"key":"9271_CR21","doi-asserted-by":"crossref","unstructured":"B.\u00a0Pinkas, T.\u00a0Schneider, N.P.\u00a0Smart, S.C.\u00a0Williams. Secure two-party computation is practical, in ASIACRYPT 2009. LNCS, vol. 5912 (Springer, Berlin 2009), pp. 250\u2013267","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"9271_CR22","doi-asserted-by":"crossref","unstructured":"A.\u00a0Yao. How to generate and exchange secrets, in the 27th FOCS, 1986. pp. 162\u2013167","DOI":"10.1109\/SFCS.1986.25"},{"key":"9271_CR23","doi-asserted-by":"crossref","unstructured":"S.\u00a0Zahur, M.\u00a0Rosulek, D.\u00a0Evans. Two halves make a whole\u2014reducing data transfer in garbled circuits using half gates, in EUROCRYPT 2015. LNCS, vol. 9057 (Springer, Berlin, 2015), pp. 220\u2013250","DOI":"10.1007\/978-3-662-46803-6_8"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-017-9271-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-017-9271-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-017-9271-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:08:35Z","timestamp":1586333315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-017-9271-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,11]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["9271"],"URL":"https:\/\/doi.org\/10.1007\/s00145-017-9271-y","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,11]]},"assertion":[{"value":"5 September 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}