7 search results - page 1 / 2 » Pseudorandom Functions and Permutations Provably Secure agai... |
CRYPTO
2010
Springer
13 years 6 months ago
2010
Springer
FSE
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. Bellare and Kohno introduced a formal framework for the study of related-key attacks against blockciphers. They established sufficient conditions (output-unpredictabilit...
CRYPTO
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. A cryptographic primitive is leakage-resilient, if it remains secure even if an adversary can learn a bounded amount of arbitrary information about the computation with e...
CRYPTO
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. The paradigms currently used to realize symmetric encryption schemes secure against adaptive chosen ciphertext attack (CCA) try to make it infeasible for an attacker to f...
ASIACRYPT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...