Sequential indifferentiability of STH and EDM
From MaRDI portal
Cites work
- A New Mode of Operation for Block Ciphers and Length-Preserving MACs
- Beyond-birthday secure domain-preserving PRFs from a single permutation
- Block-cipher-based tree hashing
- Careful with composition: limitations of the indifferentiability framework
- Encrypt or decrypt -- to make a single-key beyond birthday secure nonce-based MAC
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- Full indifferentiable security of the XOR of two or more random permutations using the ^2 method
- GIFT: a small present. Towards reaching the limit of lightweight encryption
- How to construct an ideal cipher from a small set of public 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?)
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- Indifferentiability beyond the birthday bound for the xor of two public random permutations
- Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6
- Indifferentiability of the Sum of Random Permutations Toward Optimal Security
- Indifferentiability of truncated random permutations
- Information-theoretic indistinguishability via the chi-squared method
- Known-Key Distinguishers for Some Block Ciphers
- Merkle-Damgård Revisited: How to Construct a Hash Function
- New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
- New hash functions and their use in authentication and set equality
- On the provable security of the iterated Even-Mansour cipher against related-key and chosen-key attacks
- On the public indifferentiability and correlation intractability of the 6-round Feistel construction
- On the XOR of multiple random permutations
- PRESENT: An Ultra-Lightweight Block Cipher
- PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract
- Proof of Mirror Theory for ξ max = 2
- Revisiting the indifferentiability of the sum of permutations
- Strengthening the known-key security notion for block ciphers
- The advantage of truncated permutations
- The Random Oracle Model and the Ideal Cipher Model Are Equivalent
- The summation-truncation hybrid: reusing discarded bits for free
- Theory of Cryptography
This page was built for publication: Sequential indifferentiability of STH and EDM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346694)
