Toward a fully secure authenticated encryption scheme from a pseudorandom permutation
From MaRDI portal
Recommendations
- Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers
- Parallelizable Rate-1 Authenticated Encryption from Pseudorandom Functions
- The counter mode with encrypted nonces and its extension to authenticated encryption
- New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
- Revisiting full-PRF-secure PMAC and using it for beyond-birthday authenticated encryption
Cites work
- A Provable-Security Treatment of the Key-Wrap Problem
- Authenticated Encryption Mode for Beyond the Birthday Bound Security
- Beyond birthday bound secure MAC in faulty nonce model
- Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers
- Encrypt or decrypt -- to make a single-key beyond birthday secure nonce-based MAC
- Fast Software Encryption
- Improved security analysis for nonce-based enhanced hash-then-mask MACs
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- Progress in Cryptology - INDOCRYPT 2004
- Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
- Robust authenticated-encryption AEZ and the problem that it solves
- The software performance of authenticated-encryption modes
- ZMAC: a fast tweakable block cipher mode for highly secure message authentication
Cited in
(12)- PAEQ: parallelizable permutation-based authenticated encryption
- scientific article; zbMATH DE number 1303962 (Why is no real title available?)
- A simple variant of the Merkle-Damgård scheme with a permutation
- StriBob: аутентифицированное шифрование с помощью подстановки LPS из ГОСТ Р 34.11-2012
- On the semantic security of cellular automata based pseudo-random permutation using results from the Luby-Rackoff construction
- A Simple Variant of the Merkle-Damgård Scheme with a Permutation
- Parallelizable Rate-1 Authenticated Encryption from Pseudorandom Functions
- Multi-user security of the sum of truncated random permutations
- A modular approach to the security analysis of two-permutation constructions
- Improved multi-user security using the squared-ratio method
- Making GCM great again: toward full security and longer nonces
- Towards optimally secure deterministic authenticated encryption schemes
This page was built for publication: Toward a fully secure authenticated encryption scheme from a pseudorandom permutation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157556)