{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T06:44:03Z","timestamp":1770273843290,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":65,"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\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3560628","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"609-622","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Sharp"],"prefix":"10.1145","author":[{"given":"Geoffroy","family":"Couteau","sequence":"first","affiliation":[{"name":"CNRS, IRIF, Universit\u00e9 Paris Cit\u00e9, Paris, France"}]},{"given":"Dahmun","family":"Goudarzi","sequence":"additional","affiliation":[{"name":"Unaffiliated, Paris, France"}]},{"given":"Michael","family":"Kloo\u00df","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, KASTEL, Paris, France"}]},{"given":"Michael","family":"Reichle","sequence":"additional","affiliation":[{"name":"DIENS, \u00c9cole normale sup\u00e9rieure, PSL University, CNRS, INRIA, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15985-5_15"},{"key":"e_1_3_2_1_2_1","volume-title":"Lai","author":"Albrecht Martin R.","year":"2021","unstructured":"Martin R. Albrecht and Russell W. F . Lai . 2021 . Subtractive Sets over Cyclotomic Rings - Limits of Schnorr-Like Arguments over Lattices . 519--548. https:\/\/doi.org\/10.1007\/978-3-030-84245-1_18 10.1007\/978-3-030-84245-1_18 Martin R. Albrecht and Russell W. F. Lai. 2021. Subtractive Sets over Cyclotomic Rings - Limits of Schnorr-Like Arguments over Lattices. 519--548. https:\/\/doi.org\/10.1007\/978-3-030-84245-1_18"},{"key":"#cr-split#-e_1_3_2_1_3_1.1","doi-asserted-by":"crossref","unstructured":"Thomas Attema Ronald Cramer and Lisa Kohl. 2021. A Compressed {varSigma}-Protocol Theory for Lattices. 549--579. https:\/\/doi.org\/10.1007\/978-3-030-84245-1_19 10.1007\/978-3-030-84245-1_19","DOI":"10.1007\/978-3-030-84245-1_19"},{"key":"#cr-split#-e_1_3_2_1_3_1.2","doi-asserted-by":"crossref","unstructured":"Thomas Attema Ronald Cramer and Lisa Kohl. 2021. A Compressed {varSigma}-Protocol Theory for Lattices. 549--579. https:\/\/doi.org\/10.1007\/978-3-030-84245-1_19","DOI":"10.1007\/978-3-030-84245-1_19"},{"key":"#cr-split#-e_1_3_2_1_4_1.1","doi-asserted-by":"crossref","unstructured":"Foteini Baldimtsi and Anna Lysyanskaya. 2013. Anonymous credentials light. 1087--1098. https:\/\/doi.org\/10.1145\/2508859.2516687 10.1145\/2508859.2516687","DOI":"10.1145\/2508859.2516687"},{"key":"#cr-split#-e_1_3_2_1_4_1.2","doi-asserted-by":"crossref","unstructured":"Foteini Baldimtsi and Anna Lysyanskaya. 2013. Anonymous credentials light. 1087--1098. https:\/\/doi.org\/10.1145\/2508859.2516687","DOI":"10.1145\/2508859.2516687"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Carsten Baum Jonathan Bootle Andrea Cerulli Rafa\u00ebl del Pino Jens Groth and Vadim Lyubashevsky. 2018a. Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. 669--699. https:\/\/doi.org\/10.1007\/978-3-319-96881-0_23    10.1007\/978-3-319-96881-0_23\nCarsten Baum Jonathan Bootle Andrea Cerulli Rafa\u00ebl del Pino Jens Groth and Vadim Lyubashevsky. 2018a. Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. 669--699. https:\/\/doi.org\/10.1007\/978-3-319-96881-0_23","DOI":"10.1007\/978-3-319-96881-0_23"},{"key":"e_1_3_2_1_6_1","volume-title":"Vadim Lyubashevsky, Sabine Oechsner, and Chris Peikert.","author":"Baum Carsten","year":"2018","unstructured":"Carsten Baum , Ivan Damgr ard , Vadim Lyubashevsky, Sabine Oechsner, and Chris Peikert. 2018 b. More Efficient Commitments from Structured Lattice Assumptions . 368--385. https:\/\/doi.org\/10.1007\/978-3-319-98113-0_20 10.1007\/978-3-319-98113-0_20 Carsten Baum, Ivan Damgr ard, Vadim Lyubashevsky, Sabine Oechsner, and Chris Peikert. 2018b. More Efficient Commitments from Structured Lattice Assumptions. 368--385. https:\/\/doi.org\/10.1007\/978-3-319-98113-0_20"},{"key":"#cr-split#-e_1_3_2_1_7_1.1","doi-asserted-by":"crossref","unstructured":"Fabrice Benhamouda Stephan Krenn Vadim Lyubashevsky and Krzysztof Pietrzak. 2015. Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings. 305--325. https:\/\/doi.org\/10.1007\/978-3-319-24174-6_16 10.1007\/978-3-319-24174-6_16","DOI":"10.1007\/978-3-319-24174-6_16"},{"key":"#cr-split#-e_1_3_2_1_7_1.2","doi-asserted-by":"crossref","unstructured":"Fabrice Benhamouda Stephan Krenn Vadim Lyubashevsky and Krzysztof Pietrzak. 2015. Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings. 305--325. https:\/\/doi.org\/10.1007\/978-3-319-24174-6_16","DOI":"10.1007\/978-3-319-24174-6_16"},{"key":"#cr-split#-e_1_3_2_1_8_1.1","doi-asserted-by":"crossref","unstructured":"Johannes Bl\u00f6mer Jan Bobolz Denis Diemert and Fabian Eidens. 2019. Updatable Anonymous Credentials and Applications to Incentive Systems. 1671--1685. https:\/\/doi.org\/10.1145\/3319535.3354223 10.1145\/3319535.3354223","DOI":"10.1145\/3319535.3354223"},{"key":"#cr-split#-e_1_3_2_1_8_1.2","doi-asserted-by":"crossref","unstructured":"Johannes Bl\u00f6mer Jan Bobolz Denis Diemert and Fabian Eidens. 2019. Updatable Anonymous Credentials and Applications to Incentive Systems. 1671--1685. https:\/\/doi.org\/10.1145\/3319535.3354223","DOI":"10.1145\/3319535.3354223"},{"key":"#cr-split#-e_1_3_2_1_9_1.1","doi-asserted-by":"crossref","unstructured":"Jan Bobolz Fabian Eidens Stephan Krenn Daniel Slamanig and Christoph Striecks. 2020. Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection. 319--333. https:\/\/doi.org\/10.1145\/3320269.3384769 10.1145\/3320269.3384769","DOI":"10.1145\/3320269.3384769"},{"key":"#cr-split#-e_1_3_2_1_9_1.2","doi-asserted-by":"crossref","unstructured":"Jan Bobolz Fabian Eidens Stephan Krenn Daniel Slamanig and Christoph Striecks. 2020. Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection. 319--333. https:\/\/doi.org\/10.1145\/3320269.3384769","DOI":"10.1145\/3320269.3384769"},{"key":"#cr-split#-e_1_3_2_1_10_1.1","doi-asserted-by":"crossref","unstructured":"Fabrice Boudot. 2000. Efficient Proofs that a Committed Number Lies in an Interval. 431--444. https:\/\/doi.org\/10.1007\/3-540-45539-6_31 10.1007\/3-540-45539-6_31","DOI":"10.1007\/3-540-45539-6_31"},{"key":"#cr-split#-e_1_3_2_1_10_1.2","doi-asserted-by":"crossref","unstructured":"Fabrice Boudot. 2000. Efficient Proofs that a Committed Number Lies in an Interval. 431--444. https:\/\/doi.org\/10.1007\/3-540-45539-6_31","DOI":"10.1007\/3-540-45539-6_31"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/517876"},{"key":"e_1_3_2_1_12_1","volume-title":"Zether: Towards Privacy in a Smart Contract World. 423--443. https:\/\/doi.org\/10.1007\/978-3-030-51280-4_23","author":"B\u00fcnz Benedikt","year":"2020","unstructured":"Benedikt B\u00fcnz , Shashank Agrawal , Mahdi Zamani , and Dan Boneh . 2020 . Zether: Towards Privacy in a Smart Contract World. 423--443. https:\/\/doi.org\/10.1007\/978-3-030-51280-4_23 10.1007\/978-3-030-51280-4_23 Benedikt B\u00fcnz, Shashank Agrawal, Mahdi Zamani, and Dan Boneh. 2020. Zether: Towards Privacy in a Smart Contract World. 423--443. https:\/\/doi.org\/10.1007\/978-3-030-51280-4_23"},{"key":"e_1_3_2_1_13_1","volume-title":"Bulletproofs: Short Proofs for Confidential Transactions and More. 315--334. https:\/\/doi.org\/10.1109\/SP.2018.00020","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. 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. 315--334. https:\/\/doi.org\/10.1109\/SP.2018.00020"},{"key":"#cr-split#-e_1_3_2_1_14_1.1","doi-asserted-by":"crossref","unstructured":"Jan Camenisch Rafik Chaabouni and abhi shelat. 2008. Efficient Protocols for Set Membership and Range Proofs. 234--252. https:\/\/doi.org\/10.1007\/978-3-540-89255-7_15 10.1007\/978-3-540-89255-7_15","DOI":"10.1007\/978-3-540-89255-7_15"},{"key":"#cr-split#-e_1_3_2_1_14_1.2","doi-asserted-by":"crossref","unstructured":"Jan Camenisch Rafik Chaabouni and abhi shelat. 2008. Efficient Protocols for Set Membership and Range Proofs. 234--252. https:\/\/doi.org\/10.1007\/978-3-540-89255-7_15","DOI":"10.1007\/978-3-540-89255-7_15"},{"key":"#cr-split#-e_1_3_2_1_15_1.1","doi-asserted-by":"crossref","unstructured":"Jan Camenisch Susan Hohenberger and Anna Lysyanskaya. 2005. Compact E-Cash. 302--321. https:\/\/doi.org\/10.1007\/11426639_18 10.1007\/11426639_18","DOI":"10.1007\/11426639_18"},{"key":"#cr-split#-e_1_3_2_1_15_1.2","doi-asserted-by":"crossref","unstructured":"Jan Camenisch Susan Hohenberger and Anna Lysyanskaya. 2005. Compact E-Cash. 302--321. https:\/\/doi.org\/10.1007\/11426639_18","DOI":"10.1007\/11426639_18"},{"key":"#cr-split#-e_1_3_2_1_16_1.1","doi-asserted-by":"crossref","unstructured":"Jan Camenisch and Anna Lysyanskaya. 2001. An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation. 93--118. https:\/\/doi.org\/10.1007\/3-540-44987-6_7 10.1007\/3-540-44987-6_7","DOI":"10.1007\/3-540-44987-6_7"},{"key":"#cr-split#-e_1_3_2_1_16_1.2","doi-asserted-by":"crossref","unstructured":"Jan Camenisch and Anna Lysyanskaya. 2001. An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation. 93--118. https:\/\/doi.org\/10.1007\/3-540-44987-6_7","DOI":"10.1007\/3-540-44987-6_7"},{"key":"#cr-split#-e_1_3_2_1_17_1.1","doi-asserted-by":"crossref","unstructured":"Jan Camenisch and Anna Lysyanskaya. 2003. A Signature Scheme with Efficient Protocols. 268--289. https:\/\/doi.org\/10.1007\/3-540-36413-7_20 10.1007\/3-540-36413-7_20","DOI":"10.1007\/3-540-36413-7_20"},{"key":"#cr-split#-e_1_3_2_1_17_1.2","doi-asserted-by":"crossref","unstructured":"Jan Camenisch and Anna Lysyanskaya. 2003. A Signature Scheme with Efficient Protocols. 268--289. https:\/\/doi.org\/10.1007\/3-540-36413-7_20","DOI":"10.1007\/3-540-36413-7_20"},{"key":"#cr-split#-e_1_3_2_1_18_1.1","doi-asserted-by":"crossref","unstructured":"Melissa Chase Sarah Meiklejohn and Greg Zaverucha. 2014. Algebraic MACs and Keyed-Verification Anonymous Credentials. 1205--1216. https:\/\/doi.org\/10.1145\/2660267.2660328 10.1145\/2660267.2660328","DOI":"10.1145\/2660267.2660328"},{"key":"#cr-split#-e_1_3_2_1_18_1.2","doi-asserted-by":"crossref","unstructured":"Melissa Chase Sarah Meiklejohn and Greg Zaverucha. 2014. Algebraic MACs and Keyed-Verification Anonymous Credentials. 1205--1216. https:\/\/doi.org\/10.1145\/2660267.2660328","DOI":"10.1145\/2660267.2660328"},{"key":"#cr-split#-e_1_3_2_1_19_1.1","doi-asserted-by":"crossref","unstructured":"David Chaum. 1990. Showing Credentials without Identification Transferring Signatures between Unconditionally Unlinkable Pseudonyms. 246--264. https:\/\/doi.org\/10.1007\/BFb0030366 10.1007\/BFb0030366","DOI":"10.1007\/BFb0030366"},{"key":"#cr-split#-e_1_3_2_1_19_1.2","doi-asserted-by":"crossref","unstructured":"David Chaum. 1990. Showing Credentials without Identification Transferring Signatures between Unconditionally Unlinkable Pseudonyms. 246--264. https:\/\/doi.org\/10.1007\/BFb0030366","DOI":"10.1007\/BFb0030366"},{"key":"#cr-split#-e_1_3_2_1_20_1.1","doi-asserted-by":"crossref","unstructured":"Henry Corrigan-Gibbs and Dmitry Kogan. 2018. The Discrete-Logarithm Problem with Preprocessing. 415--447. https:\/\/doi.org\/10.1007\/978-3-319-78375-8_14 10.1007\/978-3-319-78375-8_14","DOI":"10.1007\/978-3-319-78375-8_14"},{"key":"#cr-split#-e_1_3_2_1_20_1.2","doi-asserted-by":"crossref","unstructured":"Henry Corrigan-Gibbs and Dmitry Kogan. 2018. The Discrete-Logarithm Problem with Preprocessing. 415--447. https:\/\/doi.org\/10.1007\/978-3-319-78375-8_14","DOI":"10.1007\/978-3-319-78375-8_14"},{"key":"e_1_3_2_1_21_1","volume-title":"Sharp: Short Relaxed Range Proofs. Cryptology ePrint Archive, Paper 2022\/1153. https:\/\/doi.org\/10.1145\/3548606.3560628 https:\/\/eprint.iacr.org\/2022\/1153.","author":"Couteau Geoffroy","year":"2022","unstructured":"Geoffroy Couteau , Dahmun Goudarzi , Michael Kloo\u00df , and Michael Reichle . 2022 . Sharp: Short Relaxed Range Proofs. Cryptology ePrint Archive, Paper 2022\/1153. https:\/\/doi.org\/10.1145\/3548606.3560628 https:\/\/eprint.iacr.org\/2022\/1153. 10.1145\/3548606.3560628 Geoffroy Couteau, Dahmun Goudarzi, Michael Kloo\u00df, and Michael Reichle. 2022. Sharp: Short Relaxed Range Proofs. Cryptology ePrint Archive, Paper 2022\/1153. https:\/\/doi.org\/10.1145\/3548606.3560628 https:\/\/eprint.iacr.org\/2022\/1153."},{"key":"#cr-split#-e_1_3_2_1_22_1.1","doi-asserted-by":"crossref","unstructured":"Geoffroy Couteau Michael Kloo\u00df Huang Lin and Michael Reichle. 2021. Efficient Range Proofs with Transparent Setup from Bounded Integer Commitments. 247--277. https:\/\/doi.org\/10.1007\/978-3-030-77883-5_9 10.1007\/978-3-030-77883-5_9","DOI":"10.1007\/978-3-030-77883-5_9"},{"key":"#cr-split#-e_1_3_2_1_22_1.2","doi-asserted-by":"crossref","unstructured":"Geoffroy Couteau Michael Kloo\u00df Huang Lin and Michael Reichle. 2021. Efficient Range Proofs with Transparent Setup from Bounded Integer Commitments. 247--277. https:\/\/doi.org\/10.1007\/978-3-030-77883-5_9","DOI":"10.1007\/978-3-030-77883-5_9"},{"key":"#cr-split#-e_1_3_2_1_23_1.1","doi-asserted-by":"crossref","unstructured":"Geoffroy Couteau Thomas Peters and David Pointcheval. 2017. Removing the Strong RSA Assumption from Arguments over the Integers. 321--350. https:\/\/doi.org\/10.1007\/978-3-319-56614-6_11 10.1007\/978-3-319-56614-6_11","DOI":"10.1007\/978-3-319-56614-6_11"},{"key":"#cr-split#-e_1_3_2_1_23_1.2","doi-asserted-by":"crossref","unstructured":"Geoffroy Couteau Thomas Peters and David Pointcheval. 2017. Removing the Strong RSA Assumption from Arguments over the Integers. 321--350. https:\/\/doi.org\/10.1007\/978-3-319-56614-6_11","DOI":"10.1007\/978-3-319-56614-6_11"},{"key":"#cr-split#-e_1_3_2_1_24_1.1","doi-asserted-by":"crossref","unstructured":"Geoffroy Couteau and Michael Reichle. 2019. Non-interactive Keyed-Verification Anonymous Credentials. 66--96. https:\/\/doi.org\/10.1007\/978-3-030-17253-4_3 10.1007\/978-3-030-17253-4_3","DOI":"10.1007\/978-3-030-17253-4_3"},{"key":"#cr-split#-e_1_3_2_1_24_1.2","doi-asserted-by":"crossref","unstructured":"Geoffroy Couteau and Michael Reichle. 2019. Non-interactive Keyed-Verification Anonymous Credentials. 66--96. https:\/\/doi.org\/10.1007\/978-3-030-17253-4_3","DOI":"10.1007\/978-3-030-17253-4_3"},{"key":"#cr-split#-e_1_3_2_1_25_1.1","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd and Eiichiro Fujisaki. 2002. A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order. 125--142. https:\/\/doi.org\/10.1007\/3-540-36178-2_8 10.1007\/3-540-36178-2_8","DOI":"10.1007\/3-540-36178-2_8"},{"key":"#cr-split#-e_1_3_2_1_25_1.2","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd and Eiichiro Fujisaki. 2002. A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order. 125--142. https:\/\/doi.org\/10.1007\/3-540-36178-2_8","DOI":"10.1007\/3-540-36178-2_8"},{"key":"e_1_3_2_1_27_1","unstructured":"The Zcash developers. 2022. Zcash. https:\/\/github.com\/zcash\/zcash.  The Zcash developers. 2022. Zcash. https:\/\/github.com\/zcash\/zcash."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Pierre-Alain Fouque Jacques Stern and Jan-Geert Wackers. 2003. CryptoComputing with Rationals. 136--146.  Pierre-Alain Fouque Jacques Stern and Jan-Geert Wackers. 2003. CryptoComputing with Rationals. 136--146.","DOI":"10.1007\/3-540-36504-4_10"},{"key":"#cr-split#-e_1_3_2_1_29_1.1","doi-asserted-by":"crossref","unstructured":"Eiichiro Fujisaki and Tatsuaki Okamoto. 1997. Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations. 16--30. https:\/\/doi.org\/10.1007\/BFb0052225 10.1007\/BFb0052225","DOI":"10.1007\/BFb0052225"},{"key":"#cr-split#-e_1_3_2_1_29_1.2","doi-asserted-by":"crossref","unstructured":"Eiichiro Fujisaki and Tatsuaki Okamoto. 1997. Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations. 16--30. https:\/\/doi.org\/10.1007\/BFb0052225","DOI":"10.1007\/BFb0052225"},{"key":"e_1_3_2_1_30_1","volume-title":"The Knowledge Complexity of Interactive Proof Systems","author":"Goldwasser Shafi","year":"1989","unstructured":"Shafi Goldwasser , Silvio Micali , and Charles Rackoff . 1989. The Knowledge Complexity of Interactive Proof Systems ., Vol. 18 , 1 ( 1989 ), 186--208. Shafi Goldwasser, Silvio Micali, and Charles Rackoff. 1989. The Knowledge Complexity of Interactive Proof Systems., Vol. 18, 1 (1989), 186--208."},{"key":"#cr-split#-e_1_3_2_1_31_1.1","doi-asserted-by":"crossref","unstructured":"Jens Groth. 2005. Non-interactive Zero-Knowledge Arguments for Voting. 467--482. https:\/\/doi.org\/10.1007\/11496137_32 10.1007\/11496137_32","DOI":"10.1007\/11496137_32"},{"key":"#cr-split#-e_1_3_2_1_31_1.2","doi-asserted-by":"crossref","unstructured":"Jens Groth. 2005. Non-interactive Zero-Knowledge Arguments for Voting. 467--482. https:\/\/doi.org\/10.1007\/11496137_32","DOI":"10.1007\/11496137_32"},{"key":"#cr-split#-e_1_3_2_1_32_1.1","doi-asserted-by":"crossref","unstructured":"Jens Groth. 2011. Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments. 431--448. https:\/\/doi.org\/10.1007\/978-3-642-25385-0_23 10.1007\/978-3-642-25385-0_23","DOI":"10.1007\/978-3-642-25385-0_23"},{"key":"#cr-split#-e_1_3_2_1_32_1.2","doi-asserted-by":"crossref","unstructured":"Jens Groth. 2011. Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments. 431--448. https:\/\/doi.org\/10.1007\/978-3-642-25385-0_23","DOI":"10.1007\/978-3-642-25385-0_23"},{"key":"e_1_3_2_1_33_1","volume-title":"BBA: Improving the Security and Applicability of Privacy-Preserving Point Collection. 1925--1942. https:\/\/doi.org\/10.1145\/3133956.3134071","author":"Hartung Gunnar","year":"2017","unstructured":"Gunnar Hartung , Max Hoffmann , Matthias Nagel , and Andy Rupp . 2017 . BBA: Improving the Security and Applicability of Privacy-Preserving Point Collection. 1925--1942. https:\/\/doi.org\/10.1145\/3133956.3134071 10.1145\/3133956.3134071 Gunnar Hartung, Max Hoffmann, Matthias Nagel, and Andy Rupp. 2017. BBA: Improving the Security and Applicability of Privacy-Preserving Point Collection. 1925--1942. https:\/\/doi.org\/10.1145\/3133956.3134071"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2020-0010"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2016-0016"},{"key":"#cr-split#-e_1_3_2_1_36_1.1","doi-asserted-by":"crossref","unstructured":"Helger Lipmaa. 2003. On Diophantine Complexity and Statistical Zero-Knowledge Arguments. 398--415. https:\/\/doi.org\/10.1007\/978-3-540-40061-5_26 10.1007\/978-3-540-40061-5_26","DOI":"10.1007\/978-3-540-40061-5_26"},{"key":"#cr-split#-e_1_3_2_1_36_1.2","doi-asserted-by":"crossref","unstructured":"Helger Lipmaa. 2003. On Diophantine Complexity and Statistical Zero-Knowledge Arguments. 398--415. https:\/\/doi.org\/10.1007\/978-3-540-40061-5_26","DOI":"10.1007\/978-3-540-40061-5_26"},{"key":"#cr-split#-e_1_3_2_1_37_1.1","doi-asserted-by":"crossref","unstructured":"Vadim Lyubashevsky. 2009. Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures. 598--616. https:\/\/doi.org\/10.1007\/978-3-642-10366-7_35 10.1007\/978-3-642-10366-7_35","DOI":"10.1007\/978-3-642-10366-7_35"},{"key":"#cr-split#-e_1_3_2_1_37_1.2","doi-asserted-by":"crossref","unstructured":"Vadim Lyubashevsky. 2009. Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures. 598--616. https:\/\/doi.org\/10.1007\/978-3-642-10366-7_35","DOI":"10.1007\/978-3-642-10366-7_35"},{"key":"e_1_3_2_1_38_1","volume-title":"Ngoc Khanh Nguyen, and Maxime Plancon","author":"Lyubashevsky Vadim","year":"2022","unstructured":"Vadim Lyubashevsky , Ngoc Khanh Nguyen, and Maxime Plancon . 2022 . Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler , and More General. In Advances in Cryptology -- CRYPTO 2022,, Yevgeniy Dodis and Thomas Shrimpton (Eds.). Springer Nature Switzerland . Vadim Lyubashevsky, Ngoc Khanh Nguyen, and Maxime Plancon. 2022. Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General. In Advances in Cryptology -- CRYPTO 2022,, Yevgeniy Dodis and Thomas Shrimpton (Eds.). Springer Nature Switzerland."},{"key":"e_1_3_2_1_39_1","volume-title":"Ngoc Khanh Nguyen, and Gregor Seiler","author":"Lyubashevsky Vadim","year":"2020","unstructured":"Vadim Lyubashevsky , Ngoc Khanh Nguyen, and Gregor Seiler . 2020 . Practical Lattice-Based Zero-Knowledge Proofs for Integer Relations . 1051--1070. https:\/\/doi.org\/10.1145\/3372297.3417894 10.1145\/3372297.3417894 Vadim Lyubashevsky, Ngoc Khanh Nguyen, and Gregor Seiler. 2020. Practical Lattice-Based Zero-Knowledge Proofs for Integer Relations. 1051--1070. https:\/\/doi.org\/10.1145\/3372297.3417894"},{"key":"#cr-split#-e_1_3_2_1_40_1.1","doi-asserted-by":"crossref","unstructured":"Torben P. Pedersen. 1992. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. 129--140. https:\/\/doi.org\/10.1007\/3-540-46766-1_9 10.1007\/3-540-46766-1_9","DOI":"10.1007\/3-540-46766-1_9"},{"key":"#cr-split#-e_1_3_2_1_40_1.2","doi-asserted-by":"crossref","unstructured":"Torben P. Pedersen. 1992. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. 129--140. https:\/\/doi.org\/10.1007\/3-540-46766-1_9","DOI":"10.1007\/3-540-46766-1_9"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Sietse Ringers Eric R. Verheul and Jaap-Henk Hoepman. 2017. An Efficient Self-blindable Attribute-Based Credential Scheme. 3--20.  Sietse Ringers Eric R. Verheul and Jaap-Henk Hoepman. 2017. An Efficient Self-blindable Attribute-Based Credential Scheme. 3--20.","DOI":"10.1007\/978-3-319-70972-7_1"},{"key":"e_1_3_2_1_42_1","unstructured":"The Monero Project. 2022. Monero. https:\/\/github.com\/monero-project\/monero.  The Monero Project. 2022. Monero. https:\/\/github.com\/monero-project\/monero."},{"key":"e_1_3_2_1_43_1","unstructured":"Pieter Wuille. 2018. libsecp256k1. https:\/\/github.com\/bitcoin\/secp256k1.  Pieter Wuille. 2018. libsecp256k1. https:\/\/github.com\/bitcoin\/secp256k1."}],"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.3560628","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560628","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:58Z","timestamp":1750182538000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560628"}},"subtitle":["Short Relaxed Range Proofs"],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":65,"alternative-id":["10.1145\/3548606.3560628","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3560628","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"}}]}}