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 Composable Blind Signatures in the Common Reference String Model

Marc Fischlin

Published Jan 1, 2006• 163 citations
Publisher
DOI
10.1007/11818175_4

Related papers

A note on universal composable zero-knowledge in the common reference string model

Andrew Chi-Chih Yao, Frances Yao, Yunlei Zhao

Theoretical Computer Science•Nov 7, 2008•12 citations

A Note on Universal Composable Zero Knowledge in Common Reference String Model

Andrew Chi-Chih Yao, Frances Yao, Yunlei Zhao

Springer eBooks•Jul 22, 2007•2 citations

Efficient Round Optimal Blind Signatures

Sanjam Garg, Divya Gupta

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

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 Framework for Universally Composable Non-committing Blind Signatures

Masayuki Abe, Miyako Ohkubo

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