15 search results - page 2 / 3 » Two efficient RSA multisignature schemes |
INFORMATICALT
2000
13 years 5 months ago
2000
Recently, Harn proposed an efficient scheme that can batch verification multiple RSA digital signatures. His scheme can reduce signature verification time. However, there is a weak...
ASIACRYPT
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, we propose a new approach for constructing selectively convertible undeniable signature schemes, and present two efficient schemes based on RSA. Our approach allows ...
WWW
2005
ACM
14 years 6 months ago
2005
ACM
A fair contract signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in a f...
DRM
2003
Springer
13 years 11 months ago
2003
Springer
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
EUROCRYPT
2010
Springer
13 years 6 months ago
2010
Springer
We investigate the possibility to prove security of the well-known blind signature schemes by Chaum, and by Pointcheval and Stern in the standard model, i.e., without random oracle...