Succinct NP Proofs from an Extractability Assumption (Q3507432): 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-540-69407-6_21
+Normal rank
@@ Property / OpenAlex ID @@
+W2137467444
@@ Property / OpenAlex ID: W2137467444 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2754165
@@ Property / cites work: Q2754165 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic checking of proofs
@@ Property / cites work: Probabilistic checking of proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
+Normal rank
@@ Property / cites work @@
+Universal Arguments and their Applications
@@ Property / cites work: Universal Arguments and their Applications / 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 @@
+Q4250776
@@ Property / cites work: Q4250776 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4035738
@@ Property / cites work: Q4035738 / rank @@
+Normal rank
@@ Property / cites work @@
+The Knowledge Complexity of Interactive Proof Systems
+Normal rank
@@ Property / cites work @@
+Q4249347
@@ Property / cites work: Q4249347 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Feasibility of Consistent Computations
@@ Property / cites work: On the Feasibility of Consistent Computations / rank @@
+Normal rank
@@ Property / cites work @@
+Necessary and sufficient conditions for collision-free hashing
+Normal rank
@@ Property / cites work @@
+A PCP characterization of NP with optimal amortized query complexity
+Normal rank