{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T03:22:51Z","timestamp":1764645771641,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819609437"},{"type":"electronic","value":"9789819609444"}],"license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-0944-4_8","type":"book-chapter","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T05:55:12Z","timestamp":1733896512000},"page":"237-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Analysis on Sliced Garbling via Algebraic Approach"],"prefix":"10.1007","author":[{"given":"Taechan","family":"Kim","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"8_CR1","unstructured":"T.\u00a0Ashur, C.\u00a0Hazay, and R.\u00a0Satish. On the feasibility of sliced garbling. Cryptology ePrint Archive, Paper 2024\/389, 2024. https:\/\/eprint.iacr.org\/2024\/389."},{"key":"8_CR2","unstructured":"C.\u00a0Baek and T.\u00a0Kim. Can we beat three halves lower bound?: (im)possibility of reducing communication cost for garbled circuits. Cryptology ePrint Archive, Paper 2024\/803, 2024. https:\/\/eprint.iacr.org\/2024\/803."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"M.\u00a0Ball, H.\u00a0Li, H.\u00a0Lin, and T.\u00a0Liu. New ways to garble arithmetic circuits. In C.\u00a0Hazay and M.\u00a0Stam, editors, Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part II, volume 14005 of Lecture Notes in Computer Science, pages 3\u201334. Springer, 2023.","DOI":"10.1007\/978-3-031-30617-4_1"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"D.\u00a0Beaver, S.\u00a0Micali, and P.\u00a0Rogaway. The round complexity of secure protocols (extended abstract). In H.\u00a0Ortiz, editor, Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, May 13-17, 1990, Baltimore, Maryland, USA, pages 503\u2013513. ACM, 1990.","DOI":"10.1145\/100216.100287"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"M.\u00a0Bellare, V.\u00a0T. Hoang, and P.\u00a0Rogaway. Foundations of garbled circuits. In T.\u00a0Yu, G.\u00a0Danezis, and V.\u00a0D. Gligor, editors, the ACM Conference on Computer and Communications Security, CCS\u201912, Raleigh, NC, USA, October 16-18, 2012, pages 784\u2013796. ACM, 2012.","DOI":"10.1145\/2382196.2382279"},{"key":"8_CR6","unstructured":"L.\u00a0Fan, Z.\u00a0Lu, and H.\u00a0Zhou. Column-wise garbling, and how to go beyond the linear model. IACR Cryptol. ePrint Arch., page 415, 2024."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"S.\u00a0Gueron, Y.\u00a0Lindell, A.\u00a0Nof, and B.\u00a0Pinkas. Fast garbling of circuits under standard assumptions. In I.\u00a0Ray, N.\u00a0Li, and C.\u00a0Kruegel, editors, Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-16, 2015, pages 567\u2013578. ACM, 2015.","DOI":"10.1145\/2810103.2813619"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"D.\u00a0Heath and V.\u00a0Kolesnikov. One hot garbling. In Y.\u00a0Kim, J.\u00a0Kim, G.\u00a0Vigna, and E.\u00a0Shi, editors, CCS \u201921: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15 - 19, 2021, pages 574\u2013593. ACM, 2021.","DOI":"10.1145\/3460120.3484764"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"D.\u00a0Heath, V.\u00a0Kolesnikov, and L.\u00a0K.\u00a0L. Ng. Garbled circuit lookup tables with logarithmic number of ciphertexts. In M.\u00a0Joye and G.\u00a0Leander, editors, Advances in Cryptology - EUROCRYPT 2024 - 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zurich, Switzerland, May 26-30, 2024, Proceedings, Part V, volume 14655 of Lecture Notes in Computer Science, pages 185\u2013215. Springer, 2024.","DOI":"10.1007\/978-3-031-58740-5_7"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"C.\u00a0Kempka, R.\u00a0Kikuchi, and K.\u00a0Suzuki. How to circumvent the two-ciphertext lower bound for linear garbling schemes. In J.\u00a0H. Cheon and T.\u00a0Takagi, editors, Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II, volume 10032 of Lecture Notes in Computer Science, pages 967\u2013997, 2016.","DOI":"10.1007\/978-3-662-53890-6_32"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"V.\u00a0Kolesnikov, P.\u00a0Mohassel, and M.\u00a0Rosulek. Flexor: Flexible garbling for XOR gates that beats free-xor. In J.\u00a0A. Garay and R.\u00a0Gennaro, editors, Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part II, volume 8617 of Lecture Notes in Computer Science, pages 440\u2013457. Springer, 2014.","DOI":"10.1007\/978-3-662-44381-1_25"},{"key":"8_CR12","unstructured":"V.\u00a0Kolesnikov and T.\u00a0Schneider. Improved garbled circuit: Free XOR gates and applications. In L.\u00a0Aceto, I.\u00a0Damg\u00e5rd, L.\u00a0A. Goldberg, M.\u00a0M. Halld\u00f3rsson, A.\u00a0Ing\u00f3lfsd\u00f3ttir, and I.\u00a0Walukiewicz, editors, Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations, volume 5126 of Lecture Notes in Computer Science, pages 486\u2013498. Springer, 2008."},{"key":"8_CR13","unstructured":"M.\u00a0Naor, B.\u00a0Pinkas, and R.\u00a0Sumner. Privacy preserving auctions and mechanism design. In S.\u00a0I. Feldman and M.\u00a0P. Wellman, editors, Proceedings of the First ACM Conference on Electronic Commerce (EC-99), Denver, CO, USA, November 3-5, 1999, pages 129\u2013139. ACM, 1999."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"B.\u00a0Pinkas, T.\u00a0Schneider, N.\u00a0P. Smart, and S.\u00a0C. Williams. Secure two-party computation is practical. In M.\u00a0Matsui, editor, Advances in Cryptology - ASIACRYPT 2009, 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, December 6-10, 2009. Proceedings, volume 5912 of Lecture Notes in Computer Science, pages 250\u2013267. Springer, 2009.","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"M.\u00a0Rosulek and L.\u00a0Roy. Three halves make a whole? beating the half-gates lower bound for garbled circuits. In T.\u00a0Malkin and C.\u00a0Peikert, editors, Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part I, volume 12825 of Lecture Notes in Computer Science, pages 94\u2013124. Springer, 2021.","DOI":"10.1007\/978-3-030-84242-0_5"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"A.\u00a0C. Yao. Protocols for secure computations (extended abstract). In 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3-5 November 1982, pages 160\u2013164. IEEE Computer Society, 1982.","DOI":"10.1109\/SFCS.1982.38"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"S.\u00a0Zahur, M.\u00a0Rosulek, and D.\u00a0Evans. Two halves make a whole - reducing data transfer in garbled circuits using half gates. In E.\u00a0Oswald and M.\u00a0Fischlin, editors, Advances in Cryptology - EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part II, volume 9057 of Lecture Notes in Computer Science, pages 220\u2013250. Springer, 2015.","DOI":"10.1007\/978-3-662-46803-6_8"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0944-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T06:12:14Z","timestamp":1733897534000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0944-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"ISBN":["9789819609437","9789819609444"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0944-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,12]]},"assertion":[{"value":"12 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}