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

DOI10.1007/978-3-662-53018-4_2MaRDI QIDQ2835582zbMATH OpenOpenAlexFDO

Authors 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 encryptionbeyond-birthday-bound securityCAESAR competitionnonce-misuse resistancetweakable block cipher

Mathematics Subject Classification ID

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

Recommendations

• Tweakable block ciphers
• scientific article; zbMATH DE number 1942411
• Tweaks and Keys for Block Ciphers: The TWEAKEY Framework
• Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption
• A General Construction of Tweakable Block Ciphers and Different Modes of Operations
• A General Construction of Tweakable Block Ciphers and Different Modes of Operations
• Tweakable enciphering schemes using only the encryption function of a block cipher
• Optimally secure tweakable blockciphers
• Tweakable Blockciphers with Beyond Birthday-Bound Security
• The counter mode with encrypted nonces and its extension to authenticated encryption

Cites work

• A modular framework for building variable-input-length tweakable ciphers
• A new variant of PMAC: beyond the birthday bound
• A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
• A Provable-Security Treatment of the Key-Wrap Problem
• Authenticated Encryption Mode for Beyond the Birthday Bound Security
• Beyond-Birthday-Bound Security Based on Tweakable Block Cipher
• Characterization of security notions for probabilistic private-key encryption
• Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers
• Domain extension for MACs beyond the birthday barrier
• Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
• Encryption modes with almost free message integrity
• Fast Encryption and Authentication: XCBC Encryption and XECB Authentication Modes
• Fast Software Encryption
• Fast Software Encryption
• How to securely release unverified plaintext in authenticated encryption
• scientific article; zbMATH DE number 1583788 (Why is no real title available?)
• scientific article; zbMATH DE number 1583804 (Why is no real title available?)
• scientific article; zbMATH DE number 1722692 (Why is no real title available?)
• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• scientific article; zbMATH DE number 1942411 (Why is no real title available?)
• scientific article; zbMATH DE number 2086719 (Why is no real title available?)
• scientific article; zbMATH DE number 2086729 (Why is no real title available?)
• scientific article; zbMATH DE number 1842499 (Why is no real title available?)
• McOE: a family of almost foolproof on-line authenticated encryption schemes
• New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
• New hash functions and their use in authentication and set equality
• On fast and provably secure message authentication based on universal hashing
• Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance
• Optimally secure tweakable blockciphers
• Parallelizable and authenticated online ciphers
• Pipelineable on-line encryption
• Progress in Cryptology - INDOCRYPT 2004
• Reconsidering generic composition
• Robust authenticated-encryption AEZ and the problem that it solves
• The indistinguishability of the XOR of k permutations
• The security of the cipher block chaining message authentication code
• The software performance of authenticated-encryption modes
• The sum of PRPs is a secure PRF
• The “Coefficients H” Technique
• Tight security bounds for key-alternating ciphers
• Tweakable blockciphers with asymptotically optimal security
• Tweakable Blockciphers with Beyond Birthday-Bound Security
• Tweaks and Keys for Block Ciphers: The TWEAKEY Framework

Cited in

(45)

• Towards tight security of cascaded LRW2
• The design and evolution of OCB
• The \texttt{Deoxys} AEAD family
• Alzette: a 64-bit ARX-boxes (feat. CRAX and TRAX)
• Incremental cryptography revisited: PRFs, nonces and modular design
• Pholkos -- efficient large-state tweakable block ciphers from the AES round function
• Reducing the cost of authenticity with leakages: a CIML2-secure AE scheme with one call to a strongly protected tweakable block cipher
• Tight security of cascaded LRW2
• Beyond birthday bound secure MAC in faulty nonce model
• Beyond conventional security in sponge-based authenticated encryption modes
• Connecting tweakable and multi-key blockcipher security
• 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
• An Inverse-Free Single-Keyed Tweakable Enciphering Scheme
• Efficient beyond-birthday-bound-secure deterministic authenticated encryption with minimal stretch
• Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption
• The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
• Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers
• Tweaks and Keys for Block Ciphers: The TWEAKEY Framework
• Impossible-differential and boomerang cryptanalysis of round-reduced Kiasu-BC
• Revisiting full-PRF-secure PMAC and using it for beyond-birthday authenticated encryption
• Polye+CTR: a swiss-army-knife mode for block ciphers
• The counter mode with encrypted nonces and its extension to authenticated encryption
• Authenticated Encryption Mode for Beyond the Birthday Bound Security
• A General Construction of Tweakable Block Ciphers and Different Modes of Operations
• Impossible differential cryptanalysis of reduced-round \texttt{SKINNY}
• Cryptanalysis of the TAE mode and its improvement
• IQRA: Incremental Quadratic Re-keying friendly Authentication scheme
• 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
• Integral Cryptanalysis of Reduced-Round Tweakable TWINE
• Reconsidering generic composition: the modes A10, A11 and A12 are insecure
• ZLR: a fast online authenticated encryption scheme achieving full security
• Farasha: a provable permutation-based parallelizable PRF
• Tight security of \textsf{TNT} and beyond. Attacks, proofs and possibilities for the cascaded \textsf{LRW} paradigm
• Minimizing beyond-birthday-bound secure permutation-based pseudorandom function
• Making GCM great again: toward full security and longer nonces
• Towards optimally secure deterministic authenticated encryption schemes
• Forking sums of permutations for highly secure and efficient PRFs
• Fast parallelizable misuse-resistant authenticated encryption. Low latency (decryption-fast) SIV
• CCA security with short AEAD tags
• A long tweak goes a long way: high multi-user security authenticated encryption from tweakable block ciphers

Describes a project that uses

Uses Software

• McOE
• Skein Hash

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835582)