30 search results - page 5 / 6 » pkc 2005 |
PKC
2005
Springer
13 years 10 months ago
2005
Springer
Coppersmith, Franklin, Patarin, and Reiter show that given two RSA cryptograms xe mod N and (ax + b)e mod N for known constants a, b ∈ ZN , one can compute x in O(e log2 e) ZN -o...
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...
PKC
2005
Springer
13 years 10 months ago
2005
Springer
We present an attack on DSA smart-cards which combines physical fault injection and lattice reduction techniques. This seems to be the first (publicly reported) physical experimen...
PKC
2009
Springer
14 years 5 months ago
2009
Springer
Sanitizable signature schemes, as defined by Ateniese et al. (ESORICS 2005), allow a signer to partly delegate signing rights to another party, called the sanitizer. That is, the s...
PKC
2012
Springer
11 years 7 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 ...