INDOCRYPT
2009
Springer
13 years 11 months ago
2009
Springer
We present a second preimage attack on SHAMATA-512, which is a hash function of 512bit output and one of the first round candidates of the SHA-3 competition. The attack uses di...
INDOCRYPT
2009
Springer
13 years 11 months ago
2009
Springer
INDOCRYPT
2009
Springer
13 years 11 months ago
2009
Springer
This paper applies generalized birthday attacks to the FSB compression function, and shows how to adapt the attacks so that they run in far less memory. In particular, this paper p...
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that h...
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
Collusion-free protocols prevent subliminal communication (i.e., covert channels) between parties running the protocol. In the standard communication model, if one-way functions ex...
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
The well-studied task of learning a linear function with errors is a seemingly hard problem and the basis for several cryptographic schemes. Here we demonstrate additional applicat...
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer