The following pages link to zk-SNARK (Q34287):
Displaying 15 items.
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
- Proof-carrying data without succinct arguments (Q2120099) (← links)
- On succinct non-interactive arguments in relativized worlds (Q2170051) (← links)
- Families of SNARK-friendly 2-chains of elliptic curves (Q2170053) (← links)
- Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits (Q2799088) (← links)
- Scalable Zero Knowledge via Cycles of Elliptic Curves (Q2874542) (← links)
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion (Q2953796) (← links)
- Note on families of pairing-friendly elliptic curves with small embedding degree (Q3121464) (← links)
- On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
- Sublinear Zero-Knowledge Arguments for RAM Programs (Q5738888) (← links)
- On Cycles of Pairing-Friendly Elliptic Curves (Q5742695) (← links)
