Statistical zero-knowledge languages can be recognized in two rounds (Q808692): Difference between revisions

@@ Property / author @@
-Johan T. Håstad
@@ Property / author: Johan T. Håstad / rank @@
-Normal rank
@@ Property / author @@
+Johan T. Håstad
@@ Property / author: Johan T. Håstad / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
+Normal rank
@@ Property / cites work @@
+Does co-NP have short interactive proofs ?
@@ Property / cites work: Does co-NP have short interactive proofs ? / rank @@
+Normal rank
@@ Property / cites work @@
+Q5750398
@@ Property / cites work: Q5750398 / rank @@
+Normal rank
@@ Property / cites work @@
+Universal classes of hash functions
@@ Property / cites work: Universal classes of hash functions / rank @@
+Normal rank
@@ Property / cites work @@
+The knowledge complexity of interactive proof-systems
+Normal rank
@@ Property / cites work @@
+The Knowledge Complexity of Interactive Proof Systems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:808692