Minimizing beyond-birthday-bound secure permutation-based pseudorandom function
From MaRDI portal
Cites work
- \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations
- A construction of a cipher from a single pseudorandom permutation.
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- Analysis of the single-permutation encrypted Davies-Meyer construction
- BBB secure nonce based MAC using public permutations
- Beyond \(2^{c/2}\) security in sponge-based authenticated encryption modes
- Beyond birthday bound secure fresh rekeying: application to authenticated encryption
- Beyond birthday bound secure MAC in faulty nonce model
- Beyond-birthday secure domain-preserving PRFs from a single permutation
- Beyond-birthday security for permutation-based Feistel networks
- Blockcipher-based MACs: beyond the birthday bound without message length
- Combining outputs of a random permutation: new constructions and tight security bounds by Fourier analysis
- Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers
- Encrypt or decrypt -- to make a single-key beyond birthday secure nonce-based MAC
- Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- How to build pseudorandom functions from public random permutations
- scientific article; zbMATH DE number 1302860 (Why is no real title available?)
- scientific article; zbMATH DE number 1303128 (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
- Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract)
- Key-reduced variants of 3Kf9 with beyond-birthday-bound security
- Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
- Minimizing the two-round Even-Mansour cipher
- Minimizing the two-round Even-Mansour cipher
- Mirror theory and cryptography
- Multi-user BBB security of public permutations based MAC
- New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
- Parallelizable MACs based on the sum of PRPs with security beyond the birthday bound
- Probability and Computing
- Proof of Mirror Theory for ξ max = 2
- Proof of mirror theory for a wide range of \(\xi_{\max }\)
- Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting
- Short variable length domain extenders with beyond birthday bound security
- The advantage of truncated permutations
- The sum of PRPs is a secure PRF
- The summation-truncation hybrid: reusing discarded bits for free
- The “Coefficients H” Technique
- Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis
- Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model
- Tweaking Even-Mansour ciphers
- XOCB: beyond-birthday-bound secure authenticated encryption mode with rate-one computation
This page was built for publication: Minimizing beyond-birthday-bound secure permutation-based pseudorandom function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6874228)
