5119 search results - page 684 / 1024 » Security Privacy |
153
click to vote
ACISP
2005
Springer
16 years 11 days ago
2005
Springer
We propose a key generation method for RSA moduli which allows the cost of the public operations (encryption/verifying) and the private operations (decryption/signing) to be balanc...
221
click to vote
ACISP
2005
Springer
16 years 11 days 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 ...
162
click to vote
ACISP
2005
Springer
16 years 11 days ago
2005
Springer
It is sometimes argued (as in [6]) that finding meaningful hash collisions might prove difficult. We show that at least one of the arguments involved is wrong, by showing that for...
166
click to vote
CCS
2005
ACM
16 years 11 days ago
2005
ACM
Since the remarkable work of Kocher [7], several papers considering different types of timing attacks have been published. In 2003, Brumley and Boneh presented a timing attack on...
145
click to vote
CCS
2005
ACM
16 years 11 days ago
2005
ACM
Simulatability constitutes the cryptographic notion of a secure refinement and has asserted its position as one of the fundamental concepts of modern cryptography. Although simula...