Hard languages in NP $\cap$ coNP and NIZK proofs from unstructured hardness

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Query complexity, or why is it difficult to separate $NP^ A\cap coNP^ A$ from $P^ A$ by random oracles A?
The complexity of stochastic games
The random oracle hypothesis is false
Hardness vs randomness
Certifying trapdoor permutations, revisited
A subexponential randomized algorithm for the simple stochastic game problem
Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
Non-interactive zero knowledge from sub-exponential DDH
Feistel structures for MPC, and more
On succinct non-interactive arguments in relativized worlds
Noninteractive zero knowledge for NP from (Plain) Learning With Errors
Non-interactive zero knowledge \textit{proofs} in the random oracle model
Perfect Structure on the Edge of Chaos
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
On Invertible Sampling and Adaptive Security
The random oracle methodology, revisited
On Constructing 1-1 One-Way Functions
Relativized cryptography
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
The Journey from NP to TFNP Hardness
An Average-Case Depth Hierarchy Theorem for Boolean Circuits
Structure Versus Hardness Through the Obfuscation Lens
Fiat-Shamir: from practice to theory
ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
Unconditional Characterizations of Non-interactive Zero-Knowledge
Non-interactive Zaps and New Techniques for NIZK
Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs
Theory of Cryptography
Can PPAD hardness be based on standard cryptographic assumptions?

This page was built for publication: Hard languages in NP $\cap$ coNP and NIZK proofs from unstructured hardness

Hard languages in NP \(\cap\) coNP and NIZK proofs from unstructured hardness