278 search results - page 31 / 56 » On the Security of RSA Padding |
FCS
2006
14 years 11 months ago
2006
A computational grid is a large-scale distributed computing environment capable of providing dependable, consistent, pervasive, and inexpensive access to high-end computational re...
117
click to vote
EUROCRYPT
2010
Springer
14 years 10 months ago
2010
Springer
We investigate the possibility to prove security of the well-known blind signature schemes by Chaum, and by Pointcheval and Stern in the standard model, i.e., without random oracle...
WCC
2005
Springer
15 years 3 months ago
2005
Springer
The security of the RSA public key cryptosystem depends on the intractability of the integer factoring problem. This paper shall give some theoretical support to the assumption of ...
CRYPTO
2004
Springer
15 years 3 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...
IJIT
2004
14 years 11 months ago
2004
We present a new model for undeniable signatures: fair-anonymous undeniable signatures. This protocol can not only preserve the privacy of the signer (i.e. anonymity) but also trac...