Luby-Rackoff Backwards Increasing An extended abstract appears in Advances in Cryptology - Eurocrypt 98...  Home/Search
Context
Related
| ucsd.edu/users/mihir/papers/p2f.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucdavis.edu/~rogaway/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We argue that the invertibility of a block cipher can reduce the security of schemes that use it, and a better starting point for scheme design is the non-invertible analog of a block cipher, that is, a pseudorandom function (PRF). Since a block cipher may be viewed as a pseudorandom permutation, we are led to investigate the reverse of the problem studied by Luby and Rackoff, and ask: "how can one transform a PRP into a PRF in as security-preserving a way as possible?" The solution we... (Update)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ increasing-extended,
author = "Luby-Rackoff Backwards Increasing",
title = "An extended appears in Advances in Cryptology -- Eurocrypt 98 Proceedings,
Lecture Notes in Computer Science Vol. 1403, K. Nyberg ed., Springer-Verlag,
1998. This is the full version.",
url = "citeseer.ist.psu.edu/766138.html" }
Citations (may not include all citations):419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986
278 Probabilistic encryption (context) - Goldwasser, Micali - 1984
241 Communication theory of secrecy systems (context) - Shannon - 1949
191 New hash functions and their use in authentication and set e.. (context) - Wegman, Carter - 1981
173 How to construct pseudorandom permutations from pseudorandom.. (context) - Luby, Rackoff - 1988
159 A concrete security treatment of symmetric encryption (context) - Bellare, Desai et al. - 1997
95 The security of cipher block chaining - Bellare, Kilian et al. - 1994
86 How to protect DES against exhaustive key search - Kilian, Rogaway - 1996
84 XOR MACs: New methods for message authentication using a fin.. (context) - Bellare, Gu'erin et al. - 1995
80 The first experimental cryptanalysis of the Data Encryption .. (context) - Matsui - 1994
77 the construction of pseudo-random permutations: LubyRackoff .. - Naor, Reingold - 1997
39 Pseudorandom functions revisited: The cascade construction a.. - Bellare, Canetti et al. - 1996
30 A construction of a cipher from a single pseudorandom permut.. - Even, Mansour - 1991
27 A simplified and generalized treatment of Luby-Rackoff pseud.. - Maurer - 1992
25 On fast and provably secure message authentication based on .. - Shoup - 1996
[Article contains additional citations not shown here]
Documents on the same site (http://www.cs.ucdavis.edu/~rogaway/papers/): More
On the Construction of Variable-Input-Length Ciphers - Bellare, Rogaway (1999) (Correct)
Authenticated Key Exchange Secure Against Dictionary Attacks - Bellare, Pointcheval.. (2000) (Correct)
Reconciling Two Views of Cryptography (The Computational.. - Abadi, Rogaway (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC