CRYPTO
2008
Springer
13 years 6 months ago
2008
Springer
We propose a family of compression functions built from fixed-key blockciphers and investigate their collision and preimage security in the ideal-cipher model. The constructions ha...
CRYPTO
2008
Springer
13 years 6 months ago
2008
Springer
We describe a public-key encryption system that remains secure even encrypting messages that depend on the secret keys in use. In particular, it remains secure under a "key cy...
CRYPTO
2008
Springer
13 years 6 months ago
2008
Springer
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...
CRYPTO
2008
Springer
13 years 6 months ago
2008
Springer
In this paper, we examine the resistance of the popular hash function SHA-1 and its predecessor SHA-0 against dedicated preimage attacks. In order to assess the security margin of ...
CRYPTO
2008
Springer
13 years 6 months ago
2008
Springer
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
CRYPTO
2008
Springer
13 years 6 months ago
2008
Springer
In this article, we analyze the security of the GOST hash function. The GOST hash function, defined in the Russian standard GOST 34.11-94, is an iterated hash function producing a ...
CRYPTO
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. This paper discusses key recovery and universal forgery attacks on several MAC algorithms based on universal hash functions. The attacks use a substantial number of verif...
CRYPTO
2008
Springer
13 years 6 months ago
2008
Springer
CRYPTO
2008
Springer
13 years 6 months ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
CRYPTO
2008
Springer
13 years 6 months ago
2008
Springer