{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T23:42:46Z","timestamp":1771371766140,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,30]],"date-time":"2020-10-30T00:00:00Z","timestamp":1604016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","award":["CRETP2-166734 ? FELICITY"],"award-info":[{"award-number":["CRETP2-166734 ? FELICITY"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,30]]},"DOI":"10.1145\/3372297.3417894","type":"proceedings-article","created":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T18:27:04Z","timestamp":1604341624000},"page":"1051-1070","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Practical Lattice-Based Zero-Knowledge Proofs for Integer Relations"],"prefix":"10.1145","author":[{"given":"Vadim","family":"Lyubashevsky","sequence":"first","affiliation":[{"name":"IBM Research - Zurich, Zurich, Switzerland"}]},{"given":"Ngoc Khanh","family":"Nguyen","sequence":"additional","affiliation":[{"name":"IBM Research - Zurich and ETH Zurich, Zurich, Switzerland"}]},{"given":"Gregor","family":"Seiler","sequence":"additional","affiliation":[{"name":"IBM Research - Zurich and ETH Zurich, Zurich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2020,11,2]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134104"},{"key":"e_1_3_2_2_2_1","volume-title":"Practical Product Proofs for Lattice Commitments. IACR Cryptology ePrint Archive","author":"Attema Thomas","year":"2020"},{"key":"e_1_3_2_2_3_1","volume-title":"Galbraith","author":"Bai Shi","year":"2014"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Carsten Baum Ivan Damg\u00e5rd Vadim Lyubashevsky Sabine Oechsner and Chris Peikert. 2018. More Efficient Commitments from Structured Lattice Assumptions. In SCN. 368--385.  Carsten Baum Ivan Damg\u00e5rd Vadim Lyubashevsky Sabine Oechsner and Chris Peikert. 2018. More Efficient Commitments from Structured Lattice Assumptions. In SCN. 368--385.","DOI":"10.1007\/978-3-319-98113-0_20"},{"key":"e_1_3_2_2_5_1","first-page":"759","article-title":"Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings","volume":"2017","author":"Baum Carsten","year":"2017","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_6_1","volume-title":"Public Key Cryptography (1) (Lecture Notes in Computer Science)","author":"Baum Carsten"},{"key":"e_1_3_2_2_7_1","volume-title":"Ward","author":"Ben-Sasson Eli","year":"2019"},{"key":"e_1_3_2_2_8_1","volume-title":"CRYPTO (1) (Lecture Notes in Computer Science)","author":"Bootle Jonathan"},{"key":"e_1_3_2_2_9_1","volume-title":"CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM. In 2018 IEEE European Symposium on Security and Privacy, EuroS&P. 353--367","author":"Bos Joppe W.","year":"2018"},{"key":"e_1_3_2_2_10_1","volume-title":"The Measure-and-Reprogram Technique 2.0: Multi-Round Fiat-Shamir and More. CoRR","author":"Don Jelle","year":"2020"},{"key":"e_1_3_2_2_11_1","volume-title":"CRYPTO (2) (Lecture Notes in Computer Science)","author":"Don Jelle"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2018.i1.238-268"},{"key":"e_1_3_2_2_13_1","volume-title":"Ngoc Khanh Nguyen, and Gregor Seiler","author":"Esgin Muhammed F.","year":"2020"},{"key":"e_1_3_2_2_14_1","volume-title":"CRYPTO (1) (Lecture Notes in Computer Science)","author":"Esgin Muhammed F."},{"key":"e_1_3_2_2_15_1","volume-title":"ACNS 2019, Bogota, Colombia, June 5--7, 2019, Proceedings (Lecture Notes in Computer Science), Robert H. Deng, Val\u00e9rie Gauthier-Umana, Martin Ochoa, and Moti Yung (Eds.)","volume":"11464","author":"Esgin Muhammed F.","year":"2019"},{"key":"e_1_3_2_2_16_1","volume-title":"Scalable and Post-Quantum Blockchain Confidential Transactions Protocol. In ACM Conference on Computer and Communications Security. ACM, 567--584","author":"Esgin Muhammed F.","year":"2019"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Joe Kilian. 1992. A Note on Efficient Zero-Knowledge Proofs and Arguments (Extended Abstract). In STOC. ACM 723--732.  Joe Kilian. 1992. A Note on Efficient Zero-Knowledge Proofs and Arguments (Extended Abstract). In STOC. ACM 723--732.","DOI":"10.1145\/129712.129782"},{"key":"e_1_3_2_2_18_1","volume-title":"EUROCRYPT (3) (Lecture Notes in Computer Science)","author":"Kiltz Eike"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-014-9938-4"},{"key":"e_1_3_2_2_20_1","volume-title":"CRYPTO (2) (Lecture Notes in Computer Science)","author":"Ling San"},{"key":"e_1_3_2_2_21_1","volume-title":"CRYPTO (2) (Lecture Notes in Computer Science)","author":"Liu Qipeng"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Vadim Lyubashevsky. 2009. Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures. In ASIACRYPT. 598--616.  Vadim Lyubashevsky. 2009. Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures. In ASIACRYPT. 598--616.","DOI":"10.1007\/978-3-642-10366-7_35"},{"key":"e_1_3_2_2_23_1","unstructured":"Vadim Lyubashevsky. 2019. Basic Lattice Cryptography: Encryption and Fiat-Shamir Signatures. (2019).  Vadim Lyubashevsky. 2019. Basic Lattice Cryptography: Encryption and Fiat-Shamir Signatures. (2019)."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2019.i3.180-201"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795284959"},{"key":"e_1_3_2_2_26_1","first-page":"39","article-title":"Faster AVX2 optimized NTT multiplication for Ring-LWE lattice cryptography","volume":"2018","author":"Seiler Gregor","year":"2018","journal-title":"IACR Cryptology ePrint Archive"}],"event":{"name":"CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security","location":"Virtual Event USA","acronym":"CCS '20","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3417894","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3372297.3417894","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:32Z","timestamp":1750197692000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3417894"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,30]]},"references-count":26,"alternative-id":["10.1145\/3372297.3417894","10.1145\/3372297"],"URL":"https:\/\/doi.org\/10.1145\/3372297.3417894","relation":{},"subject":[],"published":{"date-parts":[[2020,10,30]]},"assertion":[{"value":"2020-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}