How to build pseudorandom functions from public random permutations
From MaRDI portal
Publication:2181853
DOI10.1007/978-3-030-26948-7_10zbMath1456.94064OpenAlexW2967182223MaRDI QIDQ2181853
Eran Lambooij, Bart Mennink, Yu Long Chen
Publication date: 20 May 2020
Full work available at URL: http://hdl.handle.net/2066/207814
Related Items (14)
BBB Secure Nonce Based MAC Using Public Permutations ⋮ \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations ⋮ Keyed sum of permutations: a simpler RP-based PRF ⋮ Adaptively code-correlation robustness functions and its applications to private set intersection ⋮ Multi-user security of the sum of truncated random permutations ⋮ A modular approach to the security analysis of two-permutation constructions ⋮ Quantum attacks against BBB secure PRFs or MACs built from public random permutations ⋮ 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 ⋮ Quantum attacks on sum of Even-Mansour pseudorandom functions ⋮ Mind the composition: birthday bound attacks on EWCDMD and SoKAC21 ⋮ Multi-user BBB security of public permutations based MAC
This page was built for publication: How to build pseudorandom functions from public random permutations
