\textsf{Justvengers}: batched VOLE ZK disjunctions in O(R+B+C) communication
From MaRDI portal
Publication:7233228
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- \textsf{LogRobin++}: optimizing proofs of disjunctive statements in VOLE-based ZK
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- A new approach to practical active-secure two-party computation
- A probabilistic remark on algebraic program testing
- An efficient ZK compiler from SIMD circuits to general circuits
- Constant-Size Commitments to Polynomials and Their Applications
- Efficient pseudorandom correlation generators: silent OT extension and more
- Evaluating Branching Programs on Encrypted Data
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 1030984 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- scientific article; zbMATH DE number 7706037 (Why is no real title available?)
- Interactive line-point zero-knowledge with sublinear communication and linear computation
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
- Multiparty Computation from Somewhat Homomorphic Encryption
- Overdrive: making SPDZ great again
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
- Semi-homomorphic encryption and multiparty computation
- Sok: vector OLE-based zero-knowledge protocols
- Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
- Stacked garbling for disjunctive zero-knowledge proofs
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- Succinct arguments for RAM programs via projection codes
- Succinct non-interactive arguments via linear interactive proofs
- The knowledge complexity of interactive proof-systems
- Toward malicious constant-rate 2PC via arithmetic garbling
- Zero-knowledge RAM: doubly efficient and black-box
This page was built for publication: \textsf{Justvengers}: batched VOLE ZK disjunctions in \(\mathcal{O}(R+B+C)\) communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233228)
