Which languages have 4-round zero-knowledge proofs? (Q421047): Difference between revisions

@@ Property / DOI @@
-.1007/s00145-010-9081-y
@@ Property / DOI: 10.1007/s00145-010-9081-y / rank @@
-Normal rank
@@ 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-010-9081-y
+Normal rank
@@ Property / OpenAlex ID @@
+W1983179654
@@ Property / OpenAlex ID: W1983179654 / rank @@
+Normal rank
@@ Property / cites work @@
+Statistical zero-knowledge languages can be recognized in two rounds
+Normal rank
@@ Property / cites work @@
+Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
+Normal rank
@@ Property / cites work @@
+Strict Polynomial-Time in Simulation and Extraction
+Normal rank
@@ Property / cites work @@
+Lower bounds for non-black-box zero knowledge
@@ Property / cites work: Lower bounds for non-black-box zero knowledge / rank @@
+Normal rank
@@ Property / cites work @@
+Derandomization in Cryptography
@@ Property / cites work: Derandomization in Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Advances in Cryptology – CRYPTO 2004
@@ Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5750398
@@ Property / cites work: Q5750398 / rank @@
+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 @@
+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 @@
+Q4950056
@@ Property / cites work: Q4950056 / rank @@
+Normal rank
@@ Property / cites work @@
+Round-optimal perfect zero-knowledge proofs
@@ Property / cites work: Round-optimal perfect zero-knowledge proofs / rank @@
+Normal rank
@@ Property / cites work @@
+On the existence of statistically hiding bit commitment schemes and fail-stop signatures
+Normal rank
@@ Property / cites work @@
+Q3210166
@@ Property / cites work: Q3210166 / rank @@
+Normal rank
@@ Property / cites work @@
+How to construct constant-round zero-knowledge proof systems for NP
+Normal rank
@@ Property / cites work @@
+On the Composition of Zero-Knowledge Proof Systems
+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 @@
+The Knowledge Complexity of Interactive Proof Systems
+Normal rank
@@ Property / cites work @@
+A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
+Normal rank
@@ Property / cites work @@
+On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
+Normal rank
@@ Property / cites work @@
+Q4249347
@@ Property / cites work: Q4249347 / rank @@
+Normal rank
@@ Property / cites work @@
+Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
+Normal rank
@@ Property / cites work @@
+Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
+Normal rank
@@ Property / cites work @@
+Q4314040
@@ Property / cites work: Q4314040 / rank @@
+Normal rank
@@ Property / cites work @@
+An Equivalence Between Zero Knowledge and Commitments
+Normal rank
@@ Property / cites work @@
+Private Coins versus Public Coins in Zero-Knowledge Proof Systems
+Normal rank
@@ Property / DOI @@
+.1007/S00145-010-9081-Y
@@ Property / DOI: 10.1007/S00145-010-9081-Y / rank @@
+Normal rank