Indistinguishability Amplification
From MaRDI portal
Recommendations
- Computational Indistinguishability Amplification: Tight Product Theorems for System Composition
- Free-start distinguishing: combining two types of indistinguishability amplification
- Security amplification for the cascade of arbitrarily weak PRPs. Tight bounds via the interactive hardcore lemma
- Security amplification for the composition of block ciphers: simpler proofs and new results
- scientific article; zbMATH DE number 1689006
Cited in
(45)- A polynomial-time universal security amplifier in the class of block ciphers
- Information-theoretic indistinguishability via the chi-squared method
- Targeted ciphers for format-preserving encryption
- Key alternating ciphers based on involutions
- Deterministic encryption with the Thorp shuffle
- Amplitude amplification for operator identification and randomized classes
- Revisiting (R)CCA security and replay protection
- Overcoming impossibility results in composable security using interval-wise guarantees
- Coupling of random systems
- The \(t\)-wise independence of substitution-permutation networks
- Composable and finite computational security of quantum message transmission
- A unified and composable take on ratcheting
- Adaptive security of multi-party protocols, revisited
- Trojan-resilience without cryptography
- scientific article; zbMATH DE number 1689006 (Why is no real title available?)
- Security amplification for the composition of block ciphers: simpler proofs and new results
- Optimal amplification of noisy leakages
- Tweakable blockciphers with asymptotically optimal security
- Query-complexity amplification for random oracles
- Security amplification for the cascade of arbitrarily weak PRPs. Tight bounds via the interactive hardcore lemma
- Computational Indistinguishability Amplification: Tight Product Theorems for System Composition
- A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
- The iterated random permutation problem with applications to cascade encryption
- scientific article; zbMATH DE number 2086702 (Why is no real title available?)
- Free-start distinguishing: combining two types of indistinguishability amplification
- Distinguishing distributions using Chernoff information
- Pseudorandom functions: three decades later
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- A Simple and Unified Method of Proving Indistinguishability
- Theory of Cryptography
- Partition and mix: generalizing the swap-or-not shuffle
- Long-term security and universal composability
- Programmable distributed point functions
- A tight computational indistinguishability bound for product distributions
- Anonymous authenticated communication
- Layout graphs, random walks and the t-wise independence of SPN block ciphers
- Giving an adversary guarantees (or: how to model designated verifier signatures in a composable framework)
- Universal reductions: reductions relative to stateful oracles
- Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis
- Asymptotically optimal message dissemination with applications to blockchains
- From random probing to noisy leakages without field-size dependence
- Information-theoretic security with asymmetries
- On the equivalence of uniform key agreement and sequential composition insecurity
- Improved direct product theorems for randomized query complexity
- Cryptography with weak privacy
This page was built for publication: Indistinguishability Amplification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612547)
