6 search results - page 1 / 2 » From Fixed-Length Messages to Arbitrary-Length Messages Prac... |
CTRSA
2001
Springer
13 years 9 months ago
2001
Springer
ASIACRYPT
2000
Springer
13 years 9 months ago
2000
Springer
A common practice for signing with RSA is to first apply a hash function or a redundancy function to the message, add some padding and exponentiate the resulting padded message us...
PKC
2005
Springer
13 years 10 months ago
2005
Springer
To sign with RSA, one usually encodes the message m as µ(m) and then raises the result to the private exponent modulo N. In Asiacrypt 2000, Coron et al. showed how to build a secu...
CHES
2009
Springer
14 years 5 months ago
2009
Springer
Fault attacks exploit hardware malfunctions to recover secrets from embedded electronic devices. In the late 90's, Boneh, DeMillo and Lipton [6] introduced fault-based attacks...
DAM
2006
13 years 4 months ago
2006
We propose the concept of fine-grained forward-secure signature schemes. Such signature schemes not only provide non-repudiation w.r.t. past time periods the way ordinary forward-...