The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC
From MaRDI portal
Publication:3457119
DOI10.1007/978-3-662-47989-6_18zbMath1375.94127OpenAlexW2095980913MaRDI QIDQ3457119
Peter Gaži, Krzysztof Pietrzak, Stefano Tessaro
Publication date: 10 December 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://repository.ist.ac.at/673/1/053.pdf
Related Items (9)
On the resilience of Even-Mansour to invariant permutations ⋮ Optimal forgeries against polynomial-based MACs and GCM ⋮ Revisiting structure graphs: applications to CBC-MAC and EMAC ⋮ New Bounds for Keyed Sponges with Extendable Output: Independence Between Capacity and Message Length ⋮ Public-Seed Pseudorandom Permutations ⋮ The Oribatida v1.3 family of lightweight authenticated encryption schemes ⋮ Beyond conventional security in sponge-based authenticated encryption modes ⋮ XPX: Generalized Tweakable Even-Mansour with Improved Security Guarantees ⋮ On the security of \textsf{TrCBC}
Uses Software
Cites Work
- A construction of a cipher from a single pseudorandom permutation.
- CBC MAC for real-time data sources
- Minimalism in Cryptography: The Even-Mansour Scheme Revisited
- To Hash or Not to Hash Again? (In)Differentiability Results for $$H^2$$ and HMAC
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- New Bounds for PMAC, TMAC, and XCBC
- A Tight Bound for EMAC
- The “Coefficients H” Technique
- Keccak
- Tight Security Bounds for Key-Alternating Ciphers
- Improved Security Analyses for CBC MACs
- A Simple and Unified Method of Proving Indistinguishability
- On the Indifferentiability of the Sponge Construction
- New Proofs for NMAC and HMAC: Security Without Collision-Resistance
This page was built for publication: The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC
