zk-SNARK
From MaRDI portal
Software:34287
swMATH22495MaRDI QIDQ34287FDOQ34287
Author name not available (Why is that?)
Cited In (15)
- Sublinear zero-knowledge arguments for RAM programs
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- Proof-carrying data without succinct arguments
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- Note on families of pairing-friendly elliptic curves with small embedding degree
- On the (in)security of SNARKs in the presence of oracles
- Making the best of a leaky situation: zero-knowledge PCPs from leakage-resilient circuits
- Computational integrity with a public random string from quasi-linear PCPs
- Families of SNARK-friendly 2-chains of elliptic curves
- On succinct non-interactive arguments in relativized worlds
- Multikey fully homomorphic encryption and applications
- Scalable zero knowledge via cycles of elliptic curves
- Scalable zero knowledge via cycles of elliptic curves
- The hunting of the SNARK
- On Cycles of Pairing-Friendly Elliptic Curves
This page was built for software: zk-SNARK
