{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,16]],"date-time":"2026-11-16T18:30:45Z","timestamp":1794853845260,"version":"4.9.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032362636","type":"print"},{"value":"9783032362643","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T00:00:00Z","timestamp":1790467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T00:00:00Z","timestamp":1790467200000},"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":[[2027]]},"DOI":"10.1007\/978-3-032-36264-3_2","type":"book-chapter","created":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T20:30:24Z","timestamp":1790454624000},"page":"23-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Oblivious Garbling and\u00a0Its Applications"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6091-4857","authenticated-orcid":false,"given":"Tomer","family":"Ashur","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8951-5099","authenticated-orcid":false,"given":"Carmit","family":"Hazay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0497-7172","authenticated-orcid":false,"given":"Rahul","family":"Satish","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,9,27]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Acharya, A., Hazay, C., Kolesnikov, V., Prabhakaran, M.: SCALES - MPC with small clients and larger ephemeral servers. In: TCC, pp. 502\u2013531 (2022). https:\/\/doi.org\/10.1007\/978-3-031-22365-5_18","DOI":"10.1007\/978-3-031-22365-5_18"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Acharya, A., Hazay, C., Kolesnikov, V., Prabhakaran, M.: Malicious security for SCALES - outsourced computation with ephemeral servers. In: CRYPTO, pp. 3\u201338 (2024). https:\/\/doi.org\/10.1007\/978-3-031-68400-5_1","DOI":"10.1007\/978-3-031-68400-5_1"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Acharya, A., Hazay, C., Kolesnikov, V., Prabhakaran, M.: Towards building efficient SCALES protocols. In: ASIACRYPT, pp. 35\u201367 (2025). https:\/\/doi.org\/10.1007\/978-981-95-5116-3_2","DOI":"10.1007\/978-981-95-5116-3_2"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: From secrecy to soundness: efficient verification via secure computation. In: ICALP, pp. 152\u2013163 (2010). https:\/\/doi.org\/10.1007\/978-3-642-14165-2_14","DOI":"10.1007\/978-3-642-14165-2_14"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Adaptively secure garbling with applications to one-time programs and secure outsourcing. In: ASIACRYPT, pp. 134\u2013153 (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_10","DOI":"10.1007\/978-3-642-34961-4_10"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: ACM CCS, pp. 784\u2013796 (2012). https:\/\/doi.org\/10.1145\/2382196.2382279","DOI":"10.1145\/2382196.2382279"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: silent OT extension and more. In: CRYPTO, pp. 489\u2013518 (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Choi, S.G., Katz, J., Kumaresan, R., Cid, C.: Multi-client non-interactive verifiable computation. In: TCC, pp. 499\u2013518 (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_28","DOI":"10.1007\/978-3-642-36594-2_28"},{"key":"2_CR9","doi-asserted-by":"publisher","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: EUROCRYPT, pp. 537\u2013556 (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_32","DOI":"10.1007\/978-3-642-38348-9_32"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: CRYPTO, pp. 465\u2013482 (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_25","DOI":"10.1007\/978-3-642-14623-7_25"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: One-time programs. In: CRYPTO, pp. 39\u201356 (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_3","DOI":"10.1007\/978-3-540-85174-5_3"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wee, H.: Functional encryption with bounded collusions via multi-party computation. In: CRYPTO, pp. 162\u2013179 (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_11","DOI":"10.1007\/978-3-642-32009-5_11"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Goyal, V., Ishai, Y., Sahai, A., Venkatesan, R., Wadia, A.: Founding cryptography on tamper-proof hardware tokens. In: TCC, pp. 308\u2013326 (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_19","DOI":"10.1007\/978-3-642-11799-2_19"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: CRYPTO, pp. 145\u2013161 (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"2_CR15","unstructured":"Kamara, S., Mohassel, P., Raykova, M.: Outsourcing multi-party computation. IACR Cryptol. ePrint Arch. p.\u00a0272 (2011). http:\/\/eprint.iacr.org\/2011\/272"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Katz, J., Ranellucci, S., Rosulek, M., Wang, X.: Optimizing authenticated garbling for faster secure two-party computation. In: CRYPTO, pp. 365\u2013391 (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_13","DOI":"10.1007\/978-3-319-96878-0_13"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Kiss, \u00c1., Schneider, T.: Valiant\u2019s universal circuit is practical. In: EUROCRYPT, pp. 699\u2013728 (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_27","DOI":"10.1007\/978-3-662-49890-3_27"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Kolesnikov, V., Schneider, T.: Improved garbled circuit: free XOR gates and applications. In: ICALP, pp. 486\u2013498 (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_40","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Kolesnikov, V., Schneider, T.: A practical universal circuit construction and secure evaluation of private functions. In: Tsudik, G. (ed.) FC, pp. 83\u201397 (2008). https:\/\/doi.org\/10.1007\/978-3-540-85230-8_7","DOI":"10.1007\/978-3-540-85230-8_7"},{"key":"2_CR20","unstructured":"Lipmaa, H., Mohassel, P., Sadeghian, S.S.: Valiant\u2019s universal circuit: improvements, implementation, and applications. IACR Cryptol. ePrint Arch. p.\u00a017 (2016). http:\/\/eprint.iacr.org\/2016\/017"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Liu, H., Yu, Y., Zhao, S., Zhang, J., Liu, W., Hu, Z.: Pushing the limits of valiant\u2019s universal circuits: simpler, tighter and more compact. In: CRYPTO, pp. 365\u2013394 (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_13","DOI":"10.1007\/978-3-030-84245-1_13"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Mohassel, P., Sadeghian, S.S.: How to hide circuits in MPC an efficient framework for private function evaluation. In: EUROCRYPT. vol.\u00a07881, pp. 557\u2013574 (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_33","DOI":"10.1007\/978-3-642-38348-9_33"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design, pp. 129\u2013139. ACM-EC (1999). https:\/\/doi.org\/10.1145\/336992.337028","DOI":"10.1145\/336992.337028"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Nielsen, J.B., Orlandi, C.: LEGO for two-party secure computation. In: TCC, pp. 368\u2013386 (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_22","DOI":"10.1007\/978-3-642-00457-5_22"},{"key":"2_CR25","doi-asserted-by":"publisher","unstructured":"Paus, A., Sadeghi, A., Schneider, T.: Practical secure evaluation of semi-private functions. In: ACNS, pp. 89\u2013106 (2009). https:\/\/doi.org\/10.1007\/978-3-642-01957-9_6","DOI":"10.1007\/978-3-642-01957-9_6"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Rosulek, M., Roy, L.: Three halves make a whole? beating the half-gates lower bound for garbled circuits. In: CRYPTO, pp. 94\u2013124 (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_5","DOI":"10.1007\/978-3-030-84242-0_5"},{"key":"2_CR27","doi-asserted-by":"publisher","unstructured":"Roy, L.: Softspokenot: quieter OT extension from small-field silent VOLE in the minicrypt model. In: CRYPTO, pp. 657\u2013687 (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_23","DOI":"10.1007\/978-3-031-15802-5_23"},{"key":"2_CR28","doi-asserted-by":"publisher","unstructured":"Sahai, A., Seyalioglu, H.: Worry-free encryption: functional encryption with public keys. In: ACM CCS, pp. 463\u2013472 (2010). https:\/\/doi.org\/10.1145\/1866307.1866359","DOI":"10.1145\/1866307.1866359"},{"key":"2_CR29","doi-asserted-by":"publisher","unstructured":"Valiant, L.G.: Universal circuits (preliminary report). In: ACM STOC, pp. 196\u2013203 (1976). https:\/\/doi.org\/10.1145\/800113.803649","DOI":"10.1145\/800113.803649"},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Wang, X., Ranellucci, S., Katz, J.: Authenticated garbling and efficient maliciously secure two-party computation. In: CCS, pp. 21\u201337 (2017). https:\/\/doi.org\/10.1145\/3133956.3134053","DOI":"10.1145\/3133956.3134053"},{"key":"2_CR31","unstructured":"Wang, Y., Malluhi, Q.M.: Reducing garbled circuit size while preserving circuit gate privacy. Cryptology ePrint Archive, Paper 2017\/041 (2017). http:\/\/eprint.iacr.org\/2017\/041"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Wegener, I.: The complexity of Boolean functions. Wiley-Teubner (1987). http:\/\/ls2-www.cs.uni-dortmund.de\/monographs\/bluebook\/","DOI":"10.1007\/3-540-18170-9_185"},{"key":"2_CR33","doi-asserted-by":"publisher","unstructured":"Yang, K., Weng, C., Lan, X., Zhang, J., Wang, X.: Ferret: fast extension for correlated OT with small communication. In: CCS, pp. 1607\u20131626 (2020). https:\/\/doi.org\/10.1145\/3372297.3417276","DOI":"10.1145\/3372297.3417276"},{"key":"2_CR34","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: How to generate and exchange secrets (extended abstract). In: FoCS, pp. 162\u2013167 (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"},{"key":"2_CR35","doi-asserted-by":"publisher","unstructured":"Zahur, S., Rosulek, M., Evans, D.: Two halves make a whole - reducing data transfer in garbled circuits using half gates. In: EUROCRYPT, pp. 220\u2013250 (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_8","DOI":"10.1007\/978-3-662-46803-6_8"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-36264-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T20:30:30Z","timestamp":1790454630000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-36264-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9,27]]},"ISBN":["9783032362636","9783032362643"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-36264-3_2","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-032-36264-3","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,9,27]]},"assertion":[{"value":"27 September 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SCN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Cryptography for Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amalfi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"scn2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/scn.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}