1. 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.
2. 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.
3. Miklós Ajtai Ravi Kumar and Dandapani Sivakumar. 2001. A sieve algorithm for the shortest lattice vector problem. In STOC. Miklós Ajtai Ravi Kumar and Dandapani Sivakumar. 2001. A sieve algorithm for the shortest lattice vector problem. In STOC.
4. 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.
5. 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.