Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (original) (raw)
Related papers
Sequential iteration of interactive arguments and an efficient zero-knowledge argument for NP
Lecture Notes in Computer Science, 1998
An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions
Journal of Cryptology, 1998
Notes on Computational Complexity Theory CPSC 468/568: Spring 2017
Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds
1989
Linear zero-knowledge---a note on efficient zero-knowledge proofs and arguments
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97, 1997
An epistemic characterization of zero knowledge
Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge - TARK '09, 2009
Lecture Notes on Computational Complexity
On the communication complexity of zero-knowledge proofs
Journal of Cryptology, 1993
On the Amortized Complexity of Zero-Knowledge Protocols
Journal of Cryptology, 2013
Impossibility and Feasibility Results for Zero Knowledge with Public Keys
Lecture Notes in Computer Science, 2005
Machine-Independent Complexity Theory
1990
Complexity Theory and the No Free Lunch Theorem
Search Methodologies, 2005
Abstract Some Results in Computational Complexity
2008
On Relationships between Statistical Zero-Knowledge Proofs
Journal of Computer and System Sciences, 2000
A Stronger Foundation for Computer Science and P=NP
2005
Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation
Journal of Cryptology, 1998
Robust Non-interactive Zero Knowledge
Lecture Notes in Computer Science, 2001
Concurrent Zero Knowledge Without Complexity Assumptions
Lecture Notes in Computer Science, 2006
On the principal impossibility to prove P=NP
arXiv: Computational Complexity, 2012
Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses
Theory of Computing Systems, 2012
Succinct NP Proofs from an Extractability Assumption
Lecture Notes in Computer Science, 2008
The consistency of ?P = NP? and related problems with fragments of number theory
Proceedings of the twelfth annual ACM symposium on Theory of computing - STOC '80, 1980
Constant-round perfect zero-knowledge computationally convincing protocols
Theoretical Computer Science, 1991
Contentwise Complexity of Inferences: An Evaluation of Arrow's Impossibility Theorem
2000
On the structure of the class NP
1996
The Knowledge Complexity of Interactive Proof Systems
SIAM Journal on Computing, 1989
Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions
2007
On Zero-Knowledge PCPs : Limitations , Simplifications , and Applications ∗
2015