Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Can Round-Optimal Lattice-Based Blind Signatures be Practical?

Shweta Agrawal, Elena Kirshanova, Damien Stehlé, Anshu Yadav

Published Jan 1, 2021• 1 citation
OpenAlex

Related papers

Towards Practical and Round-Optimal Lattice-Based Threshold and Blind Signatures.

Shweta Agrawal, Damien Stehlé, Anshu Yadav

•Jan 1, 2021•1 citation

Round-Optimal Threshold Blind Signature from Lattices

Haoqi Zhang, Qi Li, Leo Yu Zhang +1 more

Lecture notes in computer science•Jan 1, 2026•0 citations

A New Framework for More Efficient Round-Optimal Lattice-Based (Partially) Blind Signature via Trapdoor Sampling

Rafaël del Pino, Shuichi Katsumata

Lecture notes in computer science•Jan 1, 2022•53 citations

Efficient Round Optimal Blind Signatures

Sanjam Garg, Divya Gupta

Lecture notes in computer science•Jan 1, 2014•45 citations

Round-optimal lattice-based threshold signatures, revisited

Shweta Agrawal, Damien Stehlé, Anshu Yadav

•Jan 1, 2022•2 citations

Round-Optimal GUC-Secure Blind Signatures From Minimal Computational and Setup Assumptions

Michele Ciampi, Pierpaolo Della Monica, Ivan Visconti

Lecture notes in computer science•Jan 1, 2026•0 citations