Stacked garbling for disjunctive zero-knowledge proofs (Q2055668): 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-030-45727-3_19
+Normal rank
@@ Property / OpenAlex ID @@
+W3012999251
@@ Property / OpenAlex ID: W3012999251 / rank @@
+Normal rank
@@ Property / cites work @@
+More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
+Normal rank
@@ Property / cites work @@
+Scalable zero knowledge with no trusted setup
@@ Property / cites work: Scalable zero knowledge with no trusted setup / rank @@
+Normal rank
@@ Property / cites work @@
+SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
+Normal rank
@@ Property / cites work @@
+Aurora: transparent succinct arguments for R1CS
@@ Property / cites work: Aurora: transparent succinct arguments for R1CS / rank @@
+Normal rank
@@ Property / cites work @@
+Q4318711
@@ Property / cites work: Q4318711 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4940695
@@ Property / cites work: Q4940695 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4231909
@@ Property / cites work: Q4231909 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved OR-Composition of Sigma-Protocols
@@ Property / cites work: Improved OR-Composition of Sigma-Protocols / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230367
@@ Property / cites work: Q4230367 / rank @@
+Normal rank
@@ Property / cites work @@
+Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge
+Normal rank
@@ Property / cites work @@
+Quadratic Span Programs and Succinct NIZKs without PCPs
+Normal rank
@@ Property / cites work @@
+One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
+Normal rank
@@ Property / cites work @@
+The knowledge complexity of interactive 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 @@
+On the Size of Pairing-Based Non-interactive Arguments
+Normal rank
@@ Property / cites work @@
+Q3549593
@@ Property / cites work: Q3549593 / rank @@
+Normal rank
@@ Property / cites work @@
+Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
+Normal rank
@@ Property / cites work @@
+Improved Garbled Circuit: Free XOR Gates and Applications
+Normal rank
@@ Property / cites work @@
+How to Garble RAM Programs?
@@ Property / cites work: How to Garble RAM Programs? / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+Q3210171
@@ Property / cites work: Q3210171 / rank @@
+Normal rank
@@ Property / cites work @@
+Libra: succinct zero-knowledge proofs with optimal prover computation
+Normal rank
@@ Property / cites work @@
+Two Halves Make a Whole
@@ Property / cites work: Two Halves Make a Whole / rank @@
+Normal rank