Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
From MaRDI portal
Publication:6061364
DOI10.1007/978-3-031-30617-4_12MaRDI QIDQ6061364
Mathias Hall-Andersen, Gabriel Kaptchuk, Nicholas Spooner, Aarushi Goel
Publication date: 8 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Theory of compilers and interpreters (68N20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast modular transforms
- Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Stacked garbling for disjunctive zero-knowledge proofs
- \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation
- Stacked garbling. Garbled circuit proportional to longest execution path
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
- A compressed \(\varSigma \)-protocol theory for lattices
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- \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
- Secure multiparty computation with free branching
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Aurora: transparent succinct arguments for R1CS
- KVaC: key-value commitments for blockchains and beyond
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
- Interactive Oracle Proofs
- Universal circuits (Preliminary Report)
- The knowledge complexity of interactive proof-systems
- 1-out-of-n Signatures from a Variety of Keys
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Constant-round interactive proofs for delegating computation
- Online/Offline OR Composition of Sigma Protocols
- On the Size of Pairing-Based Non-interactive Arguments
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- A new approach to efficient non-malleable zero-knowledge
