{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T16:52:47Z","timestamp":1775667167644,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DARPA","award":["HR001120C0087"],"award-info":[{"award-number":["HR001120C0087"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62102037, 61932019, 62022018"],"award-info":[{"award-number":["62102037, 61932019, 62022018"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF","award":["2016240"],"award-info":[{"award-number":["2016240"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3560667","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"2901-2914","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["AntMan"],"prefix":"10.1145","author":[{"given":"Chenkai","family":"Weng","sequence":"first","affiliation":[{"name":"Northwestern University, Evanston, IL, USA"}]},{"given":"Kang","family":"Yang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Cryptology, Beijing, China"}]},{"given":"Zhaomin","family":"Yang","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Privacy-Preserving Computation and MatrixElements Technologies, Shanghai, China"}]},{"given":"Xiang","family":"Xie","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Privacy-Preserving Computation and MatrixElements Technologies, Shanghai, China"}]},{"given":"Xiao","family":"Wang","sequence":"additional","affiliation":[{"name":"Northwestern University, Evanston, IL, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484812"},{"key":"e_1_3_2_1_3_1","unstructured":"Carsten Baum Lennart Braun Alexander Munch-Hansen and Peter Scholl. 2022. Moz\u21242 k arella: Efficient Vector-OLE and Zero-Knowledge Proofs Over \u21242 k. Cryptology ePrint Archive Paper 2022\/819. https:\/\/eprint.iacr.org\/2022\/819.  Carsten Baum Lennart Braun Alexander Munch-Hansen and Peter Scholl. 2022. Moz\u21242 k arella: Efficient Vector-OLE and Zero-Knowledge Proofs Over \u21242 k. Cryptology ePrint Archive Paper 2022\/819. https:\/\/eprint.iacr.org\/2022\/819."},{"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":"Semi-homomorphic Encryption and Multiparty Computation. In EUROCRYPT 2011 (LNCS","volume":"188","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 , Vol. 6632),, Kenneth G. Paterson (Ed.). Springer, Heidelberg, Germany, Tallinn, Estonia, 169-- 188 . https:\/\/doi.org\/10.1007\/978-3-642-20465-4_11 10.1007\/978-3-642-20465-4_11 Rikke Bendlin, Ivan Damg\u00e5rd, Claudio Orlandi, and Sarah Zakarias. 2011. Semi-homomorphic Encryption and Multiparty Computation. In EUROCRYPT 2011 (LNCS, Vol. 6632),, Kenneth G. Paterson (Ed.). Springer, Heidelberg, Germany, Tallinn, Estonia, 169--188. https:\/\/doi.org\/10.1007\/978-3-642-20465-4_11"},{"key":"e_1_3_2_1_6_1","volume-title":"TCC 2013 (LNCS","volume":"333","author":"Bitansky Nir","year":"2013","unstructured":"Nir Bitansky , Alessandro Chiesa , Yuval Ishai , Rafail Ostrovsky , and Omer Paneth . 2013 . Succinct Non-interactive Arguments via Linear Interactive Proofs . In TCC 2013 (LNCS , Vol. 7785),, Amit Sahai (Ed.). Springer, Heidelberg, Germany, Tokyo, Japan, 315-- 333 . https:\/\/doi.org\/10.1007\/978-3-642-36594-2_18 10.1007\/978-3-642-36594-2_18 Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, and Omer Paneth. 2013. Succinct Non-interactive Arguments via Linear Interactive Proofs. In TCC 2013 (LNCS, Vol. 7785),, Amit Sahai (Ed.). Springer, Heidelberg, Germany, Tokyo, Japan, 315--333. https:\/\/doi.org\/10.1007\/978-3-642-36594-2_18"},{"key":"e_1_3_2_1_7_1","volume-title":"ACM CCS","author":"Boyle Elette","year":"2019","unstructured":"Elette Boyle , Geoffroy Couteau , Niv Gilboa , and Yuval Ishai . 2018. Compressing Vector OLE . In ACM CCS 2019 ,, David Lie, Mohammad Mannan , Michael Backes, and XiaoFeng Wang (Eds.). ACM Press , Toronto, ON, Canada, 896--912. https:\/\/doi.org\/10.1145\/3243734.3243868 10.1145\/3243734.3243868 Elette Boyle, Geoffroy Couteau, Niv Gilboa, and Yuval Ishai. 2018. Compressing Vector OLE. In ACM CCS 2019,, David Lie, Mohammad Mannan, Michael Backes, and XiaoFeng Wang (Eds.). ACM Press, Toronto, ON, Canada, 896--912. https:\/\/doi.org\/10.1145\/3243734.3243868"},{"key":"e_1_3_2_1_8_1","volume-title":"Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. In ACM CCS 2019","author":"Boyle Elette","year":"2019","unstructured":"Elette Boyle , Geoffroy Couteau , Niv Gilboa , Yuval Ishai , Lisa Kohl , Peter Rindal , and Peter Scholl . 2019 . Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. In ACM CCS 2019 , Lorenzo Cavallaro, Johannes Kinder, XiaoFeng Wang, and Jonathan Katz (Eds.). ACM Press, London, UK, 291--308. https:\/\/doi.org\/10.1145\/33 19535.3354255 10.1145\/3319535.3354255 Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Rindal, and Peter Scholl. 2019. Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. In ACM CCS 2019, Lorenzo Cavallaro, Johannes Kinder, XiaoFeng Wang, and Jonathan Katz (Eds.). ACM Press, London, UK, 291--308. https:\/\/doi.org\/10.1145\/3319535.3354255"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959888"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84252-9_17"},{"key":"e_1_3_2_1_13_1","volume-title":"CRYPTO","volume":"187","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 , Vol. 10401),, Jonathan Katz and Hovav Shacham (Eds.). Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 167-- 187 . https:\/\/doi.org\/10.1007\/978-3-319-63688-7_6 10.1007\/978-3-319-63688-7_6 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, Vol. 10401),, Jonathan Katz and Hovav Shacham (Eds.). Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 167--187. https:\/\/doi.org\/10.1007\/978-3-319-63688-7_6"},{"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":"Improving Line-Point Zero Knowledge: Two Multiplications for the Price of One","author":"Dittmer Samuel","unstructured":"Samuel Dittmer , Yuval Ishai , Steve Lu , and Rafail Ostrovsky . 2022. Improving Line-Point Zero Knowledge: Two Multiplications for the Price of One . ACM Press . Samuel Dittmer, Yuval Ishai, Steve Lu, and Rafail Ostrovsky. 2022. Improving Line-Point Zero Knowledge: Two Multiplications for the Price of One. ACM Press."},{"key":"e_1_3_2_1_16_1","volume-title":"Line-Point Zero Knowledge and Its Applications. In 2nd Conference on Information-Theoretic Cryptography.","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. Samuel Dittmer, Yuval Ishai, and Rafail Ostrovsky. 2021. Line-Point Zero Knowledge and Its Applications. In 2nd Conference on Information-Theoretic Cryptography."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484800"},{"key":"e_1_3_2_1_19_1","volume-title":"Yael Tauman Kalai, and Guy N. Rothblum","author":"Goldwasser Shafi","year":"2008","unstructured":"Shafi Goldwasser , Yael Tauman Kalai, and Guy N. Rothblum . 2008 . Delegating computation: interactive proofs for muggles. In 40th ACM STOC,, Richard E. Ladner and Cynthia Dwork (Eds.). ACM Press , Victoria, BC, Canada, 113--122. https:\/\/doi.org\/10.1145\/1374376.1374396 10.1145\/1374376.1374396 Shafi Goldwasser, Yael Tauman Kalai, and Guy N. Rothblum. 2008. Delegating computation: interactive proofs for muggles. In 40th ACM STOC,, Richard E. Ladner and Cynthia Dwork (Eds.). ACM Press, Victoria, BC, Canada, 113--122. https:\/\/doi.org\/10.1145\/1374376.1374396"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84245-1_10"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44371-2_31"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45727-3_19"},{"key":"e_1_3_2_1_23_1","volume-title":"Evaluating Branching Programs on Encrypted Data. In TCC 2007 (LNCS","volume":"594","author":"Ishai Yuval","year":"2007","unstructured":"Yuval Ishai and Anat Paskin . 2007 . Evaluating Branching Programs on Encrypted Data. In TCC 2007 (LNCS , Vol. 4392), Salil P. Vadhan (Ed.). Springer, Heidelberg, Germany, Amsterdam, The Netherlands, 575-- 594 . https:\/\/doi.org\/10.1007\/978-3-540-70936-7_31 10.1007\/978-3-540-70936-7_31 Yuval Ishai and Anat Paskin. 2007. Evaluating Branching Programs on Encrypted Data. In TCC 2007 (LNCS, Vol. 4392), Salil P. Vadhan (Ed.). Springer, Heidelberg, Germany, Amsterdam, The Netherlands, 575--594. https:\/\/doi.org\/10.1007\/978-3-540-70936-7_31"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516662"},{"key":"e_1_3_2_1_25_1","volume-title":"Overdrive: Making SPDZ Great Again. In EUROCRYPT","author":"Keller Marcel","year":"2018","unstructured":"Marcel Keller , Valerio Pastro , and Dragos Rotaru . 2018 . Overdrive: Making SPDZ Great Again. In EUROCRYPT 2018, Part III (LNCS, Vol . 10822),, Jesper Buus Nielsen and Vincent Rijmen (Eds.). Springer , Heidelberg, Germany, Tel Aviv, Israel, 158--189. https:\/\/doi.org\/10.1007\/978-3-319-78372-7_6 10.1007\/978-3-319-78372-7_6 Marcel Keller, Valerio Pastro, and Dragos Rotaru. 2018. Overdrive: Making SPDZ Great Again. In EUROCRYPT 2018, Part III (LNCS, Vol. 10822),, Jesper Buus Nielsen and Vincent Rijmen (Eds.). Springer, Heidelberg, Germany, Tel Aviv, Israel, 158--189. https:\/\/doi.org\/10.1007\/978-3-319-78372-7_6"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3363228"},{"key":"e_1_3_2_1_28_1","unstructured":"Xiao Wang Alex J. Malozemoff and Jonathan Katz. 2016. EMP-toolkit: Efficient MultiParty computation toolkit. https:\/\/github.com\/emp-toolkit.  Xiao Wang Alex J. Malozemoff and Jonathan Katz. 2016. EMP-toolkit: Efficient MultiParty computation toolkit. https:\/\/github.com\/emp-toolkit."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00056"},{"key":"e_1_3_2_1_30_1","volume-title":"Mystique: Efficient Conversions for Zero-Knowledge Proofs with Applications to Machine Learning. In USENIX Security","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 USENIX Security 2021,, Michael Bailey and Rachel Greenstadt (Eds.). USENIX Association , 501--518. Chenkai Weng, Kang Yang, Xiang Xie, Jonathan Katz, and Xiao Wang. 2021b. Mystique: Efficient Conversions for Zero-Knowledge Proofs with Applications to Machine Learning. In USENIX Security 2021,, Michael Bailey and Rachel Greenstadt (Eds.). USENIX Association, 501--518."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Chenkai Weng Kang Yang Zhaomin Yang Xiang Xie and Xiao Wang. 2022. AntMan: Interactive Zero-Knowledge Proofs with Sublinear Communication. Cryptology ePrint Archive Paper 2022\/566. https:\/\/eprint.iacr.org\/2022\/566.  Chenkai Weng Kang Yang Zhaomin Yang Xiang Xie and Xiao Wang. 2022. AntMan: Interactive Zero-Knowledge Proofs with Sublinear Communication. Cryptology ePrint Archive Paper 2022\/566. https:\/\/eprint.iacr.org\/2022\/566.","DOI":"10.1145\/3548606.3560667"},{"key":"e_1_3_2_1_32_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,, Jay Ligatti, Xinming Ou , Jonathan Katz, and Giovanni Vigna (Eds.). ACM Press , Virtual Event, USA, 1607--1626. https:\/\/doi.org\/10.1145\/3372297.3417276 10.1145\/3372297.3417276 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,, Jay Ligatti, Xinming Ou, Jonathan Katz, and Giovanni Vigna (Eds.). ACM Press, Virtual Event, USA, 1607--1626. https:\/\/doi.org\/10.1145\/3372297.3417276"},{"key":"e_1_3_2_1_35_1","volume-title":"TOTA: Fully Homomorphic Encryption with Smaller Parameters and Stronger Security. Cryptology ePrint Archive, Paper 2021\/1347. https:\/\/eprint.iacr.org\/2021\/1347 https:\/\/eprint.iacr.org\/2021\/1347.","author":"Yang Zhaomin","year":"2021","unstructured":"Zhaomin Yang , Xiang Xie , Huajie Shen , Shiying Chen , and Jun Zhou . 2021 b. TOTA: Fully Homomorphic Encryption with Smaller Parameters and Stronger Security. Cryptology ePrint Archive, Paper 2021\/1347. https:\/\/eprint.iacr.org\/2021\/1347 https:\/\/eprint.iacr.org\/2021\/1347. Zhaomin Yang, Xiang Xie, Huajie Shen, Shiying Chen, and Jun Zhou. 2021b. TOTA: Fully Homomorphic Encryption with Smaller Parameters and Stronger Security. Cryptology ePrint Archive, Paper 2021\/1347. https:\/\/eprint.iacr.org\/2021\/1347 https:\/\/eprint.iacr.org\/2021\/1347."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484767"}],"event":{"name":"CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security","location":"Los Angeles CA USA","acronym":"CCS '22","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560667","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560667","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560667","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:59Z","timestamp":1750182539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560667"}},"subtitle":["Interactive Zero-Knowledge Proofs with Sublinear Communication"],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":34,"alternative-id":["10.1145\/3548606.3560667","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3560667","relation":{},"subject":[],"published":{"date-parts":[[2022,11,7]]},"assertion":[{"value":"2022-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}