4 search results - page 1 / 1 » Round-Optimal Composable Blind Signatures in the Common Refe... |
CRYPTO
2006
Springer
13 years 8 months ago
2006
Springer
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
ASIACRYPT
2010
Springer
13 years 2 months ago
2010
Springer
sion of an extended abstract published in Proceedings of Asiacrypt 2010, Springer-Verlag, 2010. Available from the IACR Cryptology ePrint Archive as Report 2010/474. Beginning wit...
ASIACRYPT
2009
Springer
13 years 11 months ago
2009
Springer
A universally composable (UC) blind signature functionality requres users to commit to the message to be blindly signed. It is thereby impossible to realize in the plain model. Th...
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...