Pages that link to "Item:Q2867210"
From MaRDI portal
The following pages link to Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes (Q2867210):
Displayed 23 items.
- On the statistical leak of the GGH13 multilinear map and some variants (Q1633467) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- How to build time-lock encryption (Q1791669) (← links)
- Election control through social influence with unknown preferences (Q2019485) (← links)
- On subversion-resistant SNARKs (Q2039405) (← links)
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits (Q2145410) (← links)
- Succinct functional commitment for a large class of arithmetic circuits (Q2691602) (← links)
- On the Existence of Extractable One-Way Functions (Q2829449) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- On QA-NIZK in the BPK Model (Q5041171) (← links)
- A Unified Framework for Non-universal SNARKs (Q5087272) (← links)
- ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines (Q5087274) (← links)
- No-signaling linear PCPs (Q5915596) (← links)
- No-signaling linear PCPs (Q5925695) (← links)
- Rinocchio: SNARKs for ring arithmetic (Q6070447) (← links)
- (Q6081719) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable? (Q6134856) (← links)
- Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG (Q6157544) (← links)
- Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials (Q6168401) (← links)
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation (Q6169370) (← links)
- Non-interactive zero-knowledge from non-interactive batch arguments (Q6186697) (← links)
