209 search results - page 17 / 42 » Secure Hash-and-Sign Signatures Without the Random Oracle |
149
click to vote
SCN
2010
Springer
15 years 4 months ago
2010
Springer
The Fiat-Shamir (FS) transform is a popular tool to produce particularly efficient digital signature schemes out of identification protocols. It is known that the resulting signat...
130
click to vote
CRYPTO
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. The Full Domain Hash (FDH) scheme is a RSA-based signature scheme in which the message is hashed onto the full domain of the RSA function. The FDH scheme is provably secu...
214
click to vote
ASIACRYPT
2011
Springer
14 years 5 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 ...
175
click to vote
ASIACRYPT
2000
Springer
15 years 10 months ago
2000
Springer
Assuming a cryptographically strong cyclic group G of prime order q and a random hash function H, we show that ElGamal encryption with an added Schnorr signature is secure against ...
202
click to vote
ACISP
2005
Springer
15 years 11 months ago
2005
Springer
A blind signature scheme is a protocol for obtaining a digital signature from a signer, but the signer can neither learn the messages he/she sign nor the signatures the recipients ...