A uniform min-max theorem with applications in cryptography

DOI10.1007/978-3-642-40041-4_6zbMATH Open1310.91019OpenAlexW1882771262MaRDI QIDQ2845663FDOQ2845663

Authors: Colin Jia Zheng, Salil 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

Recommendations

• Simple strategies for large zero-sum games with applications to complexity theory
• A New Approximate Min-Max Theorem with Applications in Cryptography
• scientific article; zbMATH DE number 503346
• Nonuniform indistinguishability and unpredictability hardcore lemmas: new proofs and applications to pseudoentropy
• scientific article; zbMATH DE number 1759774

Mathematics Subject Classification ID

Cryptography (94A60) Noncooperative games (91A10) 2-person games (91A05)

Cited In (12)

• A unified approach to deterministic encryption: new constructions and a connection to computational entropy
• A New Approximate Min-Max Theorem with Applications in Cryptography
• Pseudorandom generators from regular one-way functions: new constructions with improved parameters
• A better chain rule for HILL pseudoentropy -- beyond bounded leakage
• Pseudoentropy: lower-bounds for chain rules and transformations
• Simulating auxiliary inputs, revisited
• A counterexample to the chain rule for conditional HILL entropy
• A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds
• Amplifying the security of functional encryption, unconditionally
• Simple strategies for large zero-sum games with applications to complexity theory
• The chain rule for HILL pseudoentropy, revisited
• Computational two-party correlation: a dichotomy for key-agreement protocols

This page was built for publication: A uniform min-max theorem with applications in cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845663)