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

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

Michele Ciampi, Pierpaolo Della Monica, Ivan Visconti

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1007/978-3-032-35415-0_17

Related papers

Round Optimal Secure Multiparty Computation from Minimal Assumptions

Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal +2 more

Lecture notes in computer science•Jan 1, 2020•5 citations

Round-Optimal Blind Signatures in the Plain Model from Classical and Quantum Standard Assumptions

Shuichi Katsumata, Ryo Nishimaki, Shota Yamada +1 more

Lecture notes in computer science•Jan 1, 2021•12 citations

Efficient Round Optimal Blind Signatures

Sanjam Garg, Divya Gupta

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

Round-optimal Constant-size Blind Signatures

Olivier Blazy, Laura Brouilhet, Céline Chevalier +1 more

International Joint Conference on e-Business and Telecommunications (ICETE)•Jan 1, 2020•2 citations

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

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

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

•Jan 1, 2021•1 citation