133 search results - page 4 / 27 » Fair Blind Signatures |
CRYPTO
2006
Springer
13 years 11 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, ...
IJIT
2004
13 years 8 months ago
2004
We present a new model for undeniable signatures: fair-anonymous undeniable signatures. This protocol can not only preserve the privacy of the signer (i.e. anonymity) but also trac...
PKC
2012
Springer
11 years 10 months ago
2012
Springer
We revisit the deļ¬nition of unforgeability of blind signatures as proposed by Pointcheval and Stern (Journal of Cryptology 2000). Surprisingly, we show that this established deļ¬...
IJNSEC
2008
13 years 7 months ago
2008
In 2003, Hwang et al. proposed a new blind signature based on the RSA cryptosystem by employing Extended Euclidean algorithm. They claimed that the proposed scheme was untraceable...
EUROCRYPT
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Known practical blind signature schemes whose security against adaptive and parallel attacks can be proven in the random oracle model either need ļ¬ve data exchanges bet...