Strict polynomial-time in simulation and extraction

DOI10.1145/509907.509979zbMath1192.68343MaRDI QIDQ3579210

Yehuda Lindell, Boaz Barak

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

68Q25: Analysis of algorithms and problem complexity

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

Related Items

Lower bounds for non-black-box zero 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