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

Lecture notes in computer science

Efficient Round Optimal Blind Signatures

Sanjam Garg, Divya Gupta

Published Jan 1, 2014• 45 citations
Publisher
DOI
10.1007/978-3-642-55220-5_27

Related papers

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

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

Shweta Agrawal, Damien Stehlé, Anshu Yadav

•Jan 1, 2021•1 citation

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

Shweta Agrawal, Elena Kirshanova, Damien Stehlé +1 more

•Jan 1, 2021•1 citation

Round-Optimal Composable Blind Signatures in the Common Reference String Model

Marc Fischlin

Lecture notes in computer science•Jan 1, 2006•163 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

Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures

Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon

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