{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T03:21:09Z","timestamp":1764645669964,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031334900"},{"type":"electronic","value":"9783031334917"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-33491-7_23","type":"book-chapter","created":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T11:02:45Z","timestamp":1685185365000},"page":"611-641","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A New Approach to\u00a0Garbled Circuits"],"prefix":"10.1007","author":[{"given":"Anasuya","family":"Acharya","sequence":"first","affiliation":[]},{"given":"Tomer","family":"Ashur","sequence":"additional","affiliation":[]},{"given":"Efrat","family":"Cohen","sequence":"additional","affiliation":[]},{"given":"Carmit","family":"Hazay","sequence":"additional","affiliation":[]},{"given":"Avishay","family":"Yanai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,28]]},"reference":[{"key":"23_CR1","unstructured":"Acharya, A., Ashur, T., Cohen, E., Hazay, C., Yanai, A.: A new approach to garbled circuits. Cryptology ePrint Archive, Paper 2021\/739 (2021). https:\/\/eprint.iacr.org\/2021\/739"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Applebaum, B.: Bootstrapping obfuscators via fast pseudorandom functions. IACR Cryptol. ePrint Arch., p. 699 (2013)","DOI":"10.1007\/978-3-662-45608-8_9"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Applebaum, B.: Garbled circuits as randomized encodings of functions: a primer. In: Tutorials on the Foundations of Cryptography, pp. 1\u201344 (2017)","DOI":"10.1007\/978-3-319-57048-8_1"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Hoang, V.T., Keelveedhi, S., Rogaway, P.: Efficient garbling from a fixed-key blockcipher. In IEEE SP, pp. 478\u2013492 (2013)","DOI":"10.1109\/SP.2013.39"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: ACM CCS, pp. 784\u2013796 (2012)","DOI":"10.1145\/2382196.2382279"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Efraim, A., Lindell, Y., Omri. E.: Optimizing semi-honest secure multiparty computation for the internet. In: ACM SIGSAC, pp. 578\u2013590 (2016)","DOI":"10.1145\/2976749.2978347"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: ACM, pp. 503\u2013513 (1990)","DOI":"10.1145\/100216.100287"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Frederiksen, T.K., Nielsen, J.B., Orlandi, C.: Privacy-free garbled circuits with applications to efficient zero-knowledge. In: EUROCRYPT, pp. 191\u2013219 (2015)","DOI":"10.1007\/978-3-662-46803-6_7"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: CRYPTO, pp. 465\u2013482 (2010)","DOI":"10.1007\/978-3-642-14623-7_25"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Popa, R.A., Vaikuntanathan, V., Zeldovich, N.: Reusable garbled circuits and succinct functional encryption. In: STOC, pp. 555\u2013564. ACM (2013)","DOI":"10.1145\/2488608.2488678"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Ganesh, C., Kondi, Y., Patra, A., Sarkar, P.: Efficient adaptively secure zero-knowledge from garbled circuits. In: PKC, pp. 499\u2013529 (2018)","DOI":"10.1007\/978-3-319-76581-5_17"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Heath, D., Kolesnikov, V.: Stacked garbling - garbled circuit proportional to longest execution path. In: CRYPTO, pp. 763\u2013792 (2020)","DOI":"10.1007\/978-3-030-56880-1_27"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: a new representation with applications to round-efficient secure computation. In: FOCS, pp. 294\u2013304 (2000)","DOI":"10.1109\/SFCS.2000.892118"},{"key":"23_CR14","unstructured":"Ishai, Y.: Randomization techniques for secure computation. In: Secure Multi-Party Computation, volume 10 of Cryptology and Information Security Series, pp. 222\u2013248 (2013)"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Kempka, C., Kikuchi, R., Suzuki, K.: How to circumvent the two-ciphertext lower bound for linear garbling schemes. In: ASIACRYPT, pp. 967\u2013997 (2016)","DOI":"10.1007\/978-3-662-53890-6_32"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography, Second Edition (2014)","DOI":"10.1201\/b17668"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Mohassel, P., Rosulek, M.: Flexor: flexible garbling for XOR gates that beats free-xor. In: CRYPTO, pp. 440\u2013457 (2014)","DOI":"10.1007\/978-3-662-44381-1_25"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Schneider, T.: Improved garbled circuit: free XOR gates and applications. In: ICALP, pp. 486\u2013498 (2008)","DOI":"10.1007\/978-3-540-70583-3_40"},{"issue":"2","key":"23_CR19","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y Lindell","year":"2009","unstructured":"Lindell, Y., Pinkas, B.: A proof of security of Yao\u2019s protocol for two-party computation. J. Cryptol. 22(2), 161\u2013188 (2009)","journal-title":"J. Cryptol."},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: ACM-EC, pp. 129\u2013139 (1999)","DOI":"10.1145\/336992.337028"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Schneider, T., Smart, N.P., Williams, S.C.: Secure two-party computation is practical. In: ASIACRYPT, pp. 250\u2013267 (2009)","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"23_CR22","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-030-84242-0_5"},{"key":"23_CR23","unstructured":"Chi-Chih Yao, A.: How to generate and exchange secrets (extended abstract). In: FoCS, pp. 162\u2013167 (1986)"},{"key":"23_CR24","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-662-46803-6_8"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33491-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T06:35:21Z","timestamp":1729492521000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33491-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031334900","9783031334917"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33491-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kyoto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sulab-sever.u-aizu.ac.jp\/ACNS2023\/committees.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"263","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the workshops 34 full papers have been accepted from a total of 73 submissions; 13 poster papers are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}