An efficient ZK compiler from SIMD circuits to general circuits

DOI10.1007/S00145-024-09531-4MaRDI QIDQ6655875zbMATH OpenFDO

Authors Dung Bui, Haotian Chu, Geoffroy Couteau, Xiao Wang, Chenkai Weng, Kang Yang, Yu Yu

Publication date 27 December 2024

Published in Journal of Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00145-024-09531-4

zbMATH Keywords

general compilerSigma-protocolSIMD ZKVOLE-based ZKzero-knowledge proof

Mathematics Subject Classification ID

Networks and circuits as models of computation; circuit complexity (68Q06) Communication complexity, information complexity (68Q11) Cryptography (94A60)

Recommendations

• Ligero: lightweight sublinear arguments without a trusted setup
• Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• A compressed \(\varSigma \)-protocol theory for lattices
• Scalable zero knowledge via cycles of elliptic curves

Cites work

• \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
• \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
• A note on efficient aggregate queries in sensor networks
• Circuit partitioning with size and connection constraints
• Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
• Gemini: elastic SNARKs for diverse environments
• Guaranteed output delivery comes free in honest majority MPC
• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• HyperPlonk: Plonk with linear-time prover and high-degree custom gates
• Linear Algebra with Sub-linear Zero-Knowledge Arguments
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Multiparty Computation from Somewhat Homomorphic Encryption
• Non-interactive zero-knowledge proofs to multiple verifiers
• Nova: recursive zero-knowledge arguments from folding schemes
• On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
• Overdrive: making SPDZ great again
• Proof-carrying data without succinct arguments
• Prover-efficient commit-and-prove zero-knowledge SNARKs
• Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
• Quadratic span programs and succinct NIZKs without PCPs
• Recursive composition and bootstrapping for SNARKs and proof-carrying data
• SPARKs: succinct parallelizable arguments of knowledge
• Sublinear GMW-style compiler for MPC with preprocessing
• Succinct arguments from multi-prover interactive proofs and their efficiency benefits
• Time- and space-efficient arguments from groups of unknown order
• Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
• Zero-knowledge proofs on secret-shared data via fully linear PCPs

Cited in

(3)

• Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
• Bounded verification for finite-field-blasting. In a compiler for zero knowledge proofs
• \textsf{Justvengers}: batched VOLE ZK disjunctions in \(\mathcal{O}(R+B+C)\) communication

This page was built for publication: An efficient ZK compiler from SIMD circuits to general circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655875)