SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
From MaRDI portal
Publication:2849388
DOI10.1007/978-3-642-40084-1_6zbMath1317.68050OpenAlexW2171337840MaRDI QIDQ2849388
Daniel Genkin, Alessandro Chiesa, Eran Tromer, Madars Virza, Eli Ben-Sasson
Publication date: 17 September 2013
Published in: Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40084-1_6
Related Items (60)
Confidential and efficient asset proof for bitcoin exchanges ⋮ Quantum Locally Testable Codes ⋮ \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions ⋮ On the (In)Security of SNARKs in the Presence of Oracles ⋮ 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 ⋮ ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines ⋮ 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 ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Rinocchio: SNARKs for ring arithmetic ⋮ Transparent batchable time-lock puzzles and applications to Byzantine consensus ⋮ 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 ⋮ MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity ⋮ 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 ⋮ The hunting of the SNARK ⋮ Impossibilities in succinct arguments: black-box extraction and more ⋮ Unnamed Item ⋮ An Introduction to the Use of zk-SNARKs in Blockchains ⋮ Fast Reed-Solomon Interactive Oracle Proofs of Proximity ⋮ Shorter arithmetization of nondeterministic computations ⋮ Trusted computing with addition machines. II ⋮ Sublinear Zero-Knowledge Arguments for RAM Programs ⋮ No-signaling linear PCPs ⋮ How to build time-lock encryption ⋮ No-signaling linear PCPs ⋮ Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits ⋮ 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 ⋮ Pinocchio-Based Adaptive zk-SNARKs and Secure/Correct Adaptive Function Evaluation ⋮ Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation ⋮ SNARKs for C ⋮ On succinct arguments and witness encryption from groups ⋮ Spartan: efficient and general-purpose zkSNARKs without trusted setup ⋮ Computational Integrity with a Public Random String from Quasi-Linear PCPs ⋮ TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures ⋮ Authenticated hash tables based on cryptographic accumulators
Uses Software
This page was built for publication: SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
