The following pages link to SNARKs for C (Q26503):
Displaying 28 items.
- Authenticated hash tables based on cryptographic accumulators (Q262258) (← links)
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- Confidential and efficient asset proof for bitcoin exchanges (Q1615407) (← links)
- Arya: nearly linear-time zero-knowledge proofs for correct program execution (Q1633476) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Trusted computing with addition machines. II (Q1745689) (← links)
- How to build time-lock encryption (Q1791669) (← links)
- On subversion-resistant SNARKs (Q2039405) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions (Q2139630) (← links)
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits (Q2145410) (← links)
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs (Q2163394) (← links)
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions (Q2170057) (← links)
- Efficient non-interactive zero-knowledge proofs in cross-domains without trusted setup (Q2289212) (← links)
- Aurora: transparent succinct arguments for R1CS (Q2292641) (← links)
- Libra: succinct zero-knowledge proofs with optimal prover computation (Q2304944) (← links)
- Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits (Q2799088) (← links)
- Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation (Q2822680) (← links)
- MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity (Q2958119) (← links)
- On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
- An Introduction to the Use of zk-SNARKs in Blockchains (Q3294800) (← links)
- Pinocchio-Based Adaptive zk-SNARKs and Secure/Correct Adaptive Function Evaluation (Q4975176) (← links)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Q5002680) (← links)
- ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines (Q5087274) (← links)
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
- Sublinear Zero-Knowledge Arguments for RAM Programs (Q5738888) (← links)
- No-signaling linear PCPs (Q5925695) (← links)
