Lecture notes in computer science

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

Shuichi Katsumata, Ryo Nishimaki, Shota Yamada, Takashi Yamakawa

Published Jan 1, 2021• 12 citations

Related papers

Efficient Round-Optimal Blind Signatures in the Standard Model

Essam Ghadafi

Round-Optimal Threshold Blind Signature from Lattices

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

Round-optimal Constant-size Blind Signatures

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

Efficient Round Optimal Blind Signatures

Sanjam Garg, Divya Gupta

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

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

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

Michele Ciampi, Pierpaolo Della Monica, Ivan Visconti