Information-theoretic indistinguishability via the chi-squared method
From MaRDI portal
(Redirected from Publication:1675217)
Recommendations
- A note on the chi-square method: a tool for proving cryptographic security
- Indistinguishability Amplification
- Full indifferentiable security of the XOR of two or more random permutations using the ^2 method
- The Complexity of Distinguishing Distributions (Invited Talk)
- scientific article; zbMATH DE number 2086702
Cited in
(43)- 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
- Targeted ciphers for format-preserving encryption
- A note on the chi-square method: a tool for proving cryptographic security
- Analysis of the single-permutation encrypted Davies-Meyer construction
- Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model
- Sublinear bounds on the distinguishing advantage for multiple samples
- Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
- The summation-truncation hybrid: reusing discarded bits for free
- On the streaming indistinguishability of a random permutation and a random function
- TNT: how to tweak a block cipher
- Tight security of cascaded LRW2
- Beyond-birthday secure domain-preserving PRFs from a single permutation
- Beyond-birthday security for permutation-based Feistel networks
- \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations
- Quantum attacks against BBB secure PRFs or MACs built from public random permutations
- Beyond birthday bound secure fresh rekeying: application to authenticated encryption
- How to build optimally secure PRFs using block ciphers
- Just tweak! Asymptotically optimal security for the cascaded LRW1 tweakable blockcipher
- Proof of mirror theory for a wide range of \(\xi_{\max }\)
- Security of truncated permutation without initial value
- 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
- \textsf{Elastic-Tweak}: a framework for short tweak tweakable block cipher
- The Relation Between CENC and NEMO
- Revisiting the indifferentiability of the sum of permutations
- \textsf{LightMAC}: fork it and make it faster
- Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis
- Tight security of \textsf{TNT} and beyond. Attacks, proofs and possibilities for the cascaded \textsf{LRW} paradigm
- Information-theoretic security with asymmetries
- On the number of restricted solutions to constrained systems and their applications
- 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
- Forking sums of permutations for highly secure and efficient PRFs
- Proving the security of the extended summation-truncation hybrid
- Robust AE with committing security
- Mind the bad norms. Revisiting compressed oracle-based quantum indistinguishability proofs
- 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: Information-theoretic indistinguishability via the chi-squared method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675217)
