A Uniform Min-Max Theorem with Applications in Cryptography
From MaRDI portal
Publication:2845663
DOI10.1007/978-3-642-40041-4_6zbMath1310.91019OpenAlexW1882771262MaRDI QIDQ2845663
Colin Jia Zheng, Salil P. Vadhan
Publication date: 2 September 2013
Published in: Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40041-4_6
Related Items (10)
Simulating Auxiliary Inputs, Revisited ⋮ Pseudoentropy: Lower-Bounds for Chain Rules and Transformations ⋮ A counterexample to the chain rule for conditional HILL entropy ⋮ The Chain Rule for HILL Pseudoentropy, Revisited ⋮ A Better Chain Rule for HILL Pseudoentropy - Beyond Bounded Leakage ⋮ A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds ⋮ Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols ⋮ Pseudorandom generators from regular one-way functions: new constructions with improved parameters ⋮ A unified approach to deterministic encryption: new constructions and a connection to computational entropy ⋮ Amplifying the security of functional encryption, unconditionally
This page was built for publication: A Uniform Min-Max Theorem with Applications in Cryptography
