2967 search results - page 588 / 594 » Cryptology |
CRYPTO
2004
Springer
15 years 3 months ago
2004
Springer
The most common method for computing exponentiation of random elements in Abelian groups are sliding window schemes, which enhance the efficiency of the binary method at the expens...
CRYPTO
2004
Springer
15 years 3 months ago
2004
Springer
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
EUROCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
We provide methods for transforming an encryption scheme susceptible to decryption errors into one that is immune to these errors. Immunity to decryption errors is vital when const...
EUROCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
EUROCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This work presents a new privacy primitive called “Traceable Signatures”, together with an efficient provably secure implementation. To this end, we develop the unde...