241 search results - page 11 / 49 » Machine-Checked Security Proofs of Cryptographic Signature S... |
103
click to vote
JOC
2011
14 years 2 months ago
2011
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully s...
131
click to vote
AFRICACRYPT
2010
Springer
15 years 6 months ago
2010
Springer
A fair blind signature is a blind signature with revocable anonymity and unlinkability, i.e., an authority can link an issuing session to the resulting signature and trace a signat...
103
click to vote
TCC
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We show a new protocol for blind signatures in which security is preserved even under arbitrarily-many concurrent executions. The protocol can be based on standard crypto...
ASIACRYPT
2004
Springer
15 years 5 months ago
2004
Springer
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diï¬...
111
click to vote
PKC
2012
Springer
13 years 2 months ago
2012
Springer
ded abstract of this work will appear in Public Key Cryptography — PKC 2012. This is the full version. We propose a general framework that converts (ordinary) signature schemes ...