See this document in CiteSeerX!

On the Construction of Variable-Input-Length Ciphers (1999)  (Make Corrections)  (18 citations)
Mihir Bellare, Phillip Rogaway
Lecture Notes in Computer Science



  Home/Search   Context   Related

 
View or download:
ucsd.edu/users/mihir/papers...lpe.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ucdavis.edu/~rogaway/papers/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: . Whereas a block cipher enciphers messages of some one particular length (the blocklength), a variable-input-length cipher takes messages of varying (and preferably arbitrary) lengths. Still, the length of the ciphertext must equal the length of the plaintext. This paper introduces the problem of constructing such objects, and provides a practical solution. Our VIL mode of operation makes a variable-input-length cipher from any block cipher. The method is demonstrably secure in the... (Update)

Context of citations to this paper:   More

...tag. It follows that the enciphering cannot meet the usual notion of semantic security [3, 14] nor any strong notion of authenticity [6, 7, 17]. Indeed the best one can hope for is that which is achievable by a deterministic, lengthpreserving, tweak depending...

Cited by:   More
Concrete Security Characterizations of PRFs and PRPs.. - Desai, Miner (2000)   (Correct)
Encode-then-encipher encryption: How to exploit nonces or.. - Bellare, Rogaway (2000)   (Correct)
A Tweakable Enciphering Mode - Halevi (2003)   (Correct)

Similar documents (at the sentence level):
9.0%:   On the Construction of Variable-Input-Length Ciphers - Bellare, Di Crescenzo, Rogaway (1998)   (Correct)

Active bibliography (related documents):   More   All
0.3:   An extended appears in Advances in Cryptology --.. - Luby-Rackoff..   (Correct)
0.3:   Luby-Rackoff Backwards: Increasing Security by Making.. - Bellare, Krovetz.. (1998)   (Correct)
0.3:   Building PRFs from PRPs - Hall, Wagner, Kelsey, Schneier (1998)   (Correct)

Similar documents based on text:   More   All
0.9:   Ciphers with Arbitrary Finite Domains - Black, Rogaway (2000)   (Correct)
0.6:   Authenticated Key Exchange Secure Against Dictionary Attacks - Bellare, Pointcheval.. (2000)   (Correct)
0.6:   Tweakable Enciphering Modes for Sector-Level Encryption - Halevi, Rogaway (2002)   (Correct)

Related documents from co-citation:   More   All
16:   How to construct pseudorandom permutations from pseudorandom functions (context) - Luby, Rackoff - 1988
13:   A concrete security treatment of symmetric encryption (context) - Bellare, Desai et al. - 1997
12:   The security of the cipher block chaining message authentication code - Bellare, Kilian et al. - 1994

BibTeX entry:   (Update)

M. Bellare and P. Rogaway, \On the construction of variable-input-length ciphers," Proceedings of the 6th Workshop on Fast Software Encryption, Ed. L.Knudsen, 1999. http://citeseer.ist.psu.edu/bellare99construction.html   More

@article{ bellare99construction,
    author = "Mihir Bellare and Phillip Rogaway",
    title = "On the Construction of Variable-Input-Length Ciphers",
    journal = "Lecture Notes in Computer Science",
    volume = "1636",
    pages = "231--244",
    year = "1999",
    url = "citeseer.ist.psu.edu/bellare99construction.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
202   Data encryption standard (context) - of, FIPS - 1977
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
77   the construction of pseudorandom permutations: Luby-Rackoff .. - Naor, Reingold - 1997
55   The notion of security for probabilistic cryptosystems (context) - Micali, Rackoff et al. - 1988
50   Two practical and provably secure block ciphers: BEAR and LI.. - Anderson, Biham - 1996
42   CBC MAC for real-time data sources - Petrank, Rackoff - 1997
42   All-or-nothing encryption and the package transform - Rivest - 1997
32   DES modes of operation (context) - of, FIPS - 1980
27   A simplified and generalized treatment of Luby-Rackoff pseud.. - Maurer - 1992
26   Information technology -- Security techniques -- Data integr.. (context) - IEC - 1994
24   How to construct pseudorandom permutations from single pseud.. (context) - Pieprzyk - 1990
16   Improved security bounds for pseudorandom permutations (context) - Patarin - 1997
7   A construction of a super-pseudorandom cipher (context) - Bleichenbacher, Desai - 1999
6   About Feistel schemes with six (or more) rounds (context) - Patarin - 1998
2   Impossibility results and optimality results on constructing.. (context) - Zheng, Matsumoto et al. - 1989



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.ucdavis.edu/~rogaway/papers/):   More
Authenticated Key Exchange Secure Against Dictionary Attacks - Bellare, Pointcheval.. (2000)   (Correct)
Reconciling Two Views of Cryptography (The Computational.. - Abadi, Rogaway (2000)   (Correct)
CBC MACs for Arbitrary-Length Messages: The Three-Key.. - Black, 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