Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs (Q2799089): 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/978-3-662-49099-0_2
+Normal rank
@@ Property / OpenAlex ID @@
+W2291472021
@@ Property / OpenAlex ID: W2291472021 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Nullstellensatz
@@ Property / cites work: Combinatorial Nullstellensatz / rank @@
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+Probabilistic checking of proofs
@@ Property / cites work: Probabilistic checking of proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Non-deterministic exponential time has two-prover interactive protocols
+Normal rank
@@ Property / cites work @@
+Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
+Normal rank
@@ Property / cites work @@
+Q4318711
@@ Property / cites work: Q4318711 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5750398
@@ Property / cites work: Q5750398 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+On the concrete efficiency of probabilistically-checkable proofs
+Normal rank
@@ Property / cites work @@
+Robust pcps of proximity, shorter pcps and applications to coding
+Normal rank
@@ Property / cites work @@
+Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
+Normal rank
@@ Property / cites work @@
+Short PCPs with Polylog Query Complexity
@@ Property / cites work: Short PCPs with Polylog Query Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Short PCPs with Projection Queries
@@ Property / cites work: Short PCPs with Projection Queries / rank @@
+Normal rank
@@ Property / cites work @@
+The PCP theorem by gap amplification
@@ Property / cites work: The PCP theorem by gap amplification / rank @@
+Normal rank
@@ Property / cites work @@
+Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
+Normal rank
@@ Property / cites work @@
+Q4318695
@@ Property / cites work: Q4318695 / rank @@
+Normal rank
@@ Property / cites work @@
+The knowledge complexity of interactive proof-systems
+Normal rank
@@ Property / cites work @@
+Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
+Normal rank
@@ Property / cites work @@
+Small PCPs with low query complexity
@@ Property / cites work: Small PCPs with low query complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Zero-Knowledge Proofs from Secure Multiparty Computation
+Normal rank
@@ Property / cites work @@
+On Efficient Zero-Knowledge PCPs
@@ Property / cites work: On Efficient Zero-Knowledge PCPs / rank @@
+Normal rank
@@ Property / cites work @@
+Interactive PCP
@@ Property / cites work: Interactive PCP / rank @@
+Normal rank
@@ Property / cites work @@
+Q4527017
@@ Property / cites work: Q4527017 / rank @@
+Normal rank
@@ Property / cites work @@
+A one-round, two-prover, zero-knowledge protocol for NP
+Normal rank
@@ Property / cites work @@
+Algebraic methods for interactive proof systems
@@ Property / cites work: Algebraic methods for interactive proof systems / rank @@
+Normal rank
@@ Property / cites work @@
+Languages with Efficient Zero-Knowledge PCPs are in SZK
+Normal rank
@@ Property / cites work @@
+Polylogarithmic two-round argument systems
@@ Property / cites work: Polylogarithmic two-round argument systems / rank @@
+Normal rank
@@ Property / cites work @@
+Nearly-linear size holographic proofs
@@ Property / cites work: Nearly-linear size holographic proofs / rank @@
+Normal rank
@@ Property / cites work @@
+IP = PSPACE
@@ Property / cites work: IP = PSPACE / rank @@
+Normal rank
@@ Property / cites work @@
+Q4938652
@@ Property / cites work: Q4938652 / rank @@
+Normal rank