Hard languages in NP coNP and NIZK proofs from unstructured hardness

Cites Work

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

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