CRYPTO
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. In this paper, we study the existence of multicollisions in iterated hash functions. We show that finding multicollisions, i.e. r-tuples of messages that all hash to the...
CRYPTO
2004
Springer
14 years 4 months ago
2004
Springer
Many cryptographic primitives begin with parameter generation, which picks a primitive from a family. Such generation can use public coins (e.g., in the discrete-logarithm-based c...
CRYPTO
2004
Springer
14 years 4 months ago
2004
Springer
Recently proposed algebraic attacks [2, 6] and fast algebraic attacks [1, 5] have provided the best analyses against some deployed LFSR-based ciphers. The process complexity is exp...
CRYPTO
2004
Springer
14 years 4 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...
CRYPTO
2004
Springer
14 years 4 months ago
2004
Springer
Unconditionally secure multi-party computations in general, and broadcast in particular, are impossible if any third of the players can be actively corrupted and if no additional i...
CRYPTO
2004
Springer
14 years 4 months ago
2004
Springer
In a recent paper Dinur and Nissim considered a statistical database in which a trusted database administrator monitors queries and introduces noise to the responses with the goal ...
CRYPTO
2004
Springer
14 years 4 months ago
2004
Springer
CRYPTO
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. We introduce a compact and efficient representation of elements of the algebraic torus. This allows us to design a new discretelog based public-key system achieving the o...
CRYPTO
2004
Springer
14 years 4 months ago
2004
Springer
CRYPTO
2004
Springer
14 years 4 months ago
2004
Springer
In the bare public-key model (BPK in short), each verifier is assumed to have deposited a public key in a file that is accessible by all users at all times. In this model, intro...