Tight security of cascaded LRW2
From MaRDI portal
Publication:2188969
DOI10.1007/s00145-020-09347-yzbMath1457.94141OpenAlexW3009811602MaRDI QIDQ2188969
Publication date: 15 June 2020
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-020-09347-y
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Related Items (8)
Proof of mirror theory for a wide range of \(\xi_{\max }\) ⋮ A modular approach to the security analysis of two-permutation constructions ⋮ Improved multi-user security using the squared-ratio method ⋮ Categorization of faulty nonce misuse resistant message authentication ⋮ Towards closing the security gap of Tweak-aNd-Tweak (TNT) ⋮ How to build optimally secure PRFs using block ciphers ⋮ 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
- Tweakable block ciphers
- \textsc{POEx}: a beyond-birthday-bound-secure on-line cipher
- Bucket hashing and its application to fast message authentication
- Towards tight security of cascaded LRW2
- Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model
- ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls
- Generic attacks against beyond-birthday-bound MACs
- Encrypt or decrypt -- to make a single-key beyond birthday secure nonce-based MAC
- ZMAC: a fast tweakable block cipher mode for highly secure message authentication
- Information-theoretic indistinguishability via the chi-squared method
- Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
- Mirror theory and cryptography
- Blockcipher-based MACs: beyond the birthday bound without message length
- Tweakable HCTR: a BBB secure tweakable enciphering scheme
- On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers
- Parallelizable MACs based on the sum of PRPs with security beyond the birthday bound
- Beyond birthday bound secure MAC in faulty nonce model
- XHX -- a framework for optimally secure tweakable block ciphers from classical block ciphers and universal hashing
- Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption
- The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
- Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
- Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers
- A Modular Framework for Building Variable-Input-Length Tweakable Ciphers
- Parallelizable and Authenticated Online Ciphers
- Foiling Birthday Attacks in Length-Doubling Transformations
- Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
- Tweakable Blockciphers with Beyond Birthday-Bound Security
- Tweaks and Keys for Block Ciphers: The TWEAKEY Framework
- Tweakable Blockciphers with Asymptotically Optimal Security
- Optimally Secure Tweakable Blockciphers
- Robust Authenticated-Encryption AEZ and the Problem That It Solves
- How to Build Fully Secure Tweakable Blockciphers from Classical Blockciphers
- Feistel Ciphers
- Revisiting Full-PRF-Secure PMAC and Using It for Beyond-Birthday Authenticated Encryption
- The Software Performance of Authenticated-Encryption Modes
- Online Ciphers from Tweakable Blockciphers
- Beyond-Birthday-Bound Security Based on Tweakable Block Cipher
- Tweaking Even-Mansour Ciphers
- Tweak-Length Extension for Tweakable Blockciphers
- Full PRF-Secure Message Authentication Code Based on Tweakable Block Cipher
- A Proof of Security in O(2 n ) for the Benes Scheme
- A General Construction of Tweakable Block Ciphers and Different Modes of Operations
- A New Variant of PMAC: Beyond the Birthday Bound
- Improved Security Analysis of XEX and LRW Modes
- Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
- The Multi-user Security of Double Encryption
- Information Security and Cryptology - ICISC 2005
This page was built for publication: Tight security of cascaded LRW2
