8 search results - page 1 / 2 » Proving Tight Security for Rabin-Williams Signatures |
EUROCRYPT
2008
Springer
13 years 6 months ago
2008
Springer
This paper proves "tight security in the random-oracle model relative to factorization" for the lowest-cost signature systems available today: every hash-generic signatur...
CRYPTO
2009
Springer
13 years 11 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...
CRYPTO
2004
Springer
13 years 10 months ago
2004
Springer
Ordinarily, RSA and Rabin ciphertexts and signatures are log N bits, where N is a composite modulus; here, we describe how to “compress” Rabin ciphertexts and signatures (among...
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in g...
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
For the last two decades the notion and implementations of proxy signatures have been used to allow transfer of digital signing power within some context (in order to enable flexi...