Upper bound on information-theoretic security of permutation-based pseudorandom functions
From MaRDI portal
Cites work
- \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations
- A construction of a cipher from a single pseudorandom permutation.
- BBB secure nonce based MAC using public permutations
- Better concrete security for half-gates garbling (in the multi-instance setting)
- Generic attacks for the Xor of k random permutations
- How to build pseudorandom functions from public random permutations
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- scientific article; zbMATH DE number 1302860 (Why is no real title available?)
- scientific article; zbMATH DE number 1303128 (Why is no real title available?)
- Introduction to Property Testing
- Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract)
- Keyed sum of permutations: a simpler RP-based PRF
- On sets of integers containing k elements in arithmetic progression
- Plain versus randomized cascading-based key-length extension for block ciphers
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- The sum of PRPs is a secure PRF
- Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis
- Tight time-space lower bounds for finding multiple collision pairs and their applications
This page was built for publication: Upper bound on information-theoretic security of permutation-based pseudorandom functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7304175)
