An efficient ZK compiler from SIMD circuits to general circuits
From MaRDI portal
Publication:6655875
DOI10.1007/S00145-024-09531-4MaRDI QIDQ6655875
Xiao Wang, Yu Yu, Kang Yang, Geoffroy Couteau, Chenkai Weng, Haotian Chu, Dung Bui
Publication date: 27 December 2024
Published in: Journal of Cryptology (Search for Journal in Brave)
Cryptography (94A60) Networks and circuits as models of computation; circuit complexity (68Q06) Communication complexity, information complexity (68Q11)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Overdrive: making SPDZ great again
- SPARKs: succinct parallelizable arguments of knowledge
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Guaranteed output delivery comes free in honest majority MPC
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
- Proof-carrying data without succinct arguments
- Sublinear GMW-style compiler for MPC with preprocessing
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- Time- and space-efficient arguments from groups of unknown order
- Gemini: elastic SNARKs for diverse environments
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- Prover-Efficient Commit-and-Prove Zero-Knowledge SNARKs
- Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation
- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
- Multiparty Computation from Somewhat Homomorphic Encryption
- Linear Algebra with Sub-linear Zero-Knowledge Arguments
- Circuit partitioning with size and connection constraints
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- A note on efficient aggregate queries in sensor networks
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Non-interactive zero-knowledge proofs to multiple verifiers
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Nova: recursive zero-knowledge arguments from folding schemes
- On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
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)