A uniform-complexity treatment of encryption and zero-knowledge (Q1207696): Difference between revisions

@@ Property / cites work @@
+Q5750398
@@ Property / cites work: Q5750398 / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
+Normal rank
@@ Property / cites work @@
+How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
+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 @@
+Constant-round perfect zero-knowledge computationally convincing protocols
+Normal rank
@@ Property / cites work @@
+Q4038698
@@ Property / cites work: Q4038698 / 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 @@
+Definitions and properties of 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 @@
+The Notion of Security for Probabilistic Cryptosystems
+Normal rank
@@ Property / cites work @@
+Q5751927
@@ Property / cites work: Q5751927 / rank @@
+Normal rank
@@ Property / cites work @@
+Communication Theory of Secrecy Systems*
@@ Property / cites work: Communication Theory of Secrecy Systems* / rank @@
+Normal rank