Robust AE with committing security
From MaRDI portal
Cites work
- A Provable-Security Treatment of the Key-Wrap Problem
- Efficient schemes for committing authenticated encryption
- Format-preserving encryption
- HCH: A New Tweakable Enciphering Scheme Using the Hash-Encrypt-Hash Approach
- How to securely release unverified plaintext in authenticated encryption
- scientific article; zbMATH DE number 1583788 (Why is no real title available?)
- Information-theoretic indistinguishability via the chi-squared method
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- Message franking via committing authenticated encryption
- On committing authenticated-encryption
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
- Parallelizable and authenticated online ciphers
- Reconsidering generic composition
- Robust authenticated-encryption AEZ and the problem that it solves
- Succinctly-committing authenticated encryption
- The “Coefficients H” Technique
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Tight security bounds for key-alternating ciphers
This page was built for publication: Robust AE with committing security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965372)