188
click to vote
CRYPTO
15 years 8 months ago
2007 Springer 
We present as-strong-as-possible definitions of privacy, and constructions achieving them, for public-key encryption schemes where the encryption algorithm is deterministic. We ob...
158
click to vote
CRYPTO
15 years 10 months ago
2007 Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
101
click to vote
CRYPTO
15 years 10 months ago
2007 Springer
Wiener’s famous attack on RSA with d < N0.25 shows that using a small d for an efficient decryption process makes RSA completely insecure. As an alternative, Wiener proposed t...
134
Voted
CRYPTO
15 years 8 months ago
2007 Springer 
Abstract. Since Crypto 2004, hash functions have been the target of many attacks which showed that several well-known functions such as SHA-0 or MD5 can no longer be considered sec...
144
click to vote
CRYPTO
15 years 10 months ago
2007 Springer 
Consider a challenge-response protocol where the probability of a correct response is at least α for a legitimate user and at most β < α for an attacker. One example is a CAP...
|
Cryptology