How to build pseudorandom functions from public random permutations

Recommendations

Indifferentiability beyond the birthday bound for the xor of two public random permutations
Beyond-birthday secure domain-preserving PRFs from a single permutation
Keyed sum of permutations: a simpler RP-based PRF
On the XOR of multiple random permutations
On the construction of pseudorandom permutations: Luby-Rackoff revisited

Cited in

(27)

Analysis of the single-permutation encrypted Davies-Meyer construction
Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
Multi-user BBB security of public permutations based MAC
Quantum attacks on sum of Even-Mansour pseudorandom functions
Beyond-birthday secure domain-preserving PRFs from a single permutation
\(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations
Adaptively code-correlation robustness functions and its applications to private set intersection
Quantum attacks against BBB secure PRFs or MACs built from public random permutations
scientific article; zbMATH DE number 1302860 (Why is no real title available?)
scientific article; zbMATH DE number 1304088 (Why is no real title available?)
scientific article; zbMATH DE number 1418300 (Why is no real title available?)
BBB secure nonce based MAC using public permutations
Public-seed pseudorandom permutations
Keyed sum of permutations: a simpler RP-based PRF
Multi-user security of the sum of truncated random permutations
A modular approach to the security analysis of two-permutation constructions
Simon's algorithm and symmetric crypto: generalizations and automatized applications
Provably secure reflection ciphers
Designing tweakable enciphering schemes using public permutations
Quantum attacks on PRFs based on public random permutations
Breaking permutation-based pseudorandom cryptographic schemes using distributed exact quantum algorithms
Quantum query lower bounds for key recovery attacks on the Even-Mansour cipher
Tight security analysis of the public permutation-based \(\mathsf{PMAC\_Plus} \)
Farasha: a provable permutation-based parallelizable PRF
On the number of restricted solutions to constrained systems and their applications
Minimizing beyond-birthday-bound secure permutation-based pseudorandom function
Upper bound on information-theoretic security of permutation-based pseudorandom functions

This page was built for publication: How to build pseudorandom functions from public random permutations

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