Categorization of faulty nonce misuse resistant message authentication
From MaRDI portal
Recommendations
- Blockcipher-based MACs: beyond the birthday bound without message length
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- Beyond birthday bound secure MAC in faulty nonce model
- Parallelizable MACs based on the sum of PRPs with security beyond the birthday bound
- Improved security analysis for nonce-based enhanced hash-then-mask MACs
Cites work
- Advances in cryptology -- CRYPTO 2016. 36th annual international cryptology conference, Santa Barbara, CA, USA, August 14--18, 2016. Proceedings. Part I
- Advances in cryptology -- CRYPTO 2017. 37th annual international cryptology conference, Santa Barbara, CA, USA, August 20--24, 2017. Proceedings. Part II
- Bernstein bound on WCS is tight -- repairing Luykx-Preneel optimal forgeries
- Beyond birthday bound secure MAC in faulty nonce model
- Codes Which Detect Deception
- Comb to pipeline: fast software encryption revisited
- Encrypt or decrypt -- to make a single-key beyond birthday secure nonce-based MAC
- Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- Feistel ciphers. Security proofs and cryptanalysis
- How to Thwart Birthday Attacks against MACs via Small Randomness
- scientific article; zbMATH DE number 1303128 (Why is no real title available?)
- scientific article; zbMATH DE number 862975 (Why is no real title available?)
- scientific article; zbMATH DE number 1406775 (Why is no real title available?)
- Improved security analysis for nonce-based enhanced hash-then-mask MACs
- Information Security and Cryptology - ICISC 2005
- Information-theoretic indistinguishability via the chi-squared method
- KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
- KLEIN: a new family of lightweight block ciphers
- Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
- Mirror theory and cryptography
- New hash functions and their use in authentication and set equality
- On fast and provably secure message authentication based on universal hashing
- Optimal forgeries against polynomial-based MACs and GCM
- Piccolo: An Ultra-Lightweight Blockcipher
- PRESENT: An Ultra-Lightweight Block Cipher
- PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract
- Progress in Cryptology - INDOCRYPT 2004
- SipHash: a fast short-input PRF
- Stronger Security Bounds for Wegman-Carter-Shoup Authenticators
- The \textsc{Simon} and \textsc{Speck} block ciphers on AVR 8-bit microcontrollers
- The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
- The “Coefficients H” Technique
- Tight security bounds for double-block hash-then-sum MACs
- Tight security bounds for key-alternating ciphers
- Tight security of cascaded LRW2
Cited in
(11)- Blockcipher-based MACs: beyond the birthday bound without message length
- Beyond birthday bound secure MAC in faulty nonce model
- Improved security analysis for nonce-based enhanced hash-then-mask MACs
- BBB secure nonce based MAC using public permutations
- EHE: NONCE MISUSE-RESISTANT MESSAGE AUTHENTICATION
- Improved multi-user security using the squared-ratio method
- Quantum attacks on PRFs based on public random permutations
- Tight security analysis of the public permutation-based \(\mathsf{PMAC\_Plus} \)
- Forking sums of permutations for highly secure and efficient PRFs
- Toward full n-bit security and nonce misuse resistance of block cipher-based MACs
- How to build a short-input random oracle from public random permutations
This page was built for publication: Categorization of faulty nonce misuse resistant message authentication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157561)
