How to build a short-input random oracle from public random permutations

Cites work

\texttt{Midori}: a block cipher for low energy
A concrete security treatment of symmetric encryption
A New Mode of Operation for Block Ciphers and Length-Preserving MACs
A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
Analysis of the single-permutation encrypted Davies-Meyer construction
Beyond-birthday secure domain-preserving PRFs from a single permutation
Block-cipher-based tree hashing
Categorization of faulty nonce misuse resistant message authentication
Efficient schemes for committing authenticated encryption
Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
Faster signatures from MPC-in-the-head
Full indifferentiable security of the XOR of two or more random permutations using the ^2 method
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
scientific article; zbMATH DE number 1682693 (Why is no real title available?)
scientific article; zbMATH DE number 1302860 (Why is no real title available?)
scientific article; zbMATH DE number 1303128 (Why is no real title available?)
Indifferentiability beyond the birthday bound for the xor of two public random permutations
Indifferentiability of the Sum of Random Permutations Toward Optimal Security
Indifferentiability of truncated random permutations
Indifferentiable authenticated encryption
Information-theoretic indistinguishability via the chi-squared method
KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers
Merkle-Damgård Revisited: How to Construct a Hash Function
Message franking via committing authenticated encryption
Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
Mirror theory and cryptography
New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
On committing authenticated-encryption
On quantum secure compressing pseudorandom functions
On the Indifferentiability of the Sponge 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
The “Coefficients H” Technique
The committing security of MACs with applications to generic composition
The indistinguishability of the XOR of k permutations
The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
The sum of PRPs is a secure PRF
The summation-truncation hybrid: reusing discarded bits for free
Theory of Cryptography
Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis
To hash or not to hash again? (In)differentiability results for H^2 and HMAC

This page was built for publication: How to build a short-input random oracle from public random permutations

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