Indistinguishability obfuscation, range avoidance, and bounded arithmetic

Cites Work

Title not available (Why is that?)
Computational Complexity
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
Title not available (Why is that?)
Derandomizing Arthur-Merlin games using hitting sets
Infeasibility of instance compression and succinct PCPs for NP
Logical foundations of proof complexity
Three approaches to the quantitative definition of information^*
On the notion of infinite pseudorandom sequences
Title not available (Why is that?)
Title not available (Why is that?)
Does co-NP have short interactive proofs ?
Title not available (Why is that?)
Natural proofs
Pseudorandom generators without the XOR lemma
Candidate indistinguishability obfuscation and functional encryption for all circuits
Nondeterministic extensions of the strong exponential time hypothesis and consequences for non-reducibility
Algebrization
Title not available (Why is that?)
Bounded arithmetic and the polynomial hierarchy
Dual weak pigeonhole principle, Boolean complexity, and derandomization
Circuit lower bounds in bounded arithmetics
Approximate counting in bounded arithmetic
Circuit minimization problem
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
On the (im)possibility of obfuscating programs
One-Way Functions and (Im)perfect Obfuscation
Title not available (Why is that?)
Fragments of approximate counting
GGH15 beyond permutation branching programs: proofs, attacks, and candidates
Proof Complexity
Witness encryption and its applications
On Independence of Variants of the Weak Pigeonhole Principle
Strong co-nondeterministic lower bounds for NP cannot be proved feasibly
Formalizing randomized matching algorithms
Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
Indistinguishability obfuscation from LPN over $\mathbb{F}_p$, DLIN, and PRGs in $NC^0$
Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
Approximate counting by hashing in bounded arithmetic
Feasibly constructive proofs of succinct weak circuit lower bounds
Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic
Unprovability of circuit upper bounds in Cook's theory PV
Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
On succinct arguments and witness encryption from groups
Witness encryption and null-iO from evasive LWE
Polynomial time ultrapowers and the consistency of circuit lower bounds
Upper and lower Ramsey bounds in bounded arithmetic
Title not available (Why is that?)
Title not available (Why is that?)
How to Use Indistinguishability Obfuscation: Deniable Encryption, and More
Candidate witness encryption from lattice techniques

This page was built for publication: Indistinguishability obfuscation, range avoidance, and bounded arithmetic

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