Pages that link to "Item:Q3612547"
From MaRDI portal
The following pages link to Indistinguishability Amplification (Q3612547):
Displaying 28 items.
- Long-term security and universal composability (Q604632) (← links)
- Improved direct product theorems for randomized query complexity (Q693002) (← links)
- Targeted ciphers for format-preserving encryption (Q1726660) (← links)
- Key alternating ciphers based on involutions (Q1744011) (← links)
- Deterministic encryption with the Thorp shuffle (Q1753170) (← links)
- Amplitude amplification for operator identification and randomized classes (Q1791020) (← links)
- Revisiting (R)CCA security and replay protection (Q2061954) (← links)
- Overcoming impossibility results in composable security using interval-wise guarantees (Q2096476) (← links)
- The \(t\)-wise independence of substitution-permutation networks (Q2139644) (← links)
- Composable and finite computational security of quantum message transmission (Q2175915) (← links)
- A unified and composable take on ratcheting (Q2175936) (← links)
- Adaptive security of multi-party protocols, revisited (Q2695654) (← links)
- Trojan-resilience without cryptography (Q2697869) (← links)
- Optimal Amplification of Noisy Leakages (Q2799099) (← links)
- Tweakable Blockciphers with Asymptotically Optimal Security (Q2946875) (← links)
- Query-Complexity Amplification for Random Oracles (Q2947529) (← links)
- A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch (Q3408197) (← links)
- The Iterated Random Permutation Problem with Applications to Cascade Encryption (Q3457118) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations (Q5149756) (← links)
- Partition and mix: generalizing the swap-or-not shuffle (Q6041586) (← links)
- Programmable distributed point functions (Q6111543) (← links)
- Anonymous authenticated communication (Q6134823) (← links)
- Giving an adversary guarantees (or: how to model designated verifier signatures in a composable framework) (Q6157549) (← links)
- Universal reductions: reductions relative to stateful oracles (Q6169554) (← links)
- Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis (Q6636384) (← links)
- Asymptotically optimal message dissemination with applications to blockchains (Q6637325) (← links)
- From random probing to noisy leakages without field-size dependence (Q6637530) (← links)
