The security of the cipher block chaining message authentication code
From MaRDI portal
Recommendations
Cites work
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A study of password security
- CBC MAC for real-time data sources
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 1024057 (Why is no real title available?)
- scientific article; zbMATH DE number 1024060 (Why is no real title available?)
- scientific article; zbMATH DE number 1030977 (Why is no real title available?)
- scientific article; zbMATH DE number 1030978 (Why is no real title available?)
- scientific article; zbMATH DE number 1406792 (Why is no real title available?)
- scientific article; zbMATH DE number 1418297 (Why is no real title available?)
- scientific article; zbMATH DE number 1418299 (Why is no real title available?)
- Keying hash functions for message authentication
- New hash functions and their use in authentication and set equality
Cited in
(65)- Encryption modes with almost free message integrity
- Authenticated encryption: relations among notions and analysis of the generic composition paradigm
- Decorrelation over infinite domains: The encrypted CBC-MAC case
- CBC MAC for real-time data sources
- On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers
- Bernoulli numbers and the probability of a birthday surprise
- Tight security bounds for double-block hash-then-sum MACs
- On the security of \textsf{TrCBC}
- Private set intersection in the internet setting from lightweight oblivious PRF
- MoSS: modular security specifications framework
- Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting
- Incremental cryptography revisited: PRFs, nonces and modular design
- Blockcipher-based authenticated encryption: how small can we go?
- Beyond-birthday secure domain-preserving PRFs from a single permutation
- Improved security analysis for nonce-based enhanced hash-then-mask MACs
- scientific article; zbMATH DE number 1689007 (Why is no real title available?)
- NIST block cipher modes of operation for authentication and combined confidentiality and authentication
- Reconfigurable cryptography: a flexible approach to long-term security
- Breaking symmetric cryptosystems using quantum period finding
- Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- Automated proofs of block cipher modes of operation
- On ``the power of verification queries in unconditionally secure message authentication
- Fuzzy universal hashing and approximate authentication
- Integrity Analysis of Authenticated Encryption Based on Stream Ciphers
- The state of the authenticated encryption
- Concealment and its applications to authenticated encryption
- On the security of the Winternitz one-time signature scheme
- The power of primes: security of authentication based on a universal hash-function family
- Contributory password-authenticated group key exchange with join capability
- Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols
- Security of Hash-then-CBC key wrapping revisited
- Message Authentication Codes from Unpredictable Block Ciphers
- Legal messages for some message authentication functions in block ciphers
- On cryptographic properties of the CVV and PVV parameters generation procedures in payment systems
- Fast and Secure CBC-Type MAC Algorithms
- On the Notions of PRP-RKA, KR and KR-RKA for Block Ciphers
- Revisiting structure graphs: applications to CBC-MAC and EMAC
- Efficient One-Round Key Exchange in the Standard Model
- A Provable-Security Treatment of the Key-Wrap Problem
- Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography
- Building Secure Block Ciphers on Generic Attacks Assumptions
- scientific article; zbMATH DE number 1303129 (Why is no real title available?)
- Tweakable block ciphers
- scientific article; zbMATH DE number 2086719 (Why is no real title available?)
- scientific article; zbMATH DE number 1406792 (Why is no real title available?)
- Strong authenticity with leakage under weak and falsifiable physical assumptions
- Using the numerical solution for partial fractional differential equation by ADI numerical method to cryptography in Hill matrix system
- The sum of CBC MACs is a secure PRF
- Notions and relations for RKA-secure permutation and function families
- A Simple and Unified Method of Proving Indistinguishability
- Economically optimal variable tag length message authentication
- An analysis of the blockcipher-based hash functions from PGV
- QCB is blindly unforgeable
- Key-reduced variants of 3Kf9 with beyond-birthday-bound security
- Quantum attacks on beyond-birthday-bound MACs
- \textsf{LightMAC}: fork it and make it faster
- On quantum secure compressing pseudorandom functions
- Tight security analysis of the public permutation-based \(\mathsf{PMAC\_Plus} \)
- CryptAttackTester: high-assurance attack analysis
- On the number of restricted solutions to constrained systems and their applications
- Improving tightness gap of GGM construction and its applications
- Toward full n-bit security and nonce misuse resistance of block cipher-based MACs
- New proofs for NMAC and HMAC: security without collision resistance
- Simple password-based three-party authenticated key exchange without server public keys
This page was built for publication: The security of the cipher block chaining message authentication code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5929912)
