{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T03:22:46Z","timestamp":1764645766266,"version":"3.41.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T00:00:00Z","timestamp":1738972800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T00:00:00Z","timestamp":1738972800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s10623-025-01577-0","type":"journal-article","created":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T16:28:54Z","timestamp":1739032134000},"page":"2073-2105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Can we beat three halves lower bound? (Im)possibility of reducing communication cost for garbled circuits"],"prefix":"10.1007","volume":"93","author":[{"given":"Chunghun","family":"Baek","sequence":"first","affiliation":[]},{"given":"Taechan","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,8]]},"reference":[{"key":"1577_CR1","unstructured":"Ashur T., Hazay C., Satish R.: On the feasibility of sliced garbling. IACR Cryptol ePrint Arch., Paper 2024\/389, p. 389 (2024)."},{"key":"1577_CR2","doi-asserted-by":"publisher","unstructured":"Ball M., Malkin T., Rosulek M.: Garbling gadgets for Boolean and arithmetic circuits. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, 24\u201328 October 2016, pp. 565\u2013577. ACM, New York (2016). https:\/\/doi.org\/10.1145\/2976749.2978410.","DOI":"10.1145\/2976749.2978410"},{"key":"1577_CR3","doi-asserted-by":"publisher","unstructured":"Beaver D., Micali S., Rogaway P.: The round complexity of secure protocols (extended abstract). In: Ortiz, H. (ed.) Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 13\u201317 May 1990, Baltimore, Maryland, USA, pp. 503\u2013513. ACM, New York (1990). https:\/\/doi.org\/10.1145\/100216.100287.","DOI":"10.1145\/100216.100287"},{"key":"1577_CR4","doi-asserted-by":"publisher","unstructured":"Bellare M., Hoang V.T., Rogaway P.: Foundations of garbled circuits. In: Yu, T., Danezis, G., Gligor, V.D. (eds.) The ACM Conference on Computer and Communications Security, CCS\u201912, Raleigh, NC, USA, 16\u201318 October 2012, pp. 784\u2013796. ACM (2012). https:\/\/doi.org\/10.1145\/2382196.2382279.","DOI":"10.1145\/2382196.2382279"},{"key":"1577_CR5","unstructured":"Fan L., Lu Z., Zhou H.: Column-wise garbling, and how to go beyond the linear model. IACR Cryptol ePrint Arch., p. 415 (2024)."},{"key":"1577_CR6","doi-asserted-by":"publisher","unstructured":"Frederiksen T.K., Nielsen J.B., Orlandi C.: Privacy-free garbled circuits with applications to efficient zero-knowledge. In: Oswald, E., Fischlin, M. (eds.) Advances in Cryptology\u2014EUROCRYPT 2015\u201434th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, 26\u201330 April 2015, Proceedings, Part II. Lecture Notes in Computer Science, vol. 9057, pp. 191\u2013219. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_7.","DOI":"10.1007\/978-3-662-46803-6_7"},{"key":"1577_CR7","doi-asserted-by":"publisher","unstructured":"Gueron S., Lindell Y., Nof A., Pinkas B.: Fast garbling of circuits under standard assumptions. In: Ray, I., Li, N., Kruegel, C. (eds.) Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, 12\u201316 October 2015, pp. 567\u2013578. ACM, New York (2015). https:\/\/doi.org\/10.1145\/2810103.2813619.","DOI":"10.1145\/2810103.2813619"},{"key":"1577_CR8","doi-asserted-by":"publisher","unstructured":"Impagliazzo R.: A personal view of average-case complexity. In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, 19\u201322 June 1995, pp. 134\u2013147. IEEE Computer Society (1995). https:\/\/doi.org\/10.1109\/SCT.1995.514853.","DOI":"10.1109\/SCT.1995.514853"},{"key":"1577_CR9","doi-asserted-by":"publisher","unstructured":"Kempka C., Kikuchi R., Suzuki K.: How to circumvent the two-ciphertext lower bound for linear garbling schemes. In: Cheon, J.H., Takagi, T. (eds.) Advances in Cryptology\u2014ASIACRYPT 2016\u201422nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, 4\u20138 December 2016, Proceedings, Part II. Lecture Notes in Computer Science, vol. 1003, pp. 967\u2013997 (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_32.","DOI":"10.1007\/978-3-662-53890-6_32"},{"key":"1577_CR10","doi-asserted-by":"crossref","unstructured":"Kim T.: Analysis on sliced garbling via algebraic approach. IACR Cryptol ePrint Arch., p. 804 (2024).","DOI":"10.1007\/978-981-96-0944-4_8"},{"key":"1577_CR11","doi-asserted-by":"publisher","unstructured":"Kolesnikov V., Mohassel P., Rosulek M.: FleXOR: flexible garbling for XOR gates that beats free-XOR. In: Garay, J.A., Gennaro, R. (eds.) Advances in Cryptology\u2014CRYPTO 2014\u201434th Annual Cryptology Conference, Santa Barbara, CA, USA, 17\u201321 August 2014, Proceedings, Part II. Lecture Notes in Computer Science, vol. 8617, pp. 440\u2013457. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_25.","DOI":"10.1007\/978-3-662-44381-1_25"},{"key":"1577_CR12","doi-asserted-by":"publisher","unstructured":"Kolesnikov V., Schneider T.: Improved garbled circuit: free XOR gates and applications. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, 7\u201311 July 2008, Proceedings, Part II\u2014Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations. vol. 5126 of Lecture Notes in Computer Science, pp. 486\u2013498. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_40.","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"1577_CR13","unstructured":"Malkin T., Pastro V., abhi shelat: An Algebraic Approach to Garbling. Unpublished manuscript. https:\/\/simons.berkeley.edu\/talks\/tal-malkin-2015-06-10."},{"key":"1577_CR14","doi-asserted-by":"publisher","unstructured":"Naor M., Pinkas B., Sumner R.: Privacy preserving auctions and mechanism design. In: Feldman, S.I., Wellman, M.P. (eds.) Proceedings of the First ACM Conference on Electronic Commerce (EC-99), Denver, CO, USA, 3\u20135 November 1999, pp. 129\u2013139. ACM, New York (1999). https:\/\/doi.org\/10.1145\/336992.337028.","DOI":"10.1145\/336992.337028"},{"key":"1577_CR15","doi-asserted-by":"publisher","unstructured":"Pinkas B., Schneider T., Smart N.P., Williams S.C.: Secure two-party computation is practical. In: Matsui, M. (eds.) Advances in Cryptology\u2014ASIACRYPT 2009, 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, 6\u201310 December 2009. Proceedings. Lecture Notes in Computer Science, vol. 5912, pp. 250\u2013267. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_15.","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"1577_CR16","doi-asserted-by":"publisher","unstructured":"Rosulek M., Roy L.: Three halves make a whole? Beating the half-gates lower bound for garbled circuits. In: Malkin, T., Peikert, C. (eds.) Advances in Cryptology\u2014CRYPTO 2021\u201441st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, 16\u201320 August 2021, Proceedings, Part I. Lecture Notes in Computer Science, vol. 12825, pp. 94\u2013124. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_5.","DOI":"10.1007\/978-3-030-84242-0_5"},{"key":"1577_CR17","doi-asserted-by":"publisher","unstructured":"Yao A.C.: Protocols for secure computations (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, Chicago, IL, USA, 3\u20135 November 1982, pp. 160\u2013164. IEEE Computer Society (1982). https:\/\/doi.org\/10.1109\/SFCS.1982.38.","DOI":"10.1109\/SFCS.1982.38"},{"key":"1577_CR18","doi-asserted-by":"publisher","unstructured":"Zahur S., Rosulek M., Evans D.: Two halves make a whole\u2014reducing data transfer in garbled circuits using half gates. In: Oswald, E., Fischlin, M. (eds.) Advances in Cryptology\u2014EUROCRYPT 2015\u201434th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, 26\u201330 April 2015, Proceedings, Part II. Lecture Notes in Computer Science, vol. 9057, pp. 220\u2013250. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_8.","DOI":"10.1007\/978-3-662-46803-6_8"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01577-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01577-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01577-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:54:46Z","timestamp":1750276486000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01577-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,8]]},"references-count":18,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["1577"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01577-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2025,2,8]]},"assertion":[{"value":"2 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}