Tight security bounds for key-alternating ciphers

Recommendations

Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract)
An asymptotically tight security analysis of the iterated Even-Mansour cipher
Minimizing the two-round Even-Mansour cipher
Minimizing the two-round Even-Mansour cipher
On the indifferentiability of key-alternating ciphers

Cited in

(only showing first 100 items - show all)

Towards tight security of cascaded LRW2
Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security
Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
Output masking of tweakable Even-Mansour can be eliminated for message authentication code
A robust and sponge-like PRNG with improved efficiency
Key alternating ciphers based on involutions
On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks
Analysis of the single-permutation encrypted Davies-Meyer construction
Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model
Minimizing the two-round Even-Mansour cipher
Slidex attacks on the Even-Mansour encryption scheme
The Oribatida v1.3 family of lightweight authenticated encryption schemes
Compactness of hashing modes and efficiency beyond Merkle tree
Provable related-key security of contracting Feistel networks
Security analysis of NIST CTR-DRBG
Better concrete security for half-gates garbling (in the multi-instance setting)
Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting
The \(t\)-wise independence of substitution-permutation networks
Tweaking key-alternating Feistel block ciphers
Connecting tweakable and multi-key blockcipher security
Beyond-birthday secure domain-preserving PRFs from a single permutation
Multi-user security bound for filter permutators in the random oracle model
Beyond-birthday security for permutation-based Feistel networks
\(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations
Adaptively code-correlation robustness functions and its applications to private set intersection
Minimizing the two-round tweakable Even-Mansour cipher
Tight security analysis of 3-round key-alternating cipher with a single permutation
How to build optimally secure PRFs using block ciphers
How to build an ideal cipher: the indifferentiability of the Feistel construction
On the XOR of multiple random permutations
Key-alternating ciphers and key-length extension: exact bounds and multi-user security
Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers
XPX: generalized tweakable Even-Mansour with improved security guarantees
Indifferentiability of 8-Round Feistel Networks
EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
On the indifferentiability of key-alternating ciphers
Alternating product ciphers: a case for provable security comparisons (extended abstract)
Minimizing the two-round Even-Mansour cipher
Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract)
Security analysis of key-alternating Feistel ciphers
Salvaging weak security bounds for blockcipher-based constructions
How to build fully secure tweakable blockciphers from classical blockciphers
Separating invertible key derivations from non-invertible ones: sequential indifferentiability of 3-round Even-Mansour
Key recovery attacks on iterated Even-Mansour encryption schemes
The counter mode with encrypted nonces and its extension to authenticated encryption
Tweaking Even-Mansour ciphers
Multi-key security: the Even-Mansour construction revisited
The exact PRF security of truncation: tight bounds for keyed sponges and truncated CBC
New bounds for keyed sponges with extendable output: independence between capacity and message length
Strengthening the known-key security notion for block ciphers
An asymptotically tight security analysis of the iterated Even-Mansour cipher
Concise and tight security analysis of the Bennett–Brassard 1984 protocol with finite key lengths
The Multi-user Security of Double Encryption
Partition and mix: generalizing the swap-or-not shuffle
Keyed sum of permutations: a simpler RP-based PRF
Revisiting BBS signatures
Block-cipher-based tree hashing
Key-reduced variants of 3Kf9 with beyond-birthday-bound security
Jammin' on the deck
A modular approach to the security analysis of two-permutation constructions
Layout graphs, random walks and the t-wise independence of SPN block ciphers
BBB security for 5-round even-Mansour-based key-alternating Feistel ciphers
Better security-efficiency trade-offs in permutation-based two-party computation
Tight security for key-alternating ciphers with correlated sub-keys
Fine-tuning the ISO/IEC standard \textsf{LightMAC}
Categorization of faulty nonce misuse resistant message authentication
\textsf{tHyENA}: making \textsf{HyENA} even smaller
Provably secure reflection ciphers
Designing tweakable enciphering schemes using public permutations
Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules)
Offset-based BBB-secure tweakable block-ciphers with updatable caches
Provable security against generic attacks on stream ciphers
Implicit key-stretching security of encryption schemes
Half-tree: halving the cost of tree expansion in COT and DPF
A Note on the Security Framework of Two-key DbHtS MACs
A forkcipher-based pseudo-random number generator
Populating the zoo of rugged pseudorandom permutations
Security proofs for key-alternating ciphers with non-independent round permutations
CCA security for contracting (quasi-)Feistel constructions with tight round complexity
Quantum query lower bounds for key recovery attacks on the Even-Mansour cipher
Exact security analysis of ASCON
Feistel ciphers based on a single primitive
Tight security analysis of the public permutation-based \(\mathsf{PMAC\_Plus} \)
Multi-user security of the Elephant v2 authenticated encryption mode
A sponge-based PRF with good multi-user security
Designing full-rate \textsf{Sponge} based AEAD modes
Towards minimizing tweakable blockcipher-based generalized Feistel networks
The exact multi-user security of (tweakable) key alternating ciphers with a single permutation
Information-theoretic security with asymmetries
Indifferentiability of 3-round confusion-diffusion networks
Tweakable permutation-based Luby-Rackoff constructions
Adaptively secure three-round threshold Schnorr signatures from DDH
Glacius: threshold Schnorr signatures from DDH with full adaptive security
Efficient instances of docked double decker with AES, and application to authenticated encryption
Towards optimally secure deterministic authenticated encryption schemes
Comprehensive robustness analysis of GCM, CCM, and OCB3
On tweakable correlation robust hashing against key leakages
UFLM: a unified framework for Feistel structure and Lai-Massey structure
Faster signatures from MPC-in-the-head
Robust AE with committing security

This page was built for publication: Tight security bounds for key-alternating ciphers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418704)