The following pages link to Geppetto (Q43502):
Displaying 15 items.
- (Q47496) (redirect page) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Verification protocols with sub-linear communication for polynomial matrix operations (Q1994891) (← links)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits (Q2145410) (← links)
- A PCP theorem for interactive proofs and applications (Q2170038) (← links)
- Aurora: transparent succinct arguments for R1CS (Q2292641) (← links)
- Libra: succinct zero-knowledge proofs with optimal prover computation (Q2304944) (← links)
- Verifiable Multi-party Computation with Perfectly Private Audit Trail (Q2822682) (← links)
- MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity (Q2958119) (← links)
- Pinocchio-Based Adaptive zk-SNARKs and Secure/Correct Adaptive Function Evaluation (Q4975176) (← links)
- ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines (Q5087274) (← links)
- Sublinear Zero-Knowledge Arguments for RAM Programs (Q5738888) (← links)
