Using an Error-Correction Code for Fast, Beyond-Birthday-Bound Authentication
From MaRDI portal
Publication:2790048
DOI10.1007/978-3-319-16715-2_16zbMath1382.94173OpenAlexW284930587MaRDI QIDQ2790048
Publication date: 2 March 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-16715-2_16
Related Items (4)
Fine-tuning the ISO/IEC standard \textsf{LightMAC} ⋮ Quantum attacks on beyond-birthday-bound MACs ⋮ Revisiting Full-PRF-Secure PMAC and Using It for Beyond-Birthday Authenticated Encryption ⋮ A MAC Mode for Lightweight Block Ciphers
Cites Work
- PMAC with Parity: Minimizing the Query-Length Influence
- Tweakable Blockciphers with Beyond Birthday-Bound Security
- Beyond-Birthday-Bound Security Based on Tweakable Block Cipher
- Authenticated Encryption Mode for Beyond the Birthday Bound Security
- New Bounds for PMAC, TMAC, and XCBC
- A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
- New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
- A New Variant of PMAC: Beyond the Birthday Bound
- Improved Security Analyses for CBC MACs
- A Generic Method to Design Modes of Operation Beyond the Birthday Bound
- Multilane HMAC— Security beyond the Birthday Limit
- Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
This page was built for publication: Using an Error-Correction Code for Fast, Beyond-Birthday-Bound Authentication