How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge (Q2516524): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00145-013-9165-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2062945332
@@ Property / OpenAlex ID: W2062945332 / rank @@
+Normal rank
@@ Property / cites work @@
+Statistical zero-knowledge languages can be recognized in two rounds
+Normal rank
@@ Property / cites work @@
+A complete problem for statistical zero knowledge
@@ Property / cites work: A complete problem for statistical zero knowledge / rank @@
+Normal rank
@@ Property / cites work @@
+Noninteractive Zero-Knowledge
@@ Property / cites work: Noninteractive Zero-Knowledge / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2004
@@ Property / cites work: Mathematical Foundations of Computer Science 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of promise problems with applications to public-key cryptography
+Normal rank
@@ Property / cites work @@
+On relationships between statistical zero-knowledge proofs
+Normal rank
@@ Property / cites work @@
+Foundations of Cryptography
@@ Property / cites work: Foundations of Cryptography / 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 @@
+Q4542558
@@ Property / cites work: Q4542558 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4941874
@@ Property / cites work: Q4941874 / rank @@
+Normal rank
@@ Property / cites work @@
+The Knowledge Complexity of Interactive Proof Systems
+Normal rank
@@ Property / cites work @@
+Perfect Non-interactive Zero Knowledge for NP
@@ Property / cites work: Perfect Non-interactive Zero Knowledge for NP / rank @@
+Normal rank
@@ Property / cites work @@
+Inaccessible entropy
@@ Property / cites work: Inaccessible entropy / rank @@
+Normal rank
@@ Property / cites work @@
+Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
+Normal rank
@@ Property / cites work @@
+Local zero knowledge
@@ Property / cites work: Local zero knowledge / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect zero-knowledge arguments for NP using any one-way permutation
+Normal rank
@@ Property / cites work @@
+Zero knowledge with efficient provers
@@ Property / cites work: Zero knowledge with efficient provers / rank @@
+Normal rank
@@ Property / cites work @@
+An Equivalence Between Zero Knowledge and Commitments
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+The knowledge complexity of quadratic residuosity languages
+Normal rank
@@ Property / cites work @@
+Randomness-efficient non-interactive zero knowledge
+Normal rank
@@ Property / cites work @@
+Zero-knowledge against quantum attacks
@@ Property / cites work: Zero-knowledge against quantum attacks / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2516524