Computational Indistinguishability Amplification: Tight Product Theorems for System Composition

DOI10.1007/978-3-642-03356-8_21zbMath1252.94086OpenAlexW1877693678MaRDI QIDQ3183574

Ueli M. Maurer, Stefano Tessaro

Publication date: 20 October 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-03356-8_21

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

The Iterated Random Permutation Problem with Applications to Cascade Encryption ⋮ A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch ⋮ Amplifying the security of functional encryption, unconditionally

This page was built for publication: Computational Indistinguishability Amplification: Tight Product Theorems for System Composition