Indistinguishability obfuscation, range avoidance, and bounded arithmetic

Cites Work

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

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