{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T02:00:52Z","timestamp":1778292052606,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":37,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF CAREER","award":["1942789"],"award-info":[{"award-number":["1942789"]}]},{"name":"NSF","award":["CNS-1814919"],"award-info":[{"award-number":["CNS-1814919"]}]},{"name":"Johns Hopkins University","award":["Catalyst award"],"award-info":[{"award-number":["Catalyst award"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3560653","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"1203-1216","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Succinct Zero Knowledge for Floating Point Computations"],"prefix":"10.1145","author":[{"given":"Sanjam","family":"Garg","sequence":"first","affiliation":[{"name":"UC Berkeley & NTT Research, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Jain","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengzhong","family":"Jin","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinuo","family":"Zhang","sequence":"additional","affiliation":[{"name":"UC Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956"},{"key":"e_1_3_2_2_2_1","volume-title":"Smart","author":"Archer David W.","year":"2021","unstructured":"David W. Archer , Shahla Atapoor , and Nigel P . Smart . 2021 . The Cost of IEEE Arithmetic in Secure Computation. LatinCrypt . https:\/\/ia.cr\/2021\/054. David W. Archer, Shahla Atapoor, and Nigel P. Smart. 2021. The Cost of IEEE Arithmetic in Secure Computation. LatinCrypt. https:\/\/ia.cr\/2021\/054."},{"key":"e_1_3_2_2_3_1","volume-title":"ACM CCS 93, Dorothy E","author":"Bellare Mihir","unstructured":"Mihir Bellare and Phillip Rogaway . 1993. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols . In ACM CCS 93, Dorothy E . Denning, Raymond Pyle, Ravi Ganesan, Ravi S. Sandhu, and Victoria Ashby (Eds.). ACM Press , 62--73. https:\/\/doi.org\/10.1145\/168588.168596 10.1145\/168588.168596 Mihir Bellare and Phillip Rogaway. 1993. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In ACM CCS 93, Dorothy E. Denning, Raymond Pyle, Ravi Ganesan, Ravi S. Sandhu, and Victoria Ashby (Eds.). ACM Press, 62--73. https:\/\/doi.org\/10.1145\/168588.168596"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.36"},{"key":"e_1_3_2_2_5_1","volume-title":"EUROCRYPT","volume":"128","author":"Ben-Sasson Eli","year":"2019","unstructured":"Eli Ben-Sasson , Alessandro Chiesa , Michael Riabzev , Nicholas Spooner , Madars Virza , and Nicholas P. Ward . 2019. Aurora: Transparent Succinct Arguments for R1CS . In EUROCRYPT 2019 , Part I (LNCS , Vol. 11476), Yuval Ishai and Vincent Rijmen (Eds.). Springer, Heidelberg, 103-- 128 . https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4 10.1007\/978-3-030-17653-2_4 Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, and Nicholas P. Ward. 2019. Aurora: Transparent Succinct Arguments for R1CS. In EUROCRYPT 2019, Part I (LNCS, Vol. 11476), Yuval Ishai and Vincent Rijmen (Eds.). Springer, Heidelberg, 103--128. https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4"},{"key":"e_1_3_2_2_6_1","volume-title":"ACNS 19 (LNCS","author":"Bergamaschi Fl\u00e1vio","unstructured":"Fl\u00e1vio Bergamaschi , Shai Halevi , Tzipora T. Halevi , and Hamish Hunt . 2019. Homomorphic Training of 30,000 Logistic Regression Models . In ACNS 19 (LNCS , Vol. 11464), Robert H. Deng, Val\u00e9rie Gauthier-Uma\u00f1a, Mart\u00edn Ochoa, and Moti Yung (Eds.). Springer, Heidelberg, 592-- 611 . https:\/\/doi.org\/10.1007\/978-3-030-21568-2_29 10.1007\/978-3-030-21568-2_29 Fl\u00e1vio Bergamaschi, Shai Halevi, Tzipora T. Halevi, and Hamish Hunt. 2019. Homomorphic Training of 30,000 Logistic Regression Models. In ACNS 19 (LNCS, Vol. 11464), Robert H. Deng, Val\u00e9rie Gauthier-Uma\u00f1a, Mart\u00edn Ochoa, and Moti Yung (Eds.). Springer, Heidelberg, 592--611. https:\/\/doi.org\/10.1007\/978-3-030-21568-2_29"},{"key":"e_1_3_2_2_7_1","volume-title":"Foundations of Data Science","author":"Blum Avrim","unstructured":"Avrim Blum , John Hopcroft , and Ravindran Kannan . 2020. Foundations of Data Science . Cambridge University Press . https:\/\/doi.org\/10.1017\/9781108755528 10.1017\/9781108755528 Avrim Blum, John Hopcroft, and Ravindran Kannan. 2020. Foundations of Data Science. Cambridge University Press. https:\/\/doi.org\/10.1017\/9781108755528"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_31"},{"key":"e_1_3_2_2_9_1","volume-title":"Bulletproofs: Short Proofs for Confidential Transactions and More. In 2018 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 315--334","author":"B\u00fcnz Benedikt","year":"2018","unstructured":"Benedikt B\u00fcnz , Jonathan Bootle , Dan Boneh , Andrew Poelstra , Pieter Wuille , and Greg Maxwell . 2018 . Bulletproofs: Short Proofs for Confidential Transactions and More. In 2018 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 315--334 . https:\/\/doi.org\/10.1109\/SP.2018.00020 10.1109\/SP.2018.00020 Benedikt B\u00fcnz, Jonathan Bootle, Dan Boneh, Andrew Poelstra, Pieter Wuille, and Greg Maxwell. 2018. Bulletproofs: Short Proofs for Confidential Transactions and More. In 2018 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 315--334. https:\/\/doi.org\/10.1109\/SP.2018.00020"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"e_1_3_2_2_11_1","volume-title":"Efficient Protocols for Set Membership and Range Proofs. In ASIACRYPT 2008 (LNCS","volume":"252","author":"Camenisch Jan","unstructured":"Jan Camenisch , Rafik Chaabouni , and abhi shelat. 2008 . Efficient Protocols for Set Membership and Range Proofs. In ASIACRYPT 2008 (LNCS , Vol. 5350), Josef Pieprzyk (Ed.). Springer, Heidelberg, 234-- 252 . https:\/\/doi.org\/10.1007\/978-3-540-89255-7_15 10.1007\/978-3-540-89255-7_15 Jan Camenisch, Rafik Chaabouni, and abhi shelat. 2008. Efficient Protocols for Set Membership and Range Proofs. In ASIACRYPT 2008 (LNCS, Vol. 5350), Josef Pieprzyk (Ed.). Springer, Heidelberg, 234--252. https:\/\/doi.org\/10.1007\/978-3-540-89255-7_15"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_27"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090245"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77883-5_9"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56614-6_11"},{"key":"e_1_3_2_2_17_1","volume-title":"CRYPTO'86 (LNCS","volume":"194","author":"Fiat Amos","year":"1987","unstructured":"Amos Fiat and Adi Shamir . 1987 . How to Prove Yourself: Practical Solutions to Identification and Signature Problems . In CRYPTO'86 (LNCS , Vol. 263), Andrew M. Odlyzko (Ed.). Springer, Heidelberg, 186-- 194 . https:\/\/doi.org\/10.1007\/3-540-47721-7_12 10.1007\/3-540-47721-7_12 Amos Fiat and Adi Shamir. 1987. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In CRYPTO'86 (LNCS, Vol. 263), Andrew M. Odlyzko (Ed.). Springer, Heidelberg, 186--194. https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"e_1_3_2_2_18_1","volume-title":"41st ACM STOC","author":"Gentry Craig","unstructured":"Craig Gentry . 2009. Fully homomorphic encryption using ideal lattices . In 41st ACM STOC , Michael Mitzenmacher (Ed.). ACM Press , 169--178. https:\/\/doi.org\/ 10.1145\/1536414.1536440 10.1145\/1536414.1536440 Craig Gentry. 2009. Fully homomorphic encryption using ideal lattices. In 41st ACM STOC, Michael Mitzenmacher (Ed.). ACM Press, 169--178. https:\/\/doi.org\/ 10.1145\/1536414.1536440"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/103162.103163"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699436"},{"key":"e_1_3_2_2_21_1","volume-title":"17th","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 , 291--304. https:\/\/doi.org\/10.1145\/22145.22178 10.1145\/22145.22178 Shafi Goldwasser, Silvio Micali, and Charles Rackoff. 1985. The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract). In 17th ACM STOC. ACM Press, 291--304. https:\/\/doi.org\/10.1145\/22145.22178"},{"key":"e_1_3_2_2_22_1","volume-title":"ACNS 05 (LNCS","author":"Groth Jens","unstructured":"Jens Groth . 2005. Non-interactive Zero-Knowledge Arguments for Voting . In ACNS 05 (LNCS , Vol. 3531), John Ioannidis, Angelos Keromytis, and Moti Yung (Eds.). Springer, Heidelberg, 467-- 482 . https:\/\/doi.org\/10.1007\/11496137_32 10.1007\/11496137_32 Jens Groth. 2005. Non-interactive Zero-Knowledge Arguments for Voting. In ACNS 05 (LNCS, Vol. 3531), John Ioannidis, Angelos Keromytis, and Moti Yung (Eds.). Springer, Heidelberg, 467--482. https:\/\/doi.org\/10.1007\/11496137_32"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_23"},{"key":"e_1_3_2_2_24_1","volume-title":"24th","author":"Kilian Joe","unstructured":"Joe Kilian . 1992. A Note on Efficient Zero-Knowledge Proofs and Arguments (Extended Abstract) . In 24th ACM STOC. ACM Press , 723--732. https:\/\/doi.org\/10. 1145\/129712.129782 Joe Kilian. 1992. A Note on Efficient Zero-Knowledge Proofs and Arguments (Extended Abstract). In 24th ACM STOC. ACM Press, 723--732. https:\/\/doi.org\/10. 1145\/129712.129782"},{"key":"e_1_3_2_2_25_1","volume-title":"On Diophantine Complexity and Statistical ZeroKnowledge Arguments. In ASIACRYPT 2003 (LNCS","volume":"415","author":"Lipmaa Helger","year":"2003","unstructured":"Helger Lipmaa . 2003 . On Diophantine Complexity and Statistical ZeroKnowledge Arguments. In ASIACRYPT 2003 (LNCS , Vol. 2894), Chi-Sung Laih (Ed.). Springer, Heidelberg, 398-- 415 . https:\/\/doi.org\/10.1007\/978-3-540-40061-5_26 10.1007\/978-3-540-40061-5_26 Helger Lipmaa. 2003. On Diophantine Complexity and Statistical ZeroKnowledge Arguments. In ASIACRYPT 2003 (LNCS, Vol. 2894), Chi-Sung Laih (Ed.). Springer, Heidelberg, 398--415. https:\/\/doi.org\/10.1007\/978-3-540-40061-5_26"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795284959"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.3160390713"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"e_1_3_2_2_30_1","volume-title":"Quarks: Quadruple-efficient transparent zkSNARKs. Cryptology ePrint Archive, Report 2020\/1275. https:\/\/ia.cr\/2020\/1275.","author":"Setty Srinath","year":"2020","unstructured":"Srinath Setty and Jonathan Lee . 2020 . Quarks: Quadruple-efficient transparent zkSNARKs. Cryptology ePrint Archive, Report 2020\/1275. https:\/\/ia.cr\/2020\/1275. Srinath Setty and Jonathan Lee. 2020. Quarks: Quadruple-efficient transparent zkSNARKs. Cryptology ePrint Archive, Report 2020\/1275. https:\/\/ia.cr\/2020\/1275."},{"key":"e_1_3_2_2_31_1","volume-title":"USENIX Security","author":"Setty Srinath T. V.","year":"2012","unstructured":"Srinath T. V. Setty , Victor Vu , Nikhil Panpalia , Benjamin Braun , Andrew J. Blumberg , and Michael Walfish . 2012. Taking Proof-Based Verified Computation a Few Steps Closer to Practicality . In USENIX Security 2012 , Tadayoshi Kohno (Ed.). USENIX Association , 253--268. Srinath T. V. Setty, Victor Vu, Nikhil Panpalia, Benjamin Braun, Andrew J. Blumberg, and Michael Walfish. 2012. Taking Proof-Based Verified Computation a Few Steps Closer to Practicality. In USENIX Security 2012, Tadayoshi Kohno (Ed.). USENIX Association, 253--268."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_5"},{"key":"e_1_3_2_2_33_1","volume-title":"The Princeton Companion to Mathematics (illustrated edition ed.)","author":"Trefethen Lloyd N.","unstructured":"Lloyd N. Trefethen . 2008. IV. 21 Numerical Analysis , in The Princeton Companion to Mathematics (illustrated edition ed.) . Princeton University Press , USA. Lloyd N. Trefethen. 2008. IV. 21 Numerical Analysis, in The Princeton Companion to Mathematics (illustrated edition ed.). Princeton University Press, USA."},{"key":"e_1_3_2_2_34_1","volume-title":"Trefethen and David Bau","author":"Lloyd","year":"1997","unstructured":"Lloyd N. Trefethen and David Bau . 1997 . Numerical Linear Algebra. SIAM. Lloyd N. Trefethen and David Bau. 1997. Numerical Linear Algebra. SIAM."},{"key":"e_1_3_2_2_35_1","volume-title":"Mystique: Efficient Conversions for Zero-Knowledge Proofs with Applications to Machine Learning. Cryptology ePrint Archive, Report 2021\/730. https: \/\/ia.cr\/2021\/730.","author":"Weng Chenkai","year":"2021","unstructured":"Chenkai Weng , Kang Yang , Xiang Xie , Jonathan Katz , and Xiao Wang . 2021 . Mystique: Efficient Conversions for Zero-Knowledge Proofs with Applications to Machine Learning. Cryptology ePrint Archive, Report 2021\/730. https: \/\/ia.cr\/2021\/730. Chenkai Weng, Kang Yang, Xiang Xie, Jonathan Katz, and Xiao Wang. 2021. Mystique: Efficient Conversions for Zero-Knowledge Proofs with Applications to Machine Learning. Cryptology ePrint Archive, Report 2021\/730. https: \/\/ia.cr\/2021\/730."},{"key":"e_1_3_2_2_36_1","volume-title":"Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation. In CRYPTO","author":"Xie Tiancheng","year":"2019","unstructured":"Tiancheng Xie , Jiaheng Zhang , Yupeng Zhang , Charalampos Papamanthou , and Dawn Song . 2019 . Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation. In CRYPTO 2019, Part III (LNCS, Vol . 11694), Alexandra Boldyreva and Daniele Micciancio (Eds.). Springer , Heidelberg, 733--764. https:\/\/doi.org\/10. 1007\/978-3-030-26954-8_24 Tiancheng Xie, Jiaheng Zhang, Yupeng Zhang, Charalampos Papamanthou, and Dawn Song. 2019. Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation. In CRYPTO 2019, Part III (LNCS, Vol. 11694), Alexandra Boldyreva and Daniele Micciancio (Eds.). Springer, Heidelberg, 733--764. https:\/\/doi.org\/10. 1007\/978-3-030-26954-8_24"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484767"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00052"}],"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.3560653","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560653","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560653","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.3560653"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":37,"alternative-id":["10.1145\/3548606.3560653","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3560653","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"}}]}}