Luby-Rackoff backwards: increasing security by making block ciphers non-invertible
From MaRDI portal
Recommendations
Cited in
(46)- Full indifferentiable security of the XOR of two or more random permutations using the ^2 method
- Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
- A note on the chi-square method: a tool for proving cryptographic security
- Analysis of the single-permutation encrypted Davies-Meyer construction
- The summation-truncation hybrid: reusing discarded bits for free
- Building blockcipher from small-block tweakable blockcipher
- Beyond-birthday secure domain-preserving PRFs from a single permutation
- Beyond birthday bound secure fresh rekeying: application to authenticated encryption
- How to build optimally secure PRFs using block ciphers
- On the XOR of multiple random permutations
- On the optimality of non-linear computations of length-preserving encryption schemes
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- Salvaging weak security bounds for blockcipher-based constructions
- Reverse cycle walking and its applications
- Building blockcipher from tweakable blockcipher: extending FSE 2009 proposal
- Tweak-length extension for tweakable blockciphers
- Luby-Rackoff Ciphers from Weak Round Functions?
- Cryptanalysis of Tweaked Versions of SMASH and Reparation
- A Generic Method to Design Modes of Operation Beyond the Birthday Bound
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- Keyed sum of permutations: a simpler RP-based PRF
- Targeted invertible pseudorandom functions and deterministic format-transforming encryption
- Proof of mirror theory for a wide range of \(\xi_{\max }\)
- Multi-user security of the sum of truncated random permutations
- Improved multi-user security using the squared-ratio method
- Luby-Rackoff backwards with more users and more security
- Categorization of faulty nonce misuse resistant message authentication
- The Relation Between CENC and NEMO
- Quantum attacks on PRFs based on public random permutations
- Revisiting the indifferentiability of the sum of permutations
- \textsf{LightMAC}: fork it and make it faster
- A sponge-based PRF with good multi-user security
- Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis
- Information-theoretic security with asymmetries
- Minimizing beyond-birthday-bound secure permutation-based pseudorandom function
- Combining outputs of a random permutation: new constructions and tight security bounds by Fourier analysis
- Efficient instances of docked double decker with AES, and application to authenticated encryption
- Towards optimally secure deterministic authenticated encryption schemes
- Forking sums of permutations for highly secure and efficient PRFs
- Proving the security of the extended summation-truncation hybrid
- General practical cryptanalysis of the sum of round-reduced block ciphers and ZIP-AES
- Mind the bad norms. Revisiting compressed oracle-based quantum indistinguishability proofs
- Upper bound on information-theoretic security of permutation-based pseudorandom functions
- How to build a short-input random oracle from public random permutations
- Block cipher doubling for a post-quantum world
- Sequential indifferentiability of STH and EDM
This page was built for publication: Luby-Rackoff backwards: increasing security by making block ciphers non-invertible
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249643)
