{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T05:43:48Z","timestamp":1767851028081,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,13]],"date-time":"2022-11-13T00:00:00Z","timestamp":1668297600000},"content-version":"vor","delay-in-days":366,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Research Council","award":["803096"],"award-info":[{"award-number":["803096"]}]},{"name":"Carlsberg Foundation","award":["CF18-112"],"award-info":[{"award-number":["CF18-112"]}]},{"name":"Defense Advanced Research Projects Agency","award":["HR001120C0085"],"award-info":[{"award-number":["HR001120C0085"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,12]]},"DOI":"10.1145\/3460120.3484812","type":"proceedings-article","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T12:05:33Z","timestamp":1636805133000},"page":"192-211","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and Z2k"],"prefix":"10.1145","author":[{"given":"Carsten","family":"Baum","sequence":"first","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}]},{"given":"Lennart","family":"Braun","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}]},{"given":"Alexander","family":"Munch-Hansen","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}]},{"given":"Benoit","family":"Razet","sequence":"additional","affiliation":[{"name":"Galois, Inc., Portland, OR, USA"}]},{"given":"Peter","family":"Scholl","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}]}],"member":"320","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Yuval Ishai, Michael Nielsen, and Lior Zichron.","author":"Applebaum Benny","year":"2017","unstructured":"Benny Applebaum, Ivan Damgr ard, Yuval Ishai, Michael Nielsen, and Lior Zichron. 2017. Secure Arithmetic Computation with Constant Computational Overhead. In CRYPTO 2017, Part I (LNCS ). Springer, Heidelberg."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516738"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Carsten Baum Lennart Braun Alexander Munch-Hansen Benoit Razet and Peter Scholl. 2021 a. Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and $mathbbZ_2^k$ (Full Version). Cryptology ePrint Archive Report 2021\/750. https:\/\/eprint.iacr.org\/2021\/750.","DOI":"10.1145\/3460120.3484812"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84259-8_4"},{"key":"e_1_3_2_1_5_1","volume-title":"CRYPTO'91 (LNCS )","author":"Beaver Donald","unstructured":"Donald Beaver. 1992. Efficient Multiparty Protocols Using Circuit Randomization. In CRYPTO'91 (LNCS ). Springer, Heidelberg."},{"key":"e_1_3_2_1_6_1","volume-title":"Semi-homomorphic Encryption and Multiparty Computation. In EUROCRYPT 2011 (LNCS ). Springer","author":"Bendlin Rikke","year":"2011","unstructured":"Rikke Bendlin, Ivan Damg\u00e5rd, Claudio Orlandi, and Sarah Zakarias. 2011. Semi-homomorphic Encryption and Multiparty Computation. In EUROCRYPT 2011 (LNCS ). Springer, Heidelberg."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243868"},{"key":"e_1_3_2_1_8_1","volume-title":"ACM CCS","author":"Boyle Elette","year":"2019","unstructured":"Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Rindal, and Peter Scholl. 2019 b. Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. In ACM CCS 2019. ACM Press."},{"key":"e_1_3_2_1_9_1","volume-title":"CRYPTO","author":"Boyle Elette","year":"2019","unstructured":"Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl. 2019 a. Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. In CRYPTO 2019, Part III (LNCS ). Springer, Heidelberg."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339820"},{"key":"e_1_3_2_1_11_1","volume-title":"SCN 10 (LNCS )","author":"Catrina Octavian","unstructured":"Octavian Catrina and Sebastiaan de Hoogh. 2010. Improved Primitives for Secure Multiparty Integer Computation. In SCN 10 (LNCS ). Springer, Heidelberg."},{"key":"e_1_3_2_1_12_1","volume-title":"CRYPTO","author":"Cramer Ronald","year":"2018","unstructured":"Ronald Cramer, Ivan Damgr ard, Daniel Escudero, Peter Scholl, and Chaoping Xing. 2018. SPD $mathbbZ_2^k$: Efficient MPC mod $2^k$ for Dishonest Majority. In CRYPTO 2018, Part II (LNCS ). Springer, Heidelberg."},{"key":"e_1_3_2_1_13_1","volume-title":"CRYPTO","author":"Ivan Damgr","year":"2017","unstructured":"Ivan Damgr ard, Jesper Buus Nielsen, Michael Nielsen, and Samuel Ranellucci. 2017. The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited. In CRYPTO 2017, Part I (LNCS ). Springer, Heidelberg."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"e_1_3_2_1_15_1","volume-title":"2nd Conference on Information-Theoretic Cryptography (ITC","author":"Dittmer Samuel","year":"2021","unstructured":"Samuel Dittmer, Yuval Ishai, and Rafail Ostrovsky. 2021. Line-point zero knowledge and its applications. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_29"},{"key":"e_1_3_2_1_17_1","volume-title":"CRYPTO'82","author":"Even Shimon","unstructured":"Shimon Even, Oded Goldreich, and Abraham Lempel. 1982. A Randomized Protocol for Signing Contracts. In CRYPTO'82. Plenum Press, New York, USA."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_7"},{"key":"e_1_3_2_1_19_1","volume-title":"17th ACM STOC","author":"Goldwasser Shafi","unstructured":"Shafi Goldwasser, Silvio Micali, and Charles Rackoff. 1985. The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract). In 17th ACM STOC. ACM Press."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_21"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45727-3_19"},{"key":"e_1_3_2_1_22_1","volume-title":"21st ACM STOC","author":"Impagliazzo Russell","unstructured":"Russell Impagliazzo and Steven Rudich. 1989. Limits on the Provable Consequences of One-Way Permutations. In 21st ACM STOC. ACM Press."},{"key":"e_1_3_2_1_23_1","volume-title":"Extending Oblivious Transfers Efficiently. In CRYPTO 2003 (LNCS ). Springer","author":"Ishai Yuval","year":"2003","unstructured":"Yuval Ishai, Joe Kilian, Kobbi Nissim, and Erez Petrank. 2003. Extending Oblivious Transfers Efficiently. In CRYPTO 2003 (LNCS ). Springer, Heidelberg."},{"key":"e_1_3_2_1_24_1","volume-title":"Secure Arithmetic Computation with No Honest Majority. In TCC 2009 (LNCS ). Springer","author":"Ishai Yuval","year":"2009","unstructured":"Yuval Ishai, Manoj Prabhakaran, and Amit Sahai. 2009. Secure Arithmetic Computation with No Honest Majority. In TCC 2009 (LNCS ). Springer, Heidelberg."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516662"},{"key":"e_1_3_2_1_26_1","volume-title":"Rabbit: Efficient Comparison for Secure Multi-Party Computation. Financial Crypto","author":"Makri Eleftheria","year":"2021","unstructured":"Eleftheria Makri, Dragos Rotaru, Frederik Vercauteren, and Sameer Wagh. 2021. Rabbit: Efficient Comparison for Secure Multi-Party Computation. Financial Crypto 2021."},{"key":"e_1_3_2_1_27_1","volume-title":"31st ACM STOC","author":"Naor Moni","unstructured":"Moni Naor and Benny Pinkas. 1999. Oblivious Transfer and Polynomial Evaluation. In 31st ACM STOC. ACM Press."},{"key":"e_1_3_2_1_28_1","volume-title":"MArBled Circuits: Mixing Arithmetic and Boolean Circuits with Active Security. In INDOCRYPT 2019 (LNCS ). Springer","author":"Rotaru Dragos","year":"2019","unstructured":"Dragos Rotaru and Tim Wood. 2019. MArBled Circuits: Mixing Arithmetic and Boolean Circuits with Active Security. In INDOCRYPT 2019 (LNCS ). Springer, Heidelberg."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-76578-5_19"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3363228"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00056"},{"key":"e_1_3_2_1_32_1","volume-title":"30th USENIX Security Symposium (USENIX Security 21)","author":"Weng Chenkai","year":"2021","unstructured":"Chenkai Weng, Kang Yang, Xiang Xie, Jonathan Katz, and Xiao Wang. 2021 b. Mystique: Efficient Conversions for Zero-Knowledge Proofs with Applications to Machine Learning. In 30th USENIX Security Symposium (USENIX Security 21). 501--518."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484556"},{"key":"e_1_3_2_1_34_1","volume-title":"Ferret: Fast Extension for Correlated OT with Small Communication. In ACM CCS","author":"Yang Kang","year":"2020","unstructured":"Kang Yang, Chenkai Weng, Xiao Lan, Jiang Zhang, and Xiao Wang. 2020. Ferret: Fast Extension for Correlated OT with Small Communication. In ACM CCS 2020. ACM Press."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_8"}],"event":{"name":"CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security","location":"Virtual Event Republic of Korea","acronym":"CCS '21","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484812","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484812","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484812","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T20:47:55Z","timestamp":1763498875000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484812"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,12]]},"references-count":35,"alternative-id":["10.1145\/3460120.3484812","10.1145\/3460120"],"URL":"https:\/\/doi.org\/10.1145\/3460120.3484812","relation":{},"subject":[],"published":{"date-parts":[[2021,11,12]]},"assertion":[{"value":"2021-11-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}