A modular approach to the security analysis of two-permutation constructions

Related Items (1)

Improved multi-user security using the squared-ratio method

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
The design of Rijndael. The Advanced Encryption Standard (AES)
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
Mirror theory and cryptography
How to decrypt or even substitute DES-encrypted messages in \(2^{28}\) steps.
Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
Tight security bounds for double-block hash-then-sum MACs
Multi-user BBB security of public permutations based MAC
How to build pseudorandom functions from public random permutations
Tight security of cascaded LRW2
Beyond birthday bound secure MAC in faulty nonce model
Minimizing the two-round tweakable Even-Mansour cipher
Improved security analysis for nonce-based enhanced hash-then-mask MACs
Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
Minimizing the Two-Round Even-Mansour Cipher
Another Look at Tightness
Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
Tweaking Even-Mansour Ciphers
Multi-key Security: The Even-Mansour Construction Revisited
The “Coefficients H” Technique
BBB Secure Nonce Based MAC Using Public Permutations
The PHOTON Family of Lightweight Hash Functions
Tight Security Bounds for Key-Alternating Ciphers
Better security-efficiency trade-offs in permutation-based two-party computation
Toward a fully secure authenticated encryption scheme from a pseudorandom permutation

This page was built for publication: A modular approach to the security analysis of two-permutation constructions