204 search results - page 13 / 41 » On Provably Secure Time-Stamping Schemes |
CRYPTO
2000
Springer
14 years 5 days 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...
ACNS
2005
Springer
14 years 1 months ago
2005
Springer
Amongst provably secure signature schemes, two distinct classes are of particular interest: the ones with tight reduction (e.g., RSA-PSS), and those which support the use of coupon...
JOC
2002
13 years 7 months ago
2002
We put forward a new method of constructing Fiat-Shamir-like signature schemes that yields better "exact security" than the original Fiat-Shamir method. (We also point o...
EUROCRYPT
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Multiparty signature protocols need protection against roguekey attacks, made possible whenever an adversary can choose its public key(s) arbitrarily. For many schemes, p...
INDOCRYPT
2003
Springer
14 years 1 months ago
2003
Springer
OMAC, TMAC and XCBC are CBC-type MAC schemes which are provably secure for arbitrary message length. In this paper, we present a more tight upper bound on Advmac for each scheme, w...