18 search results - page 1 / 4 » A Practical and Tightly Secure Signature Scheme Without Hash... |
CTRSA
2007
Springer
14 years 5 months ago
2007
Springer
In 1999, two signature schemes based on the flexible RSA problem (a.k.a. strong RSA problem) were independently introduced: the Gennaro-Halevi-Rabin (GHR) signature scheme and the...
IACR
2011
12 years 10 months ago
2011
We present the hash-based signature scheme XMSS. It is the first provably (forward) secure and practical signature scheme with minimal security requirements: a pseudorandom and a ...
CRYPTO
2009
Springer
14 years 5 months ago
2009
Springer
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...
PKC
2007
Springer
14 years 5 months ago
2007
Springer
We provide a positive result about the Fiat-Shamir (FS) transform in the standard model, showing how to use it to convert threemove identification protocols into two-tier signatur...
CRYPTO
2005
Springer
14 years 4 months ago
2005
Springer
We investigate several previously suggested scenarios of instantiating random oracles (ROs) with “realizable” primitives in cryptographic schemes. As candidates for such “in...