The sum of CBC MACs is a secure PRF
From MaRDI portal
Recommendations
Cited in
(50)- Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
- Tight security bounds for double-block hash-then-sum MACs
- Attacks on beyond-birthday-bound MACs in the quantum setting
- Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting
- Parallelizable MACs based on the sum of PRPs with security beyond the birthday bound
- \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations
- Quantum attacks against BBB secure PRFs or MACs built from public random permutations
- Improved security analysis for nonce-based enhanced hash-then-mask MACs
- On the adaptive security of MACs and PRFs
- How to build optimally secure PRFs using block ciphers
- One-key compression function based MAC with security beyond birthday bound
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- PMAC with parity: minimizing the query-length influence
- Message authentication, revisited
- Tweakable blockciphers with asymptotically optimal security
- Equivalence between MAC, WCR and PRF for blockcipher based constructions
- BCBC: a more efficient MAC algorithm
- Domain extension for MACs beyond the birthday barrier
- scientific article; zbMATH DE number 2089141 (Why is no real title available?)
- \(\mathcal{E}\)-MACs: towards more secure and more efficient constructions of secure channels
- Message Authentication Codes from Unpredictable Block Ciphers
- Fast and Secure CBC-Type MAC Algorithms
- Full PRF-secure message authentication code based on tweakable block cipher
- Revisiting structure graphs: applications to CBC-MAC and EMAC
- CBCR: CBC MAC with rotating transformations
- On the Unprovable Security of 2-Key XCBC
- Improving the Security of MACs Via Randomized Message Preprocessing
- A unified method for improving PRF bounds for a class of blockcipher based MACs
- scientific article; zbMATH DE number 1303129 (Why is no real title available?)
- scientific article; zbMATH DE number 1759779 (Why is no real title available?)
- A MAC mode for lightweight block ciphers
- 3kf9: enhancing 3GPP-MAC beyond the birthday bound
- scientific article; zbMATH DE number 1406792 (Why is no real title available?)
- scientific article; zbMATH DE number 1418299 (Why is no real title available?)
- scientific article; zbMATH DE number 1418300 (Why is no real title available?)
- A new variant of PMAC: beyond the birthday bound
- The security of the cipher block chaining message authentication code
- Proof of mirror theory for a wide range of \(\xi_{\max }\)
- Key-reduced variants of 3Kf9 with beyond-birthday-bound security
- Quantum linearization attacks
- Fine-tuning the ISO/IEC standard \textsf{LightMAC}
- On the Efficiency of ZMAC-Type Modes
- Quantum attacks on beyond-birthday-bound MACs
- A Note on the Security Framework of Two-key DbHtS MACs
- \textsf{LightMAC}: fork it and make it faster
- Tight security analysis of the public permutation-based \(\mathsf{PMAC\_Plus} \)
- The multi-user security of MACs via universal hashing in the ideal cipher model
- On the number of restricted solutions to constrained systems and their applications
- How to protect integrity of \(2^{75}\) blocks using the magma cipher and a single key?
- Toward full n-bit security and nonce misuse resistance of block cipher-based MACs
This page was built for publication: The sum of CBC MACs is a secure PRF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5189462)
