Practical, Round-Optimal Lattice-Based Blind Signatures-Reference-Cited by-同舟云学术

Practical, Round-Optimal Lattice-Based Blind Signatures

Published:2022-11-07 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
language:
Short-container-title:

Author:

Agrawal Shweta¹,Kirshanova Elena²,Stehlé Damien³,Yadav Anshu¹

Affiliation:

1. IIT Madras, Chennai, India

2. I. Kant BFU & Technology Innovation Institute, Abu Dhabi, UAE

3. ENS de Lyon & Institut Universitaire de France, Lyon, France

Funder

DST "Swarnajayanti" fellowship

IndoFrench CEFIPRA project

ANR AMIRAL project

Young Russian Mathematics scholarship

Russian Science Foundation grant

National Blockchain Project

European Union Horizon 2020 Research and Innovation Program

BPI-France in the context of the national project RISQ

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3548606.3560650

Reference74 articles.

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.

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Security of Rate-limited Privacy Pass;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15

2. Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15

3. Threshold Lattice-Based Signature Scheme for Authentication by Wearable Devices;Cryptography;2023-07-04

4. Non-interactive Blind Signatures for Random Messages;Advances in Cryptology – EUROCRYPT 2023;2023

5. Spherical Gaussian Leftover Hash Lemma via the Rényi Divergence;Applied Cryptography and Network Security;2023