A sponge-based PRF with good multi-user security
From MaRDI portal
Recommendations
- Luby-Rackoff backwards with more users and more security
- Multi-user security of the sum of truncated random permutations
- Security of Keyed Sponge Constructions Using a Modular Proof Approach
- Sandwich construction for keyed sponges: independence between capacity and online queries
- Hash-Function Based PRFs: AMAC and Its Multi-User Security
Cites work
- Analyzing multi-key security degradation
- Another look at tightness
- Duplexing the sponge: Single-pass authenticated encryption and other applications
- Fast Software Encryption
- Full-state keyed duplex with built-in multi-user support
- Hash-Function Based PRFs: AMAC and Its Multi-User Security
- How to decrypt or even substitute DES-encrypted messages in \(2^{28}\) steps.
- scientific article; zbMATH DE number 5009203 (Why is no real title available?)
- scientific article; zbMATH DE number 1303128 (Why is no real title available?)
- Improved Time-Memory Trade-Offs with Multiple Data
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- Luby-Rackoff backwards with more users and more security
- Multi-key security: the Even-Mansour construction revisited
- New Applications of Time Memory Data Tradeoffs
- On the adaptive security of MACs and PRFs
- On the Indifferentiability of the Sponge Construction
- Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting
- Security of Keyed Sponge Constructions Using a Modular Proof Approach
- The multi-user security of authenticated encryption: AES-GCM in TLS 1.3
- The Multi-user Security of Double Encryption
- The “Coefficients H” Technique
- Tight security bounds for key-alternating ciphers
This page was built for publication: A sponge-based PRF with good multi-user security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6619860)