{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T18:02:19Z","timestamp":1770228139622,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":19,"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":"US-Israel Binational Science Foundation","award":["2018393"],"award-info":[{"award-number":["2018393"]}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["2774\/20"],"award-info":[{"award-number":["2774\/20"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["Project NTSC (742754)"],"award-info":[{"award-number":["Project NTSC (742754)"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR001120C0087, HR0011-20-2-0025"],"award-info":[{"award-number":["HR001120C0087, HR0011-20-2-0025"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3559385","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"829-841","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Improving Line-Point Zero Knowledge"],"prefix":"10.1145","author":[{"given":"Samuel","family":"Dittmer","sequence":"first","affiliation":[{"name":"Stealth Software Technologies, Inc., Los Angeles, CA, USA"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}]},{"given":"Steve","family":"Lu","sequence":"additional","affiliation":[{"name":"Stealth Software Technologies, Inc., Los Angeles, CA, USA"}]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles, Los Angeles, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.32"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134104"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84259-8_4"},{"key":"e_1_3_2_2_4_1","volume-title":"Compressing Vector OLE. In CCS","author":"Boyle Elette","year":"2018","unstructured":"Elette Boyle , Geoffroy Couteau , Niv Gilboa , and Yuval Ishai . 2018 . Compressing Vector OLE. In CCS 2018. 896--912. Elette Boyle, Geoffroy Couteau, Niv Gilboa, and Yuval Ishai. 2018. Compressing Vector OLE. In CCS 2018. 896--912."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_14"},{"key":"e_1_3_2_2_6_1","volume-title":"Reusable Non-Interactive Secure Computation. In CRYPTO","author":"Chase Melissa","year":"2019","unstructured":"Melissa Chase , Yevgeniy Dodis , Yuval Ishai , Daniel Kraschewski , Tianren Liu , Rafail Ostrovsky , and Vinod Vaikuntanathan . 2019 . Reusable Non-Interactive Secure Computation. In CRYPTO 2019, Part III. 462--488. Melissa Chase, Yevgeniy Dodis, Yuval Ishai, Daniel Kraschewski, Tianren Liu, Rafail Ostrovsky, and Vinod Vaikuntanathan. 2019. Reusable Non-Interactive Secure Computation. In CRYPTO 2019, Part III. 462--488."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84252-9_17"},{"key":"e_1_3_2_2_8_1","volume-title":"Line-Point Zero Knowledge and Its Applications. In ITC","author":"Dittmer Sam","year":"2021","unstructured":"Sam Dittmer , Yuval Ishai , and Rafail Ostrovsky . 2021 . Line-Point Zero Knowledge and Its Applications. In ITC 2021. Sam Dittmer, Yuval Ishai, and Rafail Ostrovsky. 2021. Line-Point Zero Knowledge and Its Applications. In ITC 2021."},{"key":"e_1_3_2_2_9_1","volume-title":"High-Performance Computing","author":"D'Alberto Paolo","unstructured":"Paolo D'Alberto and Alexandru Nicolau . 2005. Using recursion to boost ATLAS's performance . In High-Performance Computing . Springer , 142--151. Paolo D'Alberto and Alexandru Nicolau. 2005. Using recursion to boost ATLAS's performance. In High-Performance Computing. Springer, 142--151."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Rosario Gennaro Craig Gentry Bryan Parno and Mariana Raykova. 2013. Quadratic Span Programs and Succinct NIZKs without PCPs. In EUROCRYPT.  Rosario Gennaro Craig Gentry Bryan Parno and Mariana Raykova. 2013. Quadratic Span Programs and Succinct NIZKs without PCPs. In EUROCRYPT.","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"e_1_3_2_2_11_1","volume-title":"On the Size of Pairing-Based Non-interactive Arguments. In EUROCRYPT","author":"Groth Jens","year":"2016","unstructured":"Jens Groth . 2016 . On the Size of Pairing-Based Non-interactive Arguments. In EUROCRYPT 2016, Part II,, Marc Fischlin and Jean-S\u00e9bastien Coron (Eds.). 305--326. Jens Groth. 2016. On the Size of Pairing-Based Non-interactive Arguments. In EUROCRYPT 2016, Part II,, Marc Fischlin and Jean-S\u00e9bastien Coron (Eds.). 305--326."},{"key":"e_1_3_2_2_12_1","volume-title":"Stacked Garbling for Disjunctive Zero-Knowledge Proofs. In EUROCRYPT","author":"Heath David","year":"2020","unstructured":"David Heath and Vladimir Kolesnikov . 2020 . Stacked Garbling for Disjunctive Zero-Knowledge Proofs. In EUROCRYPT 2020, Part III. 569--598. David Heath and Vladimir Kolesnikov. 2020. Stacked Garbling for Disjunctive Zero-Knowledge Proofs. In EUROCRYPT 2020, Part III. 569--598."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/3014904.3014983"},{"key":"e_1_3_2_2_14_1","volume-title":"Linear-time and post-quantum zero-knowledge SNARKs for R1CS. Cryptology ePrint Archive","author":"Lee Jonathan","year":"2021","unstructured":"Jonathan Lee , Srinath Setty , Justin Thaler , and Riad Wahby . 2021. Linear-time and post-quantum zero-knowledge SNARKs for R1CS. Cryptology ePrint Archive ( 2021 ). Jonathan Lee, Srinath Setty, Justin Thaler, and Riad Wahby. 2021. Linear-time and post-quantum zero-knowledge SNARKs for R1CS. Cryptology ePrint Archive (2021)."},{"key":"e_1_3_2_2_15_1","first-page":"1055","article-title":"Distributed Vector-OLE","volume":"2019","author":"Schoppmann Phillipp","year":"2019","unstructured":"Phillipp Schoppmann , Adri\u00e0 Gasc\u00f3n , Leonie Reichert , and Mariana Raykova . 2019 . Distributed Vector-OLE : Improved Constructions and Implementation. In CCS 2019. 1055 -- 1072 . Phillipp Schoppmann, Adri\u00e0 Gasc\u00f3n, Leonie Reichert, and Mariana Raykova. 2019. Distributed Vector-OLE: Improved Constructions and Implementation. In CCS 2019. 1055--1072.","journal-title":"Improved Constructions and Implementation. In CCS"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00056"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Kang Yang Pratik Sarkar Chenkai Weng and Xiao Wang. 2021. QuickSilver: Efficient and Affordable Zero-Knowledge Proofs for Circuits and Polynomials over Any Field. In CCS. Full version: https:\/\/eprint.iacr.org\/2021\/076.  Kang Yang Pratik Sarkar Chenkai Weng and Xiao Wang. 2021. QuickSilver: Efficient and Affordable Zero-Knowledge Proofs for Circuits and Polynomials over Any Field. In CCS. Full version: https:\/\/eprint.iacr.org\/2021\/076.","DOI":"10.1145\/3460120.3484556"},{"key":"e_1_3_2_2_19_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.3559385","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3559385","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3559385","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:50:57Z","timestamp":1750182657000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3559385"}},"subtitle":["Two Multiplications for the Price of One"],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":19,"alternative-id":["10.1145\/3548606.3559385","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3559385","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"}}]}}