Strict polynomial-time in simulation and extraction
From MaRDI portal
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)
Cited in
(15)- A black-box approach to post-quantum zero-knowledge in constant rounds
- On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits
- Lower bounds for non-black-box zero knowledge
- On the implausibility of constant-round public-coin zero-knowledge proofs
- On zero-knowledge with strict polynomial-time simulation and extraction from differing-input obfuscation for circuits
- On non-black-box simulation and the impossibility of approximate obfuscation
- Three-round public-coin bounded-auxiliary-input zero-knowledge arguments of knowledge
- Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries
- A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor
- The Knowledge Complexity of Interactive Proof Systems
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Fiat-Shamir transformation of multi-round interactive proofs
- Almost-total puzzles and their applications
- The black-box simulation barrier persists in a fully quantum world
- Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP
This page was built for publication: Strict polynomial-time in simulation and extraction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579210)
