On the power of nonuniformity in proofs of security
From MaRDI portal
Publication:2986888
DOI10.1145/2422436.2422480zbMath1361.94038OpenAlexW2065661182MaRDI QIDQ2986888
Huijia Lin, Mohammad Mahmoody, Rafael Pass, Kai-Min Chung
Publication date: 16 May 2017
Published in: Proceedings of the 4th conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2422436.2422480
Related Items (10)
Random oracles and non-uniformity ⋮ Unprovable security of perfect NIZK and non-interactive non-malleable commitments ⋮ On constructing one-way permutations from indistinguishability obfuscation ⋮ On the worst-case inefficiency of CGKA ⋮ Non-uniformity and quantum advice in the quantum random oracle model ⋮ Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG ⋮ Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Lower Bounds on Assumptions Behind Indistinguishability Obfuscation ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Teachability in computational learning
- Measuring teachability using variants of the teaching dimension
- Teaching a smarter learner.
- Occam's razor
- Pseudorandom generators for space-bounded computation
- On the power of inductive inference from good examples
- A model of interactive teaching
- Learning from different teachers
- On the limits of efficient teachability
- In search of an easy witness: Exponential time vs. probabilistic polynomial time.
- On the complexity of teaching
- On specifying Boolean functions by labelled examples
- Recent Developments in Algorithmic Teaching
- A theory of the learnable
- Teaching Randomized Learners
- Algorithmic Learning Theory
- A theory of goal-oriented communication
- Derandomizing polynomial identity tests means proving circuit lower bounds
This page was built for publication: On the power of nonuniformity in proofs of security
