Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model
From MaRDI portal
Publication:1801090
DOI10.1007/s10623-018-0471-8zbMath1442.94034OpenAlexW2791151657WikidataQ123202093 ScholiaQ123202093MaRDI QIDQ1801090
Publication date: 26 October 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: http://orbilu.uni.lu/handle/10993/35375
Related Items (4)
Luby-Rackoff backwards with more users and more security ⋮ Beyond birthday bound secure fresh rekeying: application to authenticated encryption ⋮ Just tweak! Asymptotically optimal security for the cascaded LRW1 tweakable blockcipher ⋮ TNT: how to tweak a block cipher
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A construction of a cipher from a single pseudorandom permutation.
- Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method
- Information-theoretic indistinguishability via the chi-squared method
- Insuperability of the standard versus ideal model gap for tweakable blockcipher security
- Analyzing multi-key security degradation
- A note on the chi-square method: a tool for proving cryptographic security
- How to decrypt or even substitute DES-encrypted messages in \(2^{28}\) steps.
- Connecting tweakable and multi-key blockcipher security
- Beyond-Birthday-Bound Security for Tweakable Even-Mansour Ciphers with Linear Tweak and Key Mixing
- Optimally Secure Block Ciphers from Ideal Primitives
- Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption
- Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
- XPX: Generalized Tweakable Even-Mansour with Improved Security Guarantees
- Parallelizable and Authenticated Online Ciphers
- Tweakable Blockciphers with Beyond Birthday-Bound Security
- Tweaks and Keys for Block Ciphers: The TWEAKEY Framework
- Security Analysis of Key-Alternating Feistel Ciphers
- Optimally Secure Tweakable Blockciphers
- On the Provable Security of the Iterated Even-Mansour Cipher Against Related-Key and Chosen-Key Attacks
- How to Build Fully Secure Tweakable Blockciphers from Classical Blockciphers
- Online Ciphers from Tweakable Blockciphers
- Beyond-Birthday-Bound Security Based on Tweakable Block Cipher
- Tweaking Even-Mansour Ciphers
- Multi-key Security: The Even-Mansour Construction Revisited
- The “Coefficients H” Technique
- Power of a Public Random Permutation and Its Application to Authenticated Encryption
- A General Construction of Tweakable Block Ciphers and Different Modes of Operations
- On Tweaking Luby-Rackoff Blockciphers
- Tight Security Bounds for Key-Alternating Ciphers
- Advances in Cryptology - CRYPTO 2003
- Improved Security Analysis of XEX and LRW Modes
- Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- Tweakable Pseudorandom Permutation from Generalized Feistel Structure
- Information Security and Cryptology - ICISC 2005
- Topics in Cryptology – CT-RSA 2004
This page was built for publication: Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model
