{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T11:38:26Z","timestamp":1776425906455,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":74,"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":"DST \"Swarnajayanti\" fellowship"},{"name":"IndoFrench CEFIPRA project"},{"name":"ANR AMIRAL project","award":["ANR-21-ASTR-0016"],"award-info":[{"award-number":["ANR-21-ASTR-0016"]}]},{"name":"Young Russian Mathematics scholarship"},{"name":"Russian Science Foundation grant","award":["N 22-41-04411"],"award-info":[{"award-number":["N 22-41-04411"]}]},{"name":"National Blockchain Project"},{"name":"European Union Horizon 2020 Research and Innovation Program","award":["Grant 780701"],"award-info":[{"award-number":["Grant 780701"]}]},{"name":"BPI-France in the context of the national project RISQ","award":["P141580"],"award-info":[{"award-number":["P141580"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3560650","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"39-53","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":51,"title":["Practical, Round-Optimal Lattice-Based Blind Signatures"],"prefix":"10.1145","author":[{"given":"Shweta","family":"Agrawal","sequence":"first","affiliation":[{"name":"IIT Madras, Chennai, India"}]},{"given":"Elena","family":"Kirshanova","sequence":"additional","affiliation":[{"name":"I. Kant BFU & Technology Innovation Institute, Abu Dhabi, UAE"}]},{"given":"Damien","family":"Stehl\u00e9","sequence":"additional","affiliation":[{"name":"ENS de Lyon & Institut Universitaire de France, Lyon, France"}]},{"given":"Anshu","family":"Yadav","sequence":"additional","affiliation":[{"name":"IIT Madras, Chennai, India"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Masayuki Abe. 2001. A secure three-move blind signature scheme for polynomially many signatures. In EUROCRYPT.  Masayuki Abe. 2001. A secure three-move blind signature scheme for polynomially many signatures. In EUROCRYPT."},{"key":"e_1_3_2_2_2_1","unstructured":"Shweta Agrawal Elena Kirshanova Damien Stehle and Anshu Yadav. 2021. Practical Round-Optimal Lattice-Based Blind Signatures. Cryptology ePrint Archive Paper 2021\/1565.  Shweta Agrawal Elena Kirshanova Damien Stehle and Anshu Yadav. 2021. Practical Round-Optimal Lattice-Based Blind Signatures. Cryptology ePrint Archive Paper 2021\/1565."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Mikl\u00f3s Ajtai Ravi Kumar and Dandapani Sivakumar. 2001. A sieve algorithm for the shortest lattice vector problem. In STOC.  Mikl\u00f3s Ajtai Ravi Kumar and Dandapani Sivakumar. 2001. A sieve algorithm for the shortest lattice vector problem. In STOC.","DOI":"10.1145\/380752.380857"},{"key":"e_1_3_2_2_4_1","volume-title":"Rachid El Bansarkhani, and Johannes Buchmann","author":"Alkadri Nabil Alkeilani","year":"2020","unstructured":"Nabil Alkeilani Alkadri , Rachid El Bansarkhani, and Johannes Buchmann . 2020 a. BLAZE : Practical Lattice-Based Blind Signatures for Privacy-Preserving Applications. In Financial Crypto . Nabil Alkeilani Alkadri, Rachid El Bansarkhani, and Johannes Buchmann. 2020a. BLAZE: Practical Lattice-Based Blind Signatures for Privacy-Preserving Applications. In Financial Crypto."},{"key":"e_1_3_2_2_5_1","volume-title":"Rachid El Bansarkhani, and Johannes Buchmann","author":"Alkadri Nabil Alkeilani","year":"2020","unstructured":"Nabil Alkeilani Alkadri , Rachid El Bansarkhani, and Johannes Buchmann . 2020 b. On Lattice-Based Interactive Protocols: An Approach with Less or No Aborts. In ACISP. Nabil Alkeilani Alkadri, Rachid El Bansarkhani, and Johannes Buchmann. 2020b. On Lattice-Based Interactive Protocols: An Approach with Less or No Aborts. In ACISP."},{"key":"e_1_3_2_2_6_1","volume-title":"P\u00f6 ppelmann, and P. Schwabe","author":"Alkim E.","year":"2016","unstructured":"E. Alkim , L. Ducas , T. P\u00f6 ppelmann, and P. Schwabe . 2016 . Post-quantum Key Exchange - A New Hope. In USENIX Security . E. Alkim, L. Ducas, T. P\u00f6 ppelmann, and P. Schwabe. 2016. Post-quantum Key Exchange - A New Hope. In USENIX Security."},{"key":"e_1_3_2_2_7_1","unstructured":"Abdelrahaman Aly Tomer Ashur Eli Ben-Sasson Siemen Dhooghe and Alan Szepieniec. 2020. Design of Symmetric-Key Primitives for Advanced Cryptographic Protocols. IACR Trans. Symmetric Cryptol. (2020).  Abdelrahaman Aly Tomer Ashur Eli Ben-Sasson Siemen Dhooghe and Alan Szepieniec. 2020. Design of Symmetric-Key Primitives for Advanced Cryptographic Protocols. IACR Trans. Symmetric Cryptol. (2020)."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134104"},{"key":"e_1_3_2_2_9_1","unstructured":"Roberto Avanzi Joppe Bos L\u00e9o Ducas Eike Kiltz Tancr\u00e8de Lepoint Vadim Lyubashevsky John M. Schanck Peter Schwabe Gregor Seiler and Damien Stehl\u00e9. 2017. CRYSTALS-Kyber: Algorithm Specifications And Supporting Documentation. https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/Round-1-Submissions.  Roberto Avanzi Joppe Bos L\u00e9o Ducas Eike Kiltz Tancr\u00e8de Lepoint Vadim Lyubashevsky John M. Schanck Peter Schwabe Gregor Seiler and Damien Stehl\u00e9. 2017. CRYSTALS-Kyber: Algorithm Specifications And Supporting Documentation. https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/Round-1-Submissions."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"L\u00e1szl\u00f3 Babai. 1985. On Lov\u00e1sz' Lattice Reduction and the Nearest Lattice Point Problem (Shortened Version). In STACS.  L\u00e1szl\u00f3 Babai. 1985. On Lov\u00e1sz' Lattice Reduction and the Nearest Lattice Point Problem (Shortened Version). In STACS.","DOI":"10.1007\/BFb0023990"},{"key":"e_1_3_2_2_11_1","volume-title":"Galbraith","author":"Bai Shi","year":"2014","unstructured":"Shi Bai and Steven D . Galbraith . 2014 . An Improved Compression Technique for Signatures Based on Learning with Errors. In CT-RSA. Shi Bai and Steven D. Galbraith. 2014. An Improved Compression Technique for Signatures Based on Learning with Errors. In CT-RSA."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Anja Becker L\u00e9o Ducas Nicolas Gama and Thijs Laarhoven. 2016. New Directions in Nearest Neighbor Searching with Applications to Lattice Sieving. In SODA.  Anja Becker L\u00e9o Ducas Nicolas Gama and Thijs Laarhoven. 2016. New Directions in Nearest Neighbor Searching with Applications to Lattice Sieving. In SODA.","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Mihir Bellare Chanathip Namprempre David Pointcheval and Michael Semanko. 2003. The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme. J. Cryptol. (2003).  Mihir Bellare Chanathip Namprempre David Pointcheval and Michael Semanko. 2003. The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme. J. Cryptol. (2003).","DOI":"10.1007\/s00145-002-0120-1"},{"key":"e_1_3_2_2_14_1","volume-title":"Ward","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. Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, and Nicholas P. Ward. 2019. Aurora: Transparent Succinct Arguments for R1CS. In EUROCRYPT."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Fabrice Benhamouda Tancr\u00e8 de Lepoint Julian Loss Michele Orr\u00f9 and Mariana Raykova. 2021. On the (in)security of ROS. In EUROCRYPT.  Fabrice Benhamouda Tancr\u00e8 de Lepoint Julian Loss Michele Orr\u00f9 and Mariana Raykova. 2021. On the (in)security of ROS. In EUROCRYPT.","DOI":"10.1007\/978-3-030-77870-5_2"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Olivier Blazy Philippe Gaborit Julien Schrek and Nicolas Sendrier. 2017. A code-based blind signature. In ISIT.  Olivier Blazy Philippe Gaborit Julien Schrek and Nicolas Sendrier. 2017. A code-based blind signature. In ISIT.","DOI":"10.1109\/ISIT.2017.8007023"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Alexandra Boldyreva. 2003. Threshold signatures multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme. In PKC.  Alexandra Boldyreva. 2003. Threshold signatures multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme. In PKC.","DOI":"10.1007\/3-540-36288-6_3"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Dan Boneh and David Mandell Freeman. 2011. Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures. In PKC.  Dan Boneh and David Mandell Freeman. 2011. Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures. In PKC.","DOI":"10.1007\/978-3-642-19379-8_1"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Dan Boneh Ben Lynn and Hovav Shacham. 2001. Short signatures from the Weil pairing. In ASIACRYPT.  Dan Boneh Ben Lynn and Hovav Shacham. 2001. Short signatures from the Weil pairing. In ASIACRYPT.","DOI":"10.1007\/3-540-45682-1_30"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Jonathan Bootle Vadim Lyubashevsky and Gregor Seiler. 2019. Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs. In CRYPTO.  Jonathan Bootle Vadim Lyubashevsky and Gregor Seiler. 2019. Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs. In CRYPTO.","DOI":"10.1007\/978-3-030-26948-7_7"},{"key":"e_1_3_2_2_21_1","unstructured":"Samuel Bouaziz-Ermann S\u00e9bastien Canard Gautier Eberhart Guillaume Kaim Adeline Roux-Langlois and Jacques Traor\u00e9. 2020. Lattice-based (Partially) Blind Signature without Restart. IACR Cryptol. ePrint Arch. (2020).  Samuel Bouaziz-Ermann S\u00e9bastien Canard Gautier Eberhart Guillaume Kaim Adeline Roux-Langlois and Jacques Traor\u00e9. 2020. Lattice-based (Partially) Blind Signature without Restart. IACR Cryptol. ePrint Arch. (2020)."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Zvika Brakerski Craig Gentry and Vinod Vaikuntanathan. 2012. (Leveled) fully homomorphic encryption without bootstrapping. In ITCS.  Zvika Brakerski Craig Gentry and Vinod Vaikuntanathan. 2012. (Leveled) fully homomorphic encryption without bootstrapping. In ITCS.","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"David Chaum. 1982. Blind Signatures for Untraceable Payments. In CRYPTO.  David Chaum. 1982. Blind Signatures for Untraceable Payments. In CRYPTO.","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"e_1_3_2_2_24_1","unstructured":"David Chaum and Torben Pryds Pedersen. 1992. Wallet databases with observers. In CRYPTO.  David Chaum and Torben Pryds Pedersen. 1992. Wallet databases with observers. In CRYPTO."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Nicolas T. Courtois Matthieu Finiasz and Nicolas Sendrier. 2001. How to Achieve a McEliece-Based Digital Signature Scheme. In ASIACRYPT.  Nicolas T. Courtois Matthieu Finiasz and Nicolas Sendrier. 2001. How to Achieve a McEliece-Based Digital Signature Scheme. In ASIACRYPT.","DOI":"10.1007\/3-540-45682-1_10"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Rafael del Pino and Shuichi Katsumata. 2022. A New Framework For More Efficient Round-Optimal Lattice-Based (Partially) Blind Signature via Trapdoor Sampling. In CRYPTO.  Rafael del Pino and Shuichi Katsumata. 2022. A New Framework For More Efficient Round-Optimal Lattice-Based (Partially) Blind Signature via Trapdoor Sampling. In CRYPTO.","DOI":"10.1007\/978-3-031-15979-4_11"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"David Derler Sebastian Ramacher and Daniel Slamanig. 2018. Post-Quantum Zero-Knowledge Proofs for Accumulators with Applications to Ring Signatures from Symmetric-Key Primitives. In PQCrypto.  David Derler Sebastian Ramacher and Daniel Slamanig. 2018. Post-Quantum Zero-Knowledge Proofs for Accumulators with Applications to Ring Signatures from Symmetric-Key Primitives. In PQCrypto.","DOI":"10.1007\/978-3-319-79063-3_20"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Emmanouil Doulgerakis Thijs Laarhoven and Benne de Weger. 2019. Finding Closest Lattice Vectors Using Approximate Voronoi Cells. In PQCrypto.  Emmanouil Doulgerakis Thijs Laarhoven and Benne de Weger. 2019. Finding Closest Lattice Vectors Using Approximate Voronoi Cells. In PQCrypto.","DOI":"10.1007\/978-3-030-25510-7_1"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","unstructured":"L\u00e9 o Ducas Eike Kiltz Tancr\u00e8 de Lepoint Vadim Lyubashevsky Peter Schwabe Gregor Seiler and Damien Stehl\u00e9. 2018. CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme. IACR Trans. Cryptogr. Hardw. Embed. Syst. (2018).  L\u00e9 o Ducas Eike Kiltz Tancr\u00e8 de Lepoint Vadim Lyubashevsky Peter Schwabe Gregor Seiler and Damien Stehl\u00e9. 2018. CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme. IACR Trans. Cryptogr. Hardw. Embed. Syst. (2018).","DOI":"10.46586\/tches.v2018.i1.238-268"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"L\u00e9o Ducas and Wessel van Woerden. 2021. NTRU Fatigue: How Stretched is Overstretched?. In ASIACRYPT.  L\u00e9o Ducas and Wessel van Woerden. 2021. NTRU Fatigue: How Stretched is Overstretched?. In ASIACRYPT.","DOI":"10.1007\/978-3-030-92068-5_1"},{"key":"e_1_3_2_2_31_1","volume-title":"Ngoc Khanh Nguyen, and Gregor Seiler","author":"Esgin Muhammed F.","year":"2020","unstructured":"Muhammed F. Esgin , Ngoc Khanh Nguyen, and Gregor Seiler . 2020 . Practical Exact Proofs from Lattices : New Techniques to Exploit Fully-Splitting Rings. In ASIACRYPT. Muhammed F. Esgin, Ngoc Khanh Nguyen, and Gregor Seiler. 2020. Practical Exact Proofs from Lattices: New Techniques to Exploit Fully-Splitting Rings. In ASIACRYPT."},{"key":"e_1_3_2_2_32_1","unstructured":"Muhammed F. Esgin Ron Steinfeld Dongxi Liu and Sushmita Ruj. 2022. Efficient Hybrid Exact\/Relaxed Lattice Proofs and Applications to Rounding and VRFs. IACR Cryptol. ePrint Arch. (2022).  Muhammed F. Esgin Ron Steinfeld Dongxi Liu and Sushmita Ruj. 2022. Efficient Hybrid Exact\/Relaxed Lattice Proofs and Applications to Rounding and VRFs. IACR Cryptol. ePrint Arch. (2022)."},{"key":"e_1_3_2_2_33_1","unstructured":"Muhammed F. Esgin Ron Steinfeld Amin Sakzad Joseph K. Liu and Dongxi Liu. 2019. Short Lattice-Based One-out-of-Many Proofs and Applications to Ring Signatures. In ACNS.  Muhammed F. Esgin Ron Steinfeld Amin Sakzad Joseph K. Liu and Dongxi Liu. 2019. Short Lattice-Based One-out-of-Many Proofs and Applications to Ring Signatures. In ACNS."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"crossref","unstructured":"Thomas Espitau Mehdi Tibouchi Alexandre Wallet and Tang Yu. 2022. Shorter Hash-and-Sign Lattice-Based Signatures. In CRYPTO.  Thomas Espitau Mehdi Tibouchi Alexandre Wallet and Tang Yu. 2022. Shorter Hash-and-Sign Lattice-Based Signatures. In CRYPTO.","DOI":"10.1007\/978-3-031-15979-4_9"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Marc Fischlin. 2006. Round-optimal composable blind signatures in the common reference string model. In CRYPTO.  Marc Fischlin. 2006. Round-optimal composable blind signatures in the common reference string model. In CRYPTO.","DOI":"10.1007\/11818175_4"},{"key":"e_1_3_2_2_36_1","volume-title":"Falcon: Fast-Fourier lattice-based compact signatures over NTRU. Technical Report. Specification","author":"Fouque Pierre-Alain","year":"2017","unstructured":"Pierre-Alain Fouque , Jeffrey Hoffstein , Paul Kirchner , Vadim Lyubashevsky , Thomas Pornin , Thomas Prest , Thomas Ricosset , Gregor Seiler , William Whyte , and Zhenfei Zhang . 2017 . Falcon: Fast-Fourier lattice-based compact signatures over NTRU. Technical Report. Specification available at https:\/\/falcon-sign.info\/. Pierre-Alain Fouque, Jeffrey Hoffstein, Paul Kirchner, Vadim Lyubashevsky, Thomas Pornin, Thomas Prest, Thomas Ricosset, Gregor Seiler, William Whyte, and Zhenfei Zhang. 2017. Falcon: Fast-Fourier lattice-based compact signatures over NTRU. Technical Report. Specification available at https:\/\/falcon-sign.info\/."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"crossref","unstructured":"Georg Fuchsbauer Antoine Plouviez and Yannick Seurin. 2020. Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model. In EUROCRYPT.  Georg Fuchsbauer Antoine Plouviez and Yannick Seurin. 2020. Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model. In EUROCRYPT.","DOI":"10.1007\/978-3-030-45724-2_3"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"crossref","unstructured":"Sanjam Garg and Divya Gupta. 2014. Efficient Round Optimal Blind Signatures. In EUROCRYPT.  Sanjam Garg and Divya Gupta. 2014. Efficient Round Optimal Blind Signatures. In EUROCRYPT.","DOI":"10.1007\/978-3-642-55220-5_27"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Sanjam Garg Vanishree Rao Amit Sahai Dominique Schr\u00f6der and Dominique Unruh. 2011. Round Optimal Blind Signatures. In CRYPTO.  Sanjam Garg Vanishree Rao Amit Sahai Dominique Schr\u00f6der and Dominique Unruh. 2011. Round Optimal Blind Signatures. In CRYPTO.","DOI":"10.1007\/978-3-642-22792-9_36"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"crossref","unstructured":"Craig Gentry Chris Peikert and Vinod Vaikuntanathan. 2008. Trapdoors for hard lattices and new cryptographic constructions. In STOC.  Craig Gentry Chris Peikert and Vinod Vaikuntanathan. 2008. Trapdoors for hard lattices and new cryptographic constructions. In STOC.","DOI":"10.1145\/1374376.1374407"},{"key":"e_1_3_2_2_41_1","volume-title":"Poseidon: A New Hash Function for Zero-Knowledge Proof Systems. In USENIX Security.","author":"Grassi Lorenzo","year":"2021","unstructured":"Lorenzo Grassi , Dmitry Khovratovich , Christian Rechberger , Arnab Roy , and Markus Schofnegger . 2021 . Poseidon: A New Hash Function for Zero-Knowledge Proof Systems. In USENIX Security. Lorenzo Grassi, Dmitry Khovratovich, Christian Rechberger, Arnab Roy, and Markus Schofnegger. 2021. Poseidon: A New Hash Function for Zero-Knowledge Proof Systems. In USENIX Security."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"crossref","unstructured":"Tim G\u00fc neysu Vadim Lyubashevsky and Thomas P\u00f6 ppelmann. 2012. Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems. In CHES.  Tim G\u00fc neysu Vadim Lyubashevsky and Thomas P\u00f6 ppelmann. 2012. Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems. In CHES.","DOI":"10.1007\/978-3-642-33027-8_31"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Guillaume Hanrot Xavier Pujol and Damien Stehl\u00e9. 2011. Analyzing Blockwise Lattice Algorithms Using Dynamical Systems. In CRYPTO.  Guillaume Hanrot Xavier Pujol and Damien Stehl\u00e9. 2011. Analyzing Blockwise Lattice Algorithms Using Dynamical Systems. In CRYPTO.","DOI":"10.1007\/978-3-642-22792-9_25"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"crossref","unstructured":"Eduard Hauck Eike Kiltz and Julian Loss. 2019. A modular treatment of blind signatures from identification schemes. In EUROCRYPT.  Eduard Hauck Eike Kiltz and Julian Loss. 2019. A modular treatment of blind signatures from identification schemes. In EUROCRYPT.","DOI":"10.1007\/978-3-030-17659-4_12"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Eduard Hauck Eike Kiltz Julian Loss and Ngoc Khanh Nguyen. 2020. Lattice-Based Blind Signatures Revisited. In CRYPTO.  Eduard Hauck Eike Kiltz Julian Loss and Ngoc Khanh Nguyen. 2020. Lattice-Based Blind Signatures Revisited. In CRYPTO.","DOI":"10.1007\/978-3-030-56880-1_18"},{"key":"e_1_3_2_2_46_1","unstructured":"Subariah Ibrahim Maznah Kamat Mazleena Salleh and Sh.R. Abdul Aziz. 2003. Secure E-voting with blind signature. In NCTT.  Subariah Ibrahim Maznah Kamat Mazleena Salleh and Sh.R. Abdul Aziz. 2003. Secure E-voting with blind signature. In NCTT."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"crossref","unstructured":"Ari Juels Michael Luby and Rafail Ostrovsky. 1997. Security of Blind Digital Signatures (Extended Abstract). In CRYPTO.  Ari Juels Michael Luby and Rafail Ostrovsky. 1997. Security of Blind Digital Signatures (Extended Abstract). In CRYPTO.","DOI":"10.1007\/BFb0052233"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"crossref","unstructured":"Julia Kastner Julian Loss and Jiayu Xu. 2022. On pairing-free blind signature schemes in the algebraic group model. In PKC.  Julia Kastner Julian Loss and Jiayu Xu. 2022. On pairing-free blind signature schemes in the algebraic group model. In PKC.","DOI":"10.1007\/978-3-030-97131-1_16"},{"key":"e_1_3_2_2_49_1","unstructured":"Philip N. Klein. 2000. Finding the closest lattice vector when it's unusually close. In SODA.  Philip N. Klein. 2000. Finding the closest lattice vector when it's unusually close. In SODA."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"crossref","unstructured":"Adeline Langlois and Damien Stehl\u00e9. 2015. Worst-case to average-case reductions for module lattices. Des. Codes Cryptogr. (2015).  Adeline Langlois and Damien Stehl\u00e9. 2015. Worst-case to average-case reductions for module lattices. Des. Codes Cryptogr. (2015).","DOI":"10.1007\/s10623-014-9938-4"},{"key":"e_1_3_2_2_51_1","volume-title":"Minh Kim Bui, and Dung Hoang Duong.","author":"Le Huy Quoc","year":"2019","unstructured":"Huy Quoc Le , Willy Susilo , Thanh Xuan Khuc , Minh Kim Bui, and Dung Hoang Duong. 2019 . A Blind Signature from Module Lattices. In DSC. Huy Quoc Le, Willy Susilo, Thanh Xuan Khuc, Minh Kim Bui, and Dung Hoang Duong. 2019. A Blind Signature from Module Lattices. In DSC."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"crossref","unstructured":"San Ling Khoa Nguyen Damien Stehl\u00e9 and Huaxiong Wang. 2013. Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem and Applications. In PKC.  San Ling Khoa Nguyen Damien Stehl\u00e9 and Huaxiong Wang. 2013. Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem and Applications. In PKC.","DOI":"10.1007\/978-3-642-36362-7_8"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"crossref","unstructured":"Vadim Lyubashevsky. 2012. Lattice Signatures without Trapdoors. In EUROCRYPT.  Vadim Lyubashevsky. 2012. Lattice Signatures without Trapdoors. In EUROCRYPT.","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"e_1_3_2_2_54_1","volume-title":"Ngoc Khanh Nguyen, and Maxime Planccon","author":"Lyubashevsky Vadim","year":"2022","unstructured":"Vadim Lyubashevsky , Ngoc Khanh Nguyen, and Maxime Planccon . 2022 a. Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures. In PKC. Vadim Lyubashevsky, Ngoc Khanh Nguyen, and Maxime Planccon. 2022a. Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures. In PKC."},{"key":"e_1_3_2_2_55_1","volume-title":"Ngoc Khanh Nguyen, and Maxime Planccon","author":"Lyubashevsky Vadim","year":"2022","unstructured":"Vadim Lyubashevsky , Ngoc Khanh Nguyen, and Maxime Planccon . 2022 b. Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler , and More General. In CRYPTO. Vadim Lyubashevsky, Ngoc Khanh Nguyen, and Maxime Planccon. 2022b. Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General. In CRYPTO."},{"key":"e_1_3_2_2_56_1","volume-title":"Maxime Planccon, and Gregor Seiler.","author":"Lyubashevsky Vadim","year":"2021","unstructured":"Vadim Lyubashevsky , Ngoc Khanh Nguyen , Maxime Planccon, and Gregor Seiler. 2021 b. Shorter Lattice-Based Group Signatures via \u201cAlmost Free\u201d Encryption and Other Optimizations. In ASIACRYPT. Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Planccon, and Gregor Seiler. 2021b. Shorter Lattice-Based Group Signatures via \u201cAlmost Free\u201d Encryption and Other Optimizations. In ASIACRYPT."},{"key":"e_1_3_2_2_57_1","volume-title":"Ngoc Khanh Nguyen, and Gregor Seiler","author":"Lyubashevsky Vadim","year":"2021","unstructured":"Vadim Lyubashevsky , Ngoc Khanh Nguyen, and Gregor Seiler . 2021 a. Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments. In PKC. Vadim Lyubashevsky, Ngoc Khanh Nguyen, and Gregor Seiler. 2021a. Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments. In PKC."},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"crossref","unstructured":"Vadim Lyubashevsky Adriana Palacio and Gil Segev. 2010a. Public-Key Cryptographic Primitives Provably as Secure as Subset Sum. In TCC.  Vadim Lyubashevsky Adriana Palacio and Gil Segev. 2010a. Public-Key Cryptographic Primitives Provably as Secure as Subset Sum. In TCC.","DOI":"10.1007\/978-3-642-11799-2_23"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"crossref","unstructured":"Vadim Lyubashevsky Chris Peikert and Oded Regev. 2010b. On Ideal Lattices and Learning with Errors over Rings. In EUROCRYPT.  Vadim Lyubashevsky Chris Peikert and Oded Regev. 2010b. On Ideal Lattices and Learning with Errors over Rings. In EUROCRYPT.","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"e_1_3_2_2_60_1","volume-title":"Complexity of lattice problems - a cryptographic perspective","author":"Micciancio Daniele","unstructured":"Daniele Micciancio and Shafi Goldwasser . 2002. Complexity of lattice problems - a cryptographic perspective . Springer . Daniele Micciancio and Shafi Goldwasser. 2002. Complexity of lattice problems - a cryptographic perspective. Springer."},{"key":"e_1_3_2_2_61_1","volume-title":"Nguy\u00ean and Thomas Vidick","author":"Phong","year":"2008","unstructured":"Phong Q. Nguy\u00ean and Thomas Vidick . 2008 . Sieve algorithms for the shortest vector problem are practical. Journal of Mathematical Cryptology ( 2008). Phong Q. Nguy\u00ean and Thomas Vidick. 2008. Sieve algorithms for the shortest vector problem are practical. Journal of Mathematical Cryptology (2008)."},{"key":"e_1_3_2_2_62_1","unstructured":"Miyako Ohkubo and Masayuki Abe. 2003. Security of Some Three-move Blind Signature Schemes Reconsidered. In SCIS.  Miyako Ohkubo and Masayuki Abe. 2003. Security of Some Three-move Blind Signature Schemes Reconsidered. In SCIS."},{"key":"e_1_3_2_2_63_1","unstructured":"Tatsuaki Okamoto. 1992. Provably secure and practical identification schemes and corresponding signature schemes. In CRYPTO.  Tatsuaki Okamoto. 1992. Provably secure and practical identification schemes and corresponding signature schemes. In CRYPTO."},{"key":"e_1_3_2_2_64_1","volume-title":"Leakage-resilient lattice-based partially blind signatures. IET Information Security","author":"Papachristoudis Dimitrios","year":"2019","unstructured":"Dimitrios Papachristoudis , Dimitrios Hristu-Varsakelis , Foteini Baldimtsi , and George Stephanides . 2019. Leakage-resilient lattice-based partially blind signatures. IET Information Security ( 2019 ). Dimitrios Papachristoudis, Dimitrios Hristu-Varsakelis, Foteini Baldimtsi, and George Stephanides. 2019. Leakage-resilient lattice-based partially blind signatures. IET Information Security (2019)."},{"key":"e_1_3_2_2_65_1","doi-asserted-by":"crossref","unstructured":"Albrecht Petzoldt Alan Szepieniec and Mohamed Saied Emam Mohamed. 2017. A Practical Multivariate Blind Signature Scheme. In Financial Crypto.  Albrecht Petzoldt Alan Szepieniec and Mohamed Saied Emam Mohamed. 2017. A Practical Multivariate Blind Signature Scheme. In Financial Crypto.","DOI":"10.1007\/978-3-319-70972-7_25"},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"crossref","unstructured":"David Pointcheval and Jacques Stern. 2000. Security Arguments for Digital Signatures and Blind Signatures. J. Cryptol. (2000).  David Pointcheval and Jacques Stern. 2000. Security Arguments for Digital Signatures and Blind Signatures. J. Cryptol. (2000).","DOI":"10.1007\/s001450010003"},{"key":"e_1_3_2_2_67_1","volume-title":"On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM (JACM)","author":"Regev Oded","year":"2009","unstructured":"Oded Regev . 2009. On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM (JACM) ( 2009 ). Oded Regev. 2009. On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM (JACM) (2009)."},{"key":"e_1_3_2_2_68_1","doi-asserted-by":"crossref","unstructured":"Markus R\u00fcckert. 2010. Lattice-Based Blind Signatures. In ASIACRYPT.  Markus R\u00fcckert. 2010. Lattice-Based Blind Signatures. In ASIACRYPT.","DOI":"10.1007\/978-3-642-17373-8_24"},{"key":"e_1_3_2_2_69_1","doi-asserted-by":"crossref","unstructured":"C.-P. Schnorr and M. Euchner. 1994. Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems. Math. Program. (1994).  C.-P. Schnorr and M. Euchner. 1994. Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems. Math. Program. (1994).","DOI":"10.1007\/BF01581144"},{"key":"e_1_3_2_2_70_1","doi-asserted-by":"crossref","unstructured":"Damien Stehl\u00e9 Ron Steinfeld Keisuke Tanaka and Keita Xagawa. 2009. Efficient Public Key Encryption Based on Ideal Lattices. In ASIACRYPT.  Damien Stehl\u00e9 Ron Steinfeld Keisuke Tanaka and Keita Xagawa. 2009. Efficient Public Key Encryption Based on Ideal Lattices. In ASIACRYPT.","DOI":"10.1007\/978-3-642-10366-7_36"},{"key":"e_1_3_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556672"},{"key":"e_1_3_2_2_72_1","doi-asserted-by":"crossref","unstructured":"Stefano Tessaro and Chenzhi Zhu. 2022. Short Pairing-Free Blind Signatures with Exponential Security. IACR Cryptol. ePrint Arch. (2022).  Stefano Tessaro and Chenzhi Zhu. 2022. Short Pairing-Free Blind Signatures with Exponential Security. IACR Cryptol. ePrint Arch. (2022).","DOI":"10.1007\/978-3-031-07085-3_27"},{"key":"e_1_3_2_2_73_1","volume-title":"Zhenfei Zhang, Qiuliang Xu, Zuoxia Yu, and William Whyte.","author":"Yang Rupeng","year":"2019","unstructured":"Rupeng Yang , Man Ho Au , Zhenfei Zhang, Qiuliang Xu, Zuoxia Yu, and William Whyte. 2019 . Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness : Construction and Applications. In CRYPTO. Rupeng Yang, Man Ho Au, Zhenfei Zhang, Qiuliang Xu, Zuoxia Yu, and William Whyte. 2019. Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications. In CRYPTO."},{"key":"e_1_3_2_2_74_1","doi-asserted-by":"crossref","unstructured":"Xun Yi and Kwok-Yan Lam. 2019. A new blind ECDSA scheme for bitcoin transaction anonymity. In Asia-CCS.  Xun Yi and Kwok-Yan Lam. 2019. A new blind ECDSA scheme for bitcoin transaction anonymity. In Asia-CCS.","DOI":"10.1145\/3321705.3329816"}],"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.3560650","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560650","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.3560650"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":74,"alternative-id":["10.1145\/3548606.3560650","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3560650","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"}}]}}