Snarks for C: verifying program executions succinctly and in zero knowledge
From MaRDI portal
Recommendations
- Arya: nearly linear-time zero-knowledge proofs for correct program execution
- Scalable zero knowledge via cycles of elliptic curves
- Scalable zero knowledge via cycles of elliptic curves
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Quadratic span programs and succinct NIZKs without PCPs
Cited in
(91)- Confidential and efficient asset proof for bitcoin exchanges
- Arya: nearly linear-time zero-knowledge proofs for correct program execution
- Scalable zero knowledge via cycles of elliptic curves
- The hunting of the SNARK
- Trusted computing with addition machines. II
- How to build time-lock encryption
- On subversion-resistant SNARKs
- Transparent SNARKs from DARK compilers
- SPARKs: succinct parallelizable arguments of knowledge
- Stacked garbling for disjunctive zero-knowledge proofs
- Boosting verifiable computation on encrypted data
- On succinct arguments and witness encryption from groups
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
- Efficient proof composition for verifiable computation
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- Authenticated hash tables based on cryptographic accumulators
- SNARKs for C
- Making the best of a leaky situation: zero-knowledge PCPs from leakage-resilient circuits
- Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- On the (in)security of SNARKs in the presence of oracles
- An introduction to the use of zk-SNARKs in blockchains
- Quantum locally testable codes
- Shorter arithmetization of nondeterministic computations
- Pinocchio-based adaptive zk-SNARKs and secure/correct adaptive function evaluation
- Fast Reed-Solomon interactive oracle proofs of proximity
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
- Computational integrity with a public random string from quasi-linear PCPs
- Sublinear zero-knowledge arguments for RAM programs
- No-signaling linear PCPs
- No-signaling linear PCPs
- PrORAM
- Zero knowledge proofs towards verifiable decentralized AI pipelines
- An efficient identity tracing scheme for blockchain-based systems
- A survey of elliptic curves for proof systems
- Sok: vector OLE-based zero-knowledge protocols
- Rinocchio: SNARKs for ring arithmetic
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
- scientific article; zbMATH DE number 7746256 (Why is no real title available?)
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Practical sublinear proofs for R1CS from lattices
- Resumable zero-knowledge for circuits from symmetric key primitives
- Function-Dependent Commitments for Verifiable Multi-party Computation
- Witness encryption from smooth projective hashing system
- Obtaining simulation extractable NIZKs in the updatable CRS model generically
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
- Efficient proof of RAM programs from any public-coin zero-knowledge system
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- A universally composable non-interactive aggregate cash system
- Short-lived zero-knowledge proofs and signatures
- Succinct arguments for RAM programs via projection codes
- Proofs for inner pairing products and applications
- Updatable NIZKs from non-interactive zaps
- Orion: zero knowledge proof with linear prover time
- Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II
- Impossibilities in succinct arguments: black-box extraction and more
- Accountable storage
- Distilling Constraints in Zero-Knowledge Protocols
- Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition
- Secure formation of public parameters and elimination of vulnerabilities of zero-knowledge succint non-interactive arguments of knowledge
- Polynomial IOPs for memory consistency checks in zero-knowledge virtual machines
- From polynomial IOP and commitments to non-malleable zkSNARKs
- Verifiable isogeny walks: towards an isogeny-based postquantum VDF
- Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
- \textsf{Jolt}: SNARKs for virtual machines via lookups
- Adaptively sound zero-knowledge SNARKs for UP
- Mangrove: a scalable framework for folding-based SNARKs
- HyperNova: recursive arguments for customizable constraint systems
- zk-Bench: a toolset for comparative evaluation and performance benchmarking of SNARKs
- How to share an NP statement or combiners for zero-knowledge proofs
- That's AmorE: amortized efficiency for pairing delegation
- Polynomial commitments for Galois rings and applications to SNARKs over \(\mathbb{Z}_{2^k}\)
- SNARKs for virtual machines are non-malleable
- zk-SNARK-based data privacy method
- Efficiency analysis of cryptographic algorithms for applications in zk-SNARK
- Efficiency measurement system for zk-SNARK circuits internal representation
- \textsf{LogRobin++}: optimizing proofs of disjunctive statements in VOLE-based ZK
- MuxProofs: succinct arguments for machine computation from vector lookups
- \textit{Ceno}: non-uniform, segment and parallel zero-knowledge virtual machine
- Scalable zkSNARKs for matrix computations. A generic framework for verifiable deep learning
- Samaritan: linear-time prover SNARK from new multilinear polynomial commitments
- Pairing-based batch arguments for NP with a linear-size CRS
- Linear-time accumulation schemes
- Provably memory-hard proofs of work with memory-easy verification
- How to make rational arguments practical and extractable
- Ba\textit{loo}: algebraic lookup arguments
This page was built for publication: Snarks for C: verifying program executions succinctly and in zero knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849388)
