2 search results - page 1 / 1 » Digital Signatures from Strong RSA without Prime Generation |
126
click to vote
ASIACRYPT
2011
Springer
13 years 11 months ago
2011
Springer
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
DAM
2006
14 years 11 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-...