On the communication complexity of zero-knowledge proofs (Q1261016): Difference between revisions

@@ Property / author @@
-Joan. Boyar
@@ Property / author: Joan. Boyar / rank @@
-Normal rank
@@ Property / author @@
-Carstent Lund
@@ Property / author: Carstent Lund / rank @@
-Normal rank
@@ Property / author @@
+Joan. Boyar
@@ Property / author: Joan. Boyar / rank @@
+Normal rank
@@ Property / author @@
+Carstent Lund
@@ Property / author: Carstent Lund / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q62472241
@@ Property / Wikidata QID: Q62472241 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3778673
@@ Property / cites work: Q3778673 / rank @@
+Normal rank
@@ Property / cites work @@
+Subquadratic zero-knowledge
@@ Property / cites work: Subquadratic zero-knowledge / rank @@
+Normal rank
@@ Property / cites work @@
+A discrete logarithm implementation of perfect zero-knowledge blobs
+Normal rank
@@ Property / cites work @@
+Minimum disclosure proofs of knowledge
@@ Property / cites work: Minimum disclosure proofs of knowledge / rank @@
+Normal rank
@@ Property / cites work @@
+Zero-Knowledge Simulation of Boolean Circuits
@@ Property / cites work: Zero-Knowledge Simulation of Boolean Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Q3777938
@@ Property / cites work: Q3777938 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3826475
@@ Property / cites work: Q3826475 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Short propositional formulas represent nondeterministic computations
+Normal rank
@@ Property / cites work @@
+Zero-knowledge proofs of identity
@@ Property / cites work: Zero-knowledge proofs of identity / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+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 @@
+Probabilistic encryption
@@ Property / cites work: Probabilistic encryption / rank @@
+Normal rank
@@ Property / cites work @@
+The Knowledge Complexity of Interactive Proof Systems
+Normal rank