Message Authentication Codes from Unpredictable Block Ciphers
From MaRDI portal
Recommendations
Cited in
(21)- On the bit security of cryptographic primitives
- Random oracles and non-uniformity
- On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments
- Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions
- The function-inversion problem: barriers and opportunities
- The security of tandem-DM in the ideal cipher model
- Secure message authentication against related-key attack
- Strong authenticity with leakage under weak and falsifiable physical assumptions
- Fixing cracks in the concrete: random oracles with auxiliary input, revisited
- A New Mode of Operation for Block Ciphers and Length-Preserving MACs
- An analysis of the blockcipher-based hash functions from PGV
- Key-reduced variants of 3Kf9 with beyond-birthday-bound security
- Efficient leakage-resilient MACs without idealized assumptions
- Bit security as computational cost for winning games with high probability
- Unified view for notions of bit security
- Lightweight leakage-resilient PRNG from TBCs using superposition
- \textsf{LR-OT}: leakage-resilient oblivious transfer
- A long tweak goes a long way: high multi-user security authenticated encryption from tweakable block ciphers
- Authenticity in the presence of leakage using a forkcipher
- Variants of Wegman-Carter message authentication code supporting variable tag lengths
This page was built for publication: Message Authentication Codes from Unpredictable Block Ciphers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183569)