zk-SNARK
From MaRDI portal
Software:34287
swMATH22495MaRDI QIDQ34287FDOQ34287
Author name not available (Why is that?)
Cited In (15)
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- Proof-carrying data without succinct arguments
- Computational Integrity with a Public Random String from Quasi-Linear PCPs
- Multikey Fully Homomorphic Encryption and Applications
- Note on families of pairing-friendly elliptic curves with small embedding degree
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
- Families of SNARK-friendly 2-chains of elliptic curves
- On succinct non-interactive arguments in relativized worlds
- Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits
- On the (In)Security of SNARKs in the Presence of Oracles
- Scalable zero knowledge via cycles of elliptic curves
- The hunting of the SNARK
- On Cycles of Pairing-Friendly Elliptic Curves
- Sublinear Zero-Knowledge Arguments for RAM Programs
This page was built for software: zk-SNARK
