Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers

DOI10.1007/978-3-662-53018-4_2zbMath1351.94063OpenAlexW2406798186MaRDI QIDQ2835582

Thomas Peyrin, Yannick Seurin

Publication date: 30 November 2016

Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53018-4_2

zbMATH Keywords

authenticated encryptiontweakable block cipherCAESAR competitionbeyond-birthday-bound securitynonce-misuse resistance

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (23)

Towards tight security of cascaded LRW2 ⋮ Incremental cryptography revisited: PRFs, nonces and modular design ⋮ Pholkos -- efficient large-state tweakable block ciphers from the AES round function ⋮ Connecting tweakable and multi-key blockcipher security ⋮ Tight security of cascaded LRW2 ⋮ Toward a fully secure authenticated encryption scheme from a pseudorandom permutation ⋮ Overloading the nonce: rugged PRPs, nonce-set AEAD, and order-resilient channels ⋮ Offset-based BBB-secure tweakable block-ciphers with updatable caches ⋮ Implicit key-stretching security of encryption schemes ⋮ Towards closing the security gap of Tweak-aNd-Tweak (TNT) ⋮ Minimizing the two-round tweakable Even-Mansour cipher ⋮ Beyond birthday bound secure fresh rekeying: application to authenticated encryption ⋮ Impossible-Differential and Boomerang Cryptanalysis of Round-Reduced Kiasu-BC ⋮ Revisiting Full-PRF-Secure PMAC and Using It for Beyond-Birthday Authenticated Encryption ⋮ The design and evolution of OCB ⋮ The \texttt{Deoxys} AEAD family ⋮ Efficient Beyond-Birthday-Bound-Secure Deterministic Authenticated Encryption with Minimal Stretch ⋮ Impossible Differential Cryptanalysis of Reduced-Round SKINNY ⋮ The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS ⋮ Beyond conventional security in sponge-based authenticated encryption modes ⋮ Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers ⋮ Alzette: a 64-bit ARX-boxes (feat. CRAX and TRAX) ⋮ IQRA: Incremental Quadratic Re-keying friendly Authentication scheme

Uses Software

• Skein Hash
• McOE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Encryption modes with almost free message integrity
• New hash functions and their use in authentication and set equality
• Characterization of security notions for probabilistic private-key encryption
• 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
• Tweakable Blockciphers with Beyond Birthday-Bound Security
• Tweaks and Keys for Block Ciphers: The TWEAKEY Framework
• How to Securely Release Unverified Plaintext in Authenticated Encryption
• Tweakable Blockciphers with Asymptotically Optimal Security
• Pipelineable On-line Encryption
• The Indistinguishability of the XOR of $$k$$ Permutations
• Optimally Secure Tweakable Blockciphers
• Robust Authenticated-Encryption AEZ and the Problem That It Solves
• Domain Extension for MACs Beyond the Birthday Barrier
• The Software Performance of Authenticated-Encryption Modes
• Fast Encryption and Authentication: XCBC Encryption and XECB Authentication Modes
• Beyond-Birthday-Bound Security Based on Tweakable Block Cipher
• On Fast and Provably Secure Message Authentication Based on Universal Hashing
• Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance
• Authenticated Encryption Mode for Beyond the Birthday Bound Security
• A Provable-Security Treatment of the Key-Wrap Problem
• New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
• The “Coefficients H” Technique
• McOE: A Family of Almost Foolproof On-Line Authenticated Encryption Schemes
• A New Variant of PMAC: Beyond the Birthday Bound
• Reconsidering Generic Composition
• Tight Security Bounds for Key-Alternating Ciphers
• 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
• Progress in Cryptology - INDOCRYPT 2004
• Fast Software Encryption
• Fast Software Encryption
• The security of the cipher block chaining message authentication code

This page was built for publication: Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers