Strict polynomial-time in simulation and extraction

DOI10.1145/509907.509979zbMATH Open1192.68343OpenAlexW2075455730MaRDI QIDQ3579210FDOQ3579210

Authors Boaz Barak, Yehuda Lindell 

Publication date 5 August 2010

Published in Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/509907.509979

Mathematics Subject Classification ID

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)

• 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
• 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
• Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP
• On non-black-box simulation and the impossibility of approximate obfuscation
• 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
• Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
• 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

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)