Indistinguishability Amplification

DOI10.1007/978-3-540-74143-5_8zbMath1215.94062MaRDI QIDQ3612547

Ueli M. Maurer, Renato Renner, Krzysztof Pietrzak

Publication date: 10 March 2009

Published in: Advances in Cryptology - CRYPTO 2007 (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.65.6902

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Pseudorandom Functions: Three Decades Later, Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations, Partition and mix: generalizing the swap-or-not shuffle, Programmable distributed point functions, 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, Long-term security and universal composability, Improved direct product theorems for randomized query complexity, Targeted ciphers for format-preserving encryption, Key alternating ciphers based on involutions, Deterministic encryption with the Thorp shuffle, Revisiting (R)CCA security and replay protection, Overcoming impossibility results in composable security using interval-wise guarantees, 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, Optimal Amplification of Noisy Leakages, Tweakable Blockciphers with Asymptotically Optimal Security, Query-Complexity Amplification for Random Oracles, 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