From Absolute Distinguishability to Positive Distinguishability

DOI10.1007/978-3-642-22670-0_17zbMath1343.68290OpenAlexW1497646960MaRDI QIDQ3088185

Zvika Brakerski, Oded Goldreich

Publication date: 19 August 2011

Published in: Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22670-0_17

zbMATH Keywords

computational indistinguishabilitystatistical indistinguishability

Mathematics Subject Classification ID

Randomized algorithms (68W20) Statistical distribution theory (62E99)

Related Items (4)

Pseudo-mixing Time of Random Walks ⋮ Constructive post-quantum reductions ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ Structure Versus Hardness Through the Obfuscation Lens

Cites Work

• Unnamed Item
• Foundations of Cryptography
• Foundations of Cryptography

This page was built for publication: From Absolute Distinguishability to Positive Distinguishability