Witness encryption and NP-hardness of learning
From MaRDI portal
Cites work
- A Pseudorandom Generator from any One-way Function
- A theory of the learnable
- Agnostic Learning from Tolerant Natural Proofs
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Capturing one-way functions via NP-hardness of meta-complexity
- Circuit minimization problem
- Coding and cryptology. Third international workshop, IWCC 2011, Qingdao, China, May 30 -- June 3, 2011. Proceedings
- Computational limitations on learning from examples
- Conspiracies between learning algorithms, circuit lower bounds, and pseudorandomness
- Cryptographic primitives based on hard learning problems
- Extracting all the randomness and reducing the error in Trevisan's extractors
- Gap MCSP is not (Levin) NP-complete in obfustopia
- Hardness vs randomness
- scientific article; zbMATH DE number 4179276 (Why is no real title available?)
- scientific article; zbMATH DE number 1559537 (Why is no real title available?)
- scientific article; zbMATH DE number 7561748 (Why is no real title available?)
- scientific article; zbMATH DE number 7650416 (Why is no real title available?)
- Learning in Pessiland via inductive inference
- Linear-size Boolean circuits for multiselection
- Minimum propositional proof length is NP-hard to linearly approximate
- Multiple assignment scheme for sharing secret
- NP-hardness of approximating meta-complexity: a cryptographic approach
- NP-hardness of learning programs and partial MCSP
- On the (im)possibility of obfuscating programs
- On the Complexity of Learning Minimum Time-Bounded Turing Machines
- On the hardness of approximating label-cover
- One-way functions and (im)perfect obfuscation
- Polynomially low error PCPs with \(\operatorname{polyloglog} n\) queries via modular composition
- Probabilistic Kolmogorov complexity with applications to average-case complexity
- Properly learning decision trees with queries is NP-hard
- Secret-sharing for \(\mathbf {NP}\)
- Synergy between circuit obfuscation and circuit minimization
- Toward efficient agnostic learning
- Witness encryption and its applications
- Worst-Case to Average-Case Reductions Revisited
- Zero Knowledge and Soundness Are Symmetric
This page was built for publication: Witness encryption and NP-hardness of learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296788)
