scientific article; zbMATH DE number 1303128
From MaRDI portal
Publication:4249643
zbMATH Open0994.94521MaRDI QIDQ4249643FDOQ4249643
Recommendations
Cited in
(34)- On the optimality of non-linear computations of length-preserving encryption schemes
- The summation-truncation hybrid: reusing discarded bits for free
- The Relation Between CENC and NEMO
- Tweak-length extension for tweakable blockciphers
- Luby-Rackoff Ciphers from Weak Round Functions?
- Luby-Rackoff backwards with more users and more security
- Revisiting the indifferentiability of the sum of permutations
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- Information-theoretic security with asymmetries
- Analysis of the single-permutation encrypted Davies-Meyer construction
- Salvaging weak security bounds for blockcipher-based constructions
- Keyed sum of permutations: a simpler RP-based PRF
- Beyond birthday bound secure fresh rekeying: application to authenticated encryption
- \textsf{LightMAC}: fork it and make it faster
- Beyond-birthday secure domain-preserving PRFs from a single permutation
- Improved multi-user security using the squared-ratio method
- On the XOR of multiple random permutations
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- Reverse cycle walking and its applications
- A sponge-based PRF with good multi-user security
- Proof of mirror theory for a wide range of \(\xi_{\max }\)
- Cryptanalysis of Tweaked Versions of SMASH and Reparation
- Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^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
- Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis
- A Generic Method to Design Modes of Operation Beyond the Birthday Bound
- How to build optimally secure PRFs using block ciphers
- Categorization of faulty nonce misuse resistant message authentication
- Quantum attacks on PRFs based on public random permutations
- Targeted invertible pseudorandom functions and deterministic format-transforming encryption
- Multi-user security of the sum of truncated random permutations
- Building blockcipher from small-block tweakable blockcipher
- Building blockcipher from tweakable blockcipher: extending FSE 2009 proposal
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249643)
