A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm (Q1261018): Difference between revisions

@@ Property / cites work @@
+Statistical zero-knowledge languages can be recognized in two rounds
+Normal rank
@@ Property / cites work @@
+Q3778673
@@ Property / cites work: Q3778673 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5750398
@@ Property / cites work: Q5750398 / rank @@
+Normal rank
@@ Property / cites work @@
+How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
+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 @@
+Minimum disclosure proofs of knowledge
@@ Property / cites work: Minimum disclosure proofs of knowledge / rank @@
+Normal rank
@@ Property / cites work @@
+Q3777938
@@ Property / cites work: Q3777938 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3780991
@@ Property / cites work: Q3780991 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of promise problems with applications to public-key cryptography
+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
@@ Property / cites work @@
+Q5751927
@@ Property / cites work: Q5751927 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3726006
@@ Property / cites work: Q3726006 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate formulas for some functions of prime numbers
+Normal rank