SNARKs for C

swMATH14604MaRDI QIDQ26503FDOQ26503

Author name not available (Why is that?)

Described by source

• Snarks for C: verifying program executions succinctly and in zero knowledge

Cited In (28)

• Authenticated hash tables based on cryptographic accumulators
• Sublinear zero-knowledge arguments for RAM programs
• Confidential and efficient asset proof for bitcoin exchanges
• TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
• Trusted computing with addition machines. II
• Efficient non-interactive zero-knowledge proofs in cross-domains without trusted setup
• How to build time-lock encryption
• MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
• Aurora: transparent succinct arguments for R1CS
• Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
• \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
• \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
• On the (in)security of SNARKs in the presence of oracles
• BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
• On subversion-resistant SNARKs
• Making the best of a leaky situation: zero-knowledge PCPs from leakage-resilient circuits
• Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
• Pinocchio-based adaptive zk-SNARKs and secure/correct adaptive function evaluation
• Computational integrity with a public random string from quasi-linear PCPs
• Fast Reed-Solomon interactive oracle proofs of proximity
• No-signaling linear PCPs
• Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
• Shorter arithmetization of nondeterministic computations
• Scalable zero knowledge via cycles of elliptic curves
• The hunting of the SNARK
• Arya: nearly linear-time zero-knowledge proofs for correct program execution
• An introduction to the use of zk-SNARKs in blockchains
• Libra: succinct zero-knowledge proofs with optimal prover computation

This page was built for software: SNARKs for C