{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T02:23:15Z","timestamp":1768443795100,"version":"3.49.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018830","type":"print"},{"value":"9783032018847","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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-3-032-01884-7_14","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T09:31:14Z","timestamp":1755336674000},"page":"426-458","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Silent Circuit Relinearisation: Sublinear-Size (Boolean and\u00a0Arithmetic) Garbled Circuits from\u00a0DCR"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2128-5204","authenticated-orcid":false,"given":"Pierre","family":"Meyer","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4992-0249","authenticated-orcid":false,"given":"Claudio","family":"Orlandi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8436-0029","authenticated-orcid":false,"given":"Lawrence","family":"Roy","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7937-8422","authenticated-orcid":false,"given":"Peter","family":"Scholl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: How to garble arithmetic circuits. In: Ostrovsky, R. (ed.) 52nd FOCS, pp. 120\u2013129. IEEE Computer Society Press (2011)","DOI":"10.1109\/FOCS.2011.40"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","volume":"38","author":"DA Barrington","year":"1989","unstructured":"Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. J. Comput. Syst. Sci. 38(1), 150\u2013164 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-642-55220-5_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"D Boneh","year":"2014","unstructured":"Boneh, D., et al.: Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 533\u2013556. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_30"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-662-53018-4_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"E Boyle","year":"2016","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Breaking the circuit size barrier for secure computation under DDH. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, Part I. LNCS, vol. 9814, pp. 509\u2013539. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_19"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Ball, M., Li, H., Lin, H., Liu, T.: New ways to garble arithmetic circuits. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part II. LNCS, vol. 14005, pp. 3\u201334. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_1","DOI":"10.1007\/978-3-031-30617-4_1"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Charbit, P., Couteau, G., Meyer, P., Naserasr, R.: A note on low-communication secure multiparty computation via circuit depth-reduction. In: Boyle, E., Mahmoody, M. (eds.) TCC 2024, Part IV. LNCS, vol. 15367, pp. 167\u2013199. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-78023-3_6","DOI":"10.1007\/978-3-031-78023-3_6"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Towards optimal simulations of formulas by bounded-width programs. In: 22nd ACM STOC, pp. 271\u2013277. ACM Press (1990)","DOI":"10.1145\/100216.100251"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Couteau, G., Meyer, P., Passel\u00e8gue, A., Riahinia, M.: Constrained pseudorandom functions from homomorphic secret sharing. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part III. LNCS, vol. 14006, pp. 194\u2013224. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_7","DOI":"10.1007\/978-3-031-30620-4_7"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-030-17656-3_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"G Couteau","year":"2019","unstructured":"Couteau, G.: A note on the communication complexity of multiparty computation in the correlated randomness model. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part II. LNCS, vol. 11477, pp. 473\u2013503. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_17"},{"key":"14_CR10","unstructured":"Dittmer, S., Ishai, Y., Ostrovsky, R.: Line-point zero knowledge and its applications. In: 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.: A generalisation, a simplification and some applications of Paillier\u2019s probabilistic public-key system. In: Kim, K. (ed.) PKC 2001. LNCS, vol. 1992, pp. 119\u2013136. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44586-2_9"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-662-46803-6_7","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"TK Frederiksen","year":"2015","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.) EUROCRYPT 2015, Part II. LNCS, vol. 9057, pp. 191\u2013219. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_7"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y., Popa, R.A., Vaikuntanathan, V., Zeldovich, N.: Reusable garbled circuits and succinct functional encryption. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th ACM STOC, pp. 555\u2013564. ACM Press (2013)","DOI":"10.1145\/2488608.2488678"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/978-3-030-56880-1_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Heath","year":"2020","unstructured":"Heath, D., Kolesnikov, V.: Stacked garbling - garbled circuit proportional to longest execution path. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 763\u2013792. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_27"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Heath, D., Kolesnikov, V.: One hot garbling. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 574\u2013593. ACM Press (2021)","DOI":"10.1145\/3460120.3484764"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-77883-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"D Heath","year":"2021","unstructured":"Heath, D., Kolesnikov, V.: LogStack: stacked garbling with\u00a0$$O(b \\log b)$$ computation. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part III. LNCS, vol. 12698, pp. 3\u201332. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_1"},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"Heath, D., Kolesnikov, V., Ng, L.K.L.: Garbled circuit lookup tables with logarithmic number of ciphertexts. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part V. LNCS, vol. 14655, pp. 185\u2013215. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58740-5_7","DOI":"10.1007\/978-3-031-58740-5_7"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Hsieh, Y.-C., Lin, H., Luo, J.: Attribute-based encryption for circuits of unbounded depth from lattices. In: 64th FOCS, pp. 415\u2013434. IEEE Computer Society Press (2023)","DOI":"10.1109\/FOCS57990.2023.00031"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/978-3-642-30057-8_37","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"B Hemenway","year":"2012","unstructured":"Hemenway, B., Ostrovsky, R.: Extended-DDH and lossy trapdoor functions. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 627\u2013643. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30057-8_37"},{"key":"14_CR20","unstructured":"Ishai, Y., Li, H., Lin, H.: Succinct partial garbling from groups and applications. Cryptology ePrint Archive, Paper 2024\/2073 (2024)"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Li, H., Lin, H.: A unified framework for succinct garbling from homomorphic secret sharing. Cryptology ePrint Archive, Paper 2025\/442 (2025)","DOI":"10.1007\/978-3-032-01884-7_13"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1007\/978-3-662-43948-7_54","volume-title":"Automata, Languages, and Programming","author":"Y Ishai","year":"2014","unstructured":"Ishai, Y., Wee, H.: Partial garbling schemes and their applications. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part I. LNCS, vol. 8572, pp. 650\u2013662. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_54"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Liu, H., Wang, X., Yang, K., Yu, Y.: Garbled circuits with 1 bit per gate. Cryptology ePrint Archive, Paper 2024\/1988 (2024)","DOI":"10.1007\/978-3-031-91098-2_16"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Meyer, P., Orlandi, C., Roy, L., Scholl, P.: Rate-1 arithmetic garbling from homomorphic secret sharing. In: Boyle, E., Mahmoody, M. (eds.) TCC 2024, Part IV. LNCS, vol. 15367, pp. 71\u201397. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-78023-3_3","DOI":"10.1007\/978-3-031-78023-3_3"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1007\/978-3-030-77870-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"C Orlandi","year":"2021","unstructured":"Orlandi, C., Scholl, P., Yakoubov, S.: The rise of paillier: homomorphic secret sharing and public-key silent OT. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part I. LNCS, vol. 12696, pp. 678\u2013708. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_24"},{"key":"14_CR26","doi-asserted-by":"publisher","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-x_16","DOI":"10.1007\/3-540-48910-x_16"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Quach, W., Wee, H., Wichs, D.: Laconic function evaluation and applications. In: Thorup, M. (ed.) 59th FOCS, pp. 859\u2013870. IEEE Computer Society Press (2018)","DOI":"10.1109\/FOCS.2018.00086"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-030-84242-0_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"M Rosulek","year":"2021","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.) CRYPTO 2021, Part I. LNCS, vol. 12825, pp. 94\u2013124. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_5"},{"key":"14_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/978-3-030-84252-9_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"L Roy","year":"2021","unstructured":"Roy, L., Singh, J.: Large message homomorphic secret sharing from DCR and applications. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part III. LNCS, vol. 12827, pp. 687\u2013717. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_23"},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Protocols for secure computations (extended abstract). In: 23rd FOCS, pp. 160\u2013164. IEEE Computer Society Press (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"14_CR31","doi-asserted-by":"crossref","unstructured":"Yang, K., Sarkar, P., Weng, C., Wang, X.: QuickSilver: efficient and affordable zero-knowledge proofs for circuits and polynomials over any field. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 2986\u20133001. ACM Press (2021)","DOI":"10.1145\/3460120.3484556"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01884-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T14:59:06Z","timestamp":1757429946000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01884-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018830","9783032018847"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01884-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}