Round-optimal zero-knowledge proofs of knowledge for NP (Q362163): Difference between revisions

@@ Property / cites work @@
+The Knowledge Complexity of Interactive Proof Systems
+Normal rank
@@ Property / cites work @@
+Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
+Normal rank
@@ Property / cites work @@
+Q4318711
@@ Property / cites work: Q4318711 / rank @@
+Normal rank
@@ Property / cites work @@
+Foundations of Cryptography
@@ Property / cites work: Foundations of Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Q3210166
@@ Property / cites work: Q3210166 / rank @@
+Normal rank
@@ Property / cites work @@
+Strict Polynomial-Time in Simulation and Extraction
+Normal rank
@@ Property / cites work @@
+Definitions and properties of zero-knowledge proof systems
+Normal rank
@@ Property / cites work @@
+Lower bounds for non-black-box zero knowledge
@@ Property / cites work: Lower bounds for non-black-box zero knowledge / rank @@
+Normal rank
@@ Property / cites work @@
+On the Composition of Zero-Knowledge Proof Systems
+Normal rank
@@ Property / cites work @@
+Q4314040
@@ Property / cites work: Q4314040 / rank @@
+Normal rank
@@ Property / cites work @@
+Which Languages Have 4-Round Zero-Knowledge Proofs?
+Normal rank
@@ Property / cites work @@
+How to construct constant-round zero-knowledge proof systems for NP
+Normal rank
@@ Property / cites work @@
+Theory of Cryptography
@@ Property / cites work: Theory of Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Q4414268
@@ Property / cites work: Q4414268 / rank @@
+Normal rank