Strict polynomial-time in simulation and extraction
From MaRDI portal
Publication:3579210
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited in
(13)- On the implausibility of constant-round public-coin zero-knowledge proofs
- The Knowledge Complexity of Interactive Proof Systems
- A black-box approach to post-quantum zero-knowledge in constant rounds
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Fiat-Shamir transformation of multi-round interactive proofs
- On zero-knowledge with strict polynomial-time simulation and extraction from differing-input obfuscation for circuits
- On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits
- Three-round public-coin bounded-auxiliary-input zero-knowledge arguments of knowledge
- Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP
- Lower bounds for non-black-box zero knowledge
- On non-black-box simulation and the impossibility of approximate obfuscation
- A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor
- Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries
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)
