Indistinguishability obfuscation, range avoidance, and bounded arithmetic
From MaRDI portal
(Redirected from Publication:6499286)
Cites work
- Algebrization: a new barrier in complexity theory
- Approximate counting by hashing in bounded arithmetic
- Approximate counting in bounded arithmetic
- Bounded arithmetic and the polynomial hierarchy
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate witness encryption from lattice techniques
- Circuit lower bounds in bounded arithmetics
- Circuit minimization problem
- Computational Complexity
- Consistency of circuit lower bounds with bounded theories
- Derandomizing Arthur-Merlin games using hitting sets
- Does co-NP have short interactive proofs ?
- Dual weak pigeonhole principle, Boolean complexity, and derandomization
- Feasibly constructive proofs of succinct weak circuit lower bounds
- Formalizing randomized matching algorithms
- Fragments of approximate counting
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
- How to use indistinguishability obfuscation: deniable encryption, and more
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 4059391 (Why is no real title available?)
- scientific article; zbMATH DE number 3557241 (Why is no real title available?)
- scientific article; zbMATH DE number 1559537 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 819737 (Why is no real title available?)
- scientific article; zbMATH DE number 7250147 (Why is no real title available?)
- scientific article; zbMATH DE number 3305097 (Why is no real title available?)
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Infeasibility of instance compression and succinct PCPs for NP
- Logical foundations of proof complexity
- Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Natural proofs
- Nondeterministic extensions of the strong exponential time hypothesis and consequences for non-reducibility
- On Independence of Variants of the Weak Pigeonhole Principle
- On succinct arguments and witness encryption from groups
- On the (im)possibility of obfuscating programs
- On the notion of infinite pseudorandom sequences
- One-Way Functions and (Im)perfect Obfuscation
- Polynomial time ultrapowers and the consistency of circuit lower bounds
- Proof Complexity
- Pseudorandom generators without the XOR lemma
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Strong co-nondeterministic lower bounds for NP cannot be proved feasibly
- Three approaches to the quantitative definition of information*
- Unprovability of circuit upper bounds in Cook's theory PV
- Upper and lower Ramsey bounds in bounded arithmetic
- Witness encryption and its applications
- Witness encryption and null-iO from evasive LWE
Cited in
(7)- Pseudorandom obfuscation and applications
- A qubit, a coin, and an advice string walk into a relational problem
- Range avoidance for low-depth circuits and connections to pseudorandomness
- Towards general-purpose program obfuscation via local mixing
- Oblivious complexity classes revisited: lower bounds and hierarchies
- Lower bounds on the overhead of indistinguishability obfuscation
- Avoiding range via Turán-type bounds
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)
