How to Enrich the Message Space of a Cipher
Thomas Ristenpart,Phillip Rogaway +1 more
- pp 101-118
TLDR
In this paper, a cipher e* = XLS[e,E] that can encipher messages of l + s bits for any s < n was constructed, and the construction works even in the tweakable and variable-input-length settings.Abstract:
Given (deterministic) ciphers e and E that can enciphermessages of l and n bits, respectively, we construct a cipher e* = XLS[e,E] that can encipher messages of l + s bits for any s < n Enciphering such a string will take one call to E and two calls to E We prove that e is a strong pseudorandom permutation as long as e and E are Our construction works even in the tweakable and VIL (variable-input-length) settings It makes use of a multipermutation (a pair of orthogonal Latin squares), a combinatorial object not previously used to get a provablesecurity resultread more
Citations
More filters
Book ChapterDOI
Parallelizable and Authenticated Online Ciphers
TL;DR: This work proposes the first parallelizable online cipher, COPE, which performs two calls to the underlying block cipher per plaintext block and is fully parallelizable in both encryption and decryption and extends COPE to create COPA, the first Parallelizable, online authenticated cipher with nonce-misuse resistance.
Posted Content
Parallelizable and Authenticated Online Ciphers.
TL;DR: COPE as mentioned in this paper is a parallelizable online authenticated cipher with nonce-misuse resistance, which performs two calls to the underlying block cipher per plaintext block and is fully parallelizable in both encryption and decryption.
Book ChapterDOI
Online ciphers from tweakable blockciphers
Phillip Rogaway,Haibin Zhang +1 more
TL;DR: This work simplifies and generalizes the work of Bellare, Boldyreva, Knudsen, and Namprempre, showing that online ciphers are rather trivially constructed from tweakable blockciphers, a notion of Liskov, Rivest, and Wagner.
Book ChapterDOI
The Mix-and-Cut Shuffle: Small-Domain Encryption Secure against N Queries
Thomas Ristenpart,Scott Yilek +1 more
TL;DR: A new shuffling algorithm, called Mix-and-Cut, is provided that provides a provably-secure block cipher even for adversaries that can observe the encryption of all N = 2 n domain points.
References
More filters
Journal ArticleDOI
How to construct pseudorandom permutations from pseudorandom functions
Michael Luby,Charles Rackoff +1 more
TL;DR: Any pseudorandom bit generator can be used to construct a block private key cryptos system which is secure against chosen plaintext attack, which is one of the strongest known attacks against a cryptosystem.
Journal Article
The security of triple encryption and a framework for code-based game-playing proofs
Mihir Bellare,Phillip Rogaway +1 more
TL;DR: It is demonstrated that for DES parameters (56-bit keys and 64-bit plaintexts) an adversary's maximal advantage against triple encryption is small until it asks about 278 queries.
Book ChapterDOI
The security of triple encryption and a framework for code-based game-playing proofs
Mihir Bellare,Phillip Rogaway +1 more
TL;DR: In this article, it was shown that triple encryption (the cascade of three independently-keyed blockciphers) is more secure than single or double encryption in the ideal-cipher model.
Book ChapterDOI
Tweakable Block Ciphers
TL;DR: The tweak serves much the same purpose that an initialization vector does for CBC mode or that a nonce does for OCB mode, and is brought down to the primitive block-cipher level, instead of incorporating it only at the higher modes-of-operation levels.
Journal ArticleDOI
On the Construction of Pseudorandom Permutations: Luby--Rackoff Revisited
Moni Naor,Omer Reingold +1 more
TL;DR: In this paper, the authors showed that two Feistel permutations are sufficient together with initial and final pairwise independent permutations for pseudorandom functions with small input-length and provided a framework in which similar constructions may be brought up and their security can be easily proved.