Sok: vector OLE-based zero-knowledge protocols
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 176562 (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?)
- A new approach to practical active-secure two-party computation
- Asymptotically quasi-optimal cryptography
- Constant-overhead secure computation of Boolean circuits using preprocessing
- Efficient protocols for oblivious linear function evaluation from ring-LWE
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Extending oblivious transfer with low communication via key-homomorphic PRFs
- Garbled circuits with sublinear evaluator
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Improved primitives for MPC over mixed arithmetic-binary circuits
- Improved primitives for secure multiparty integer computation
- LEGO for Two-Party Secure Computation
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical homomorphic MACs for arithmetic circuits
- Privacy-free garbled circuits with applications to efficient zero-knowledge
- Quadratic span programs and succinct NIZKs without PCPs
- Semi-homomorphic encryption and multiparty computation
- Snarks for C: verifying program executions succinctly and in zero knowledge
- SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
- Stacked garbling for disjunctive zero-knowledge proofs
- The knowledge complexity of interactive proof-systems
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
Cited in
(9)- Code-based zero-knowledge from VOLE-in-the-head and their applications: simpler, faster, and smaller
- \textsf{LogRobin++}: optimizing proofs of disjunctive statements in VOLE-based ZK
- Interactive line-point zero-knowledge with sublinear communication and linear computation
- Succinct line-point zero-knowledge arguments from homomorphic secret sharing
- \textsf{Justvengers}: batched VOLE ZK disjunctions in \(\mathcal{O}(R+B+C)\) communication
- Stationary syndrome decoding for improved PCGs
- Low-bandwidth mixed arithmetic in VOLE-based ZK from low-degree PRGs
- Cheater identification on a budget: MPC with identifiable abort from pairwise MACs
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
This page was built for publication: Sok: vector OLE-based zero-knowledge protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6063131)
