Parallelizable Rate-1 Authenticated Encryption from Pseudorandom Functions
From MaRDI portal
Recommendations
- Toward a fully secure authenticated encryption scheme from a pseudorandom permutation
- PAEQ: parallelizable permutation-based authenticated encryption
- scientific article; zbMATH DE number 2043337
- Parallelizable authenticated encryption with small state size
- Pseudo-Random Functions and Parallelizable Modes of Operations of a Block Cipher
- Parallel Key-Insulated Public Key Encryption Without Random Oracles
- Leakage-resilient authenticated encryption from leakage-resilient pseudorandom functions
- Parallelizable and authenticated online ciphers
- Pseudorandom functions and permutations provably secure against related-key attacks
- Generic constructions of parallel key-insulated encryption
Cited in
(29)- Cryptanalysis of OCB2: attacks on authenticity and confidentiality
- Formal analysis of symbolic authenticity
- Statistical fault attacks on nonce-based authenticated encryption schemes
- Implicit key-stretching security of encryption schemes
- TNT: how to tweak a block cipher
- Blockcipher-based authenticated encryption: how small can we go?
- Breaking symmetric cryptosystems using quantum period finding
- Revisiting full-PRF-secure PMAC and using it for beyond-birthday authenticated encryption
- On modes of operations of a block cipher for authentication and authenticated encryption
- The design and evolution of OCB
- Beyond conventional security in sponge-based authenticated encryption modes
- A new authenticated encryption mode for arbitrary block cipher based on universal hash function
- Pseudo-Random Functions and Parallelizable Modes of Operations of a Block Cipher
- PAEQ: parallelizable permutation-based authenticated encryption
- Toward a fully secure authenticated encryption scheme from a pseudorandom permutation
- Offset-based BBB-secure tweakable block-ciphers with updatable caches
- Towards closing the security gap of Tweak-aNd-Tweak (TNT)
- Farasha: a provable permutation-based parallelizable PRF
- The Oribatida v1.3 family of lightweight authenticated encryption schemes
- Quantum cryptanalysis of OTR and OPP: attacks on confidentiality, and key-recovery
- Probably secure keyed-function based authenticated encryption schemes for big data
- Beyond birthday bound secure fresh rekeying: application to authenticated encryption
- Trick or tweak: on the (in)security of OTR's tweaks
- Parallelizable authenticated encryption with small state size
- \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations
- \textsc{POEx}: a beyond-birthday-bound-secure on-line cipher
- Beyond-birthday security for permutation-based Feistel networks
- Fast Software Encryption
- ASC-1: an authenticated encryption stream cipher
This page was built for publication: Parallelizable Rate-1 Authenticated Encryption from Pseudorandom Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418701)