{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T05:10:01Z","timestamp":1745730601865,"version":"3.40.4"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031911330","type":"print"},{"value":"9783031911347","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-031-91134-7_14","type":"book-chapter","created":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T04:39:46Z","timestamp":1745728786000},"page":"396-426","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Low-Bandwidth Mixed Arithmetic in\u00a0VOLE-Based ZK from\u00a0Low-Degree PRGs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7642-1341","authenticated-orcid":false,"given":"Amit","family":"Agarwal","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7905-0198","authenticated-orcid":false,"given":"Carsten","family":"Baum","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9164-305X","authenticated-orcid":false,"given":"Lennart","family":"Braun","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,4,27]]},"reference":[{"key":"14_CR1","unstructured":"Alekhnovich, M.: More on average case vs approximation complexity. In: 44th FOCS, October 2003"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Aly, A., Orsini, E., Rotaru, D., Smart, N.P., Wood, T.: Zaphod: efficiently combining LSSS and garbled circuits in scale. In: Proceedings of the 7th ACM Workshop on Encrypted Computing & Applied Homomorphic Cryptography, pp. 33\u201344 (2019)","DOI":"10.1145\/3338469.3358943"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-662-53641-4_2","volume-title":"Theory of Cryptography","author":"B Applebaum","year":"2016","unstructured":"Applebaum, B., Raykov, P.: Fast pseudorandom functions based on expander graphs. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9985, pp. 27\u201356. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_2"},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"Baum, C., et al.: One tree to rule them all: optimizing GGM trees and OWFs for post-quantum signatures. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT 2024, Part\u00a0I. LNCS, vol. 15484, pp. 463\u2013493. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0875-1_15","DOI":"10.1007\/978-981-96-0875-1_15"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Baum, C., et al.: Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part\u00a0V. LNCS, vol. 14085, pp. 581\u2013615. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_19","DOI":"10.1007\/978-3-031-38554-4_19"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Baum, C., Braun, L., Munch-Hansen, A., Razet, B., Scholl, P.: Appenzeller to brie: efficient zero-knowledge proofs for mixed-mode arithmetic and Z2k. In: ACM CCS 2021, November 2021","DOI":"10.1145\/3460120.3484812"},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Baum, C., Braun, L., Munch-Hansen, A., Scholl, P.: Moz$$\\mathbb{Z}_{2^k}$$ arella: efficient vector-OLE and zero-knowledge proofs over $$\\mathbb{Z}_{2^k}$$. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part\u00a0IV. LNCS, vol. 13510, pp. 329\u2013358. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_12","DOI":"10.1007\/978-3-031-15985-5_12"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Baum, C., Dittmer, S., Scholl, P., Wang, X.: Sok: vector OLE-based zero-knowledge protocols. DCC (11) (2023)","DOI":"10.1007\/s10623-023-01292-8"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-030-84259-8_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"C Baum","year":"2021","unstructured":"Baum, C., Malozemoff, A.J., Rosen, M.B., Scholl, P.: $$\\sf Mac^{\\prime }n^{\\prime }Cheese$$: zero-knowledge proofs for\u00a0Boolean and arithmetic circuits with\u00a0nested disjunctions. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 92\u2013122. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_4"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-48329-2_24","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"A Blum","year":"1994","unstructured":"Blum, A., Furst, M., Kearns, M., Lipton, R.J.: Cryptographic primitives based on hard learning problems. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 278\u2013291. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_24"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: ACM CCS 2018, October 2018","DOI":"10.1145\/3243734.3243868"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Boyle, E., et al.: Efficient two-round OT extension and silent non-interactive secure computation. In: ACM CCS 2019, November 2019","DOI":"10.1145\/3319535.3354255"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Bui, D., Couteau, G., Meyer, P., Passel\u00e8gue, A., Riahinia, M.: Fast public-key silent OT and more from constrained Naor-Reingold. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part\u00a0VI. LNCS, vol. 14656, pp. 88\u2013118. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_4","DOI":"10.1007\/978-3-031-58751-1_4"},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Chaabouni, R., Shelat, A.: Efficient protocols for set membership and range proofs. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 234\u2013252. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89255-7_15","DOI":"10.1007\/978-3-540-89255-7_15"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, October 2001","DOI":"10.1109\/SFCS.2001.959888"},{"key":"14_CR16","unstructured":"Dittmer, S., Ishai, Y., Ostrovsky, R.: Line-point zero knowledge and its applications. In: ITC 2021, July 2021"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1007\/978-3-030-56880-1_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Escudero","year":"2020","unstructured":"Escudero, D., Ghosh, S., Keller, M., Rachuri, R., Scholl, P.: Improved primitives for MPC over mixed arithmetic-binary circuits. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 823\u2013852. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_29"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Esser, A., Santini, P.: Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part\u00a0VI. LNCS, vol. 14925, pp. 183\u2013217. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68391-6_6","DOI":"10.1007\/978-3-031-68391-6_6"},{"key":"14_CR19","unstructured":"Fu, X., Li, M., Lyu, S., Liu, C.: Bit-fixing correlation attacks on Goldreich\u2019s pseudorandom generators. Cryptology ePrint Archive, Paper 2024\/1594 (2024). https:\/\/eprint.iacr.org\/2024\/1594"},{"key":"14_CR20","unstructured":"Goldreich, O.: Candidate one-way functions based on expander graphs. Cryptology ePrint Archive, Report 2000\/063 (2000). https:\/\/eprint.iacr.org\/2000\/063"},{"issue":"4","key":"14_CR21","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM (JACM) 33(4), 792\u2013807 (1986)","journal-title":"J. ACM (JACM)"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems (extended abstract). In: 17th ACM STOC, May 1985","DOI":"10.1145\/22145.22178"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-642-25385-0_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"J Groth","year":"2011","unstructured":"Groth, J.: Efficient zero-knowledge arguments from two-tiered homomorphic commitments. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 431\u2013448. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_23"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: 53rd ACM STOC, June 2021","DOI":"10.1145\/3406325.3451093"},{"key":"14_CR25","doi-asserted-by":"publisher","unstructured":"Lin, F., Xing, C., Yao, Y.: More efficient zero-knowledge protocols over $$\\mathbb{Z} _{2^k}$$ via Galois rings. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part\u00a0IX. LNCS, vol. 14928, pp 424\u2013457. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68400-5_13","DOI":"10.1007\/978-3-031-68400-5_13"},{"key":"14_CR26","unstructured":"Lombardi, A., Vaikuntanathan, V.: Minimizing the complexity of Goldreich\u2019s pseudorandom generator. Cryptology ePrint Archive, Report 2017\/277 (2017). https:\/\/eprint.iacr.org\/2017\/277"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"ODonnell, R., Witmer, D.: Goldreich\u2019s PRG: evidence for near-optimal polynomial stretch. In: 2014 IEEE 29th Conference on Computational Complexity (CCC), pp. 1\u201312. IEEE (2014)","DOI":"10.1109\/CCC.2014.9"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-030-35423-7_12","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2019","author":"D Rotaru","year":"2019","unstructured":"Rotaru, D., Wood, T.: MArBled circuits: mixing arithmetic and Boolean circuits with active security. In: Hao, F., Ruj, S., Sen Gupta, S. (eds.) INDOCRYPT 2019. LNCS, vol. 11898, pp. 227\u2013249. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35423-7_12"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Schoppmann, P., Gasc\u00f3n, A., Reichert, L., Raykova, M.: Distributed vector-OLE: improved constructions and implementation. In: ACM CCS 2019, November 2019","DOI":"10.1145\/3319535.3363228"},{"key":"14_CR30","unstructured":"\u00dcnal, A.: New baselines for local pseudorandom number generators by field extensions. Cryptology ePrint Archive, Report 2023\/550 (2023). https:\/\/eprint.iacr.org\/2023\/550"},{"key":"14_CR31","doi-asserted-by":"crossref","unstructured":"Weng, C., Yang, K., Katz, J., Wang, X.: Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for Boolean and arithmetic circuits. In: 2021 IEEE Symposium on Security and Privacy, May 2021","DOI":"10.1109\/SP40001.2021.00056"},{"key":"14_CR32","unstructured":"Weng, C., Yang, K., Xie, X., Katz, J., Wang, X.: Mystique: efficient conversions for zero-knowledge proofs with applications to machine learning. In: USENIX Security 2021, August 2021"},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"Weng, C., Yang, K., Yang, Z., Xie, X., Wang, X.: AntMan: interactive zero-knowledge proofs with sublinear communication. In: ACM CCS 2022, November 2022","DOI":"10.1145\/3548606.3560667"},{"issue":"2","key":"14_CR34","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1109\/TIT.2021.3128315","volume":"68","author":"J Yang","year":"2021","unstructured":"Yang, J., Guo, Q., Johansson, T., Lentmaier, M.: Revisiting the concrete security of Goldreich\u2019s pseudorandom generator. IEEE Trans. Inf. Theory 68(2), 1329\u20131354 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR35","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: ACM CCS 2021, November 2021","DOI":"10.1145\/3460120.3484556"},{"key":"14_CR36","doi-asserted-by":"crossref","unstructured":"Yang, K., Weng, C., Lan, X., Zhang, J., Wang, X.: Ferret: fast extension for correlated OT with small communication. In: ACM CCS 2020, November 2020","DOI":"10.1145\/3372297.3417276"},{"key":"14_CR37","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF01215917","volume":"17","author":"J von Zur Gathen","year":"1997","unstructured":"von Zur Gathen, J., Roche, J.R.: Polynomials with two values. Combinatorica 17, 345\u2013362 (1997)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91134-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T04:39:56Z","timestamp":1745728796000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91134-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031911330","9783031911347"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91134-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":"27 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}