The uniform hardcore lemma via approximate Bregman projections

MaRDI QIDQ4633934zbMATH OpenFDO

Authors Boaz Barak, Moritz Hardt, Satyen Kale

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496899

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms (68W40) Cryptography (94A60)

Recommendations

• Boosting and hard-core set construction
• Optimal cryptographic hardness of learning monotone functions
• Complexity of hard-core set proofs
• On the Complexity of Hard-Core Set Constructions
• scientific article; zbMATH DE number 1306886

Cited in

(10)

• Boosting and hard-core set construction
• Amplifying the security of functional encryption, unconditionally
• Nonuniform indistinguishability and unpredictability hardcore lemmas: new proofs and applications to pseudoentropy
• A complete characterization of statistical query learning with applications to evolvability
• A tight computational indistinguishability bound for product distributions
• Smooth Nash equilibria: algorithms and complexity
• Bit-security preserving hardness amplification
• A new minimax theorem for randomized algorithms
• Comparing computational entropies below majority (or: when is the dense model theorem false?)
• Title not available (Why is no real title available?)

This page was built for publication: The uniform hardcore lemma via approximate Bregman projections

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