MozZ₂^karella: efficient vector-OLE and zero-knowledge proofs over Z₂^k
From MaRDI portal
Publication:6166955
Recommendations
- scientific article; zbMATH DE number 7706037
- scientific article; zbMATH DE number 1302863
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Zero-knowledge proofs from secure multiparty computation
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
Cites work
- \(\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
- Constrained pseudorandom functions and their applications
- Extending oblivious transfer with low communication via key-homomorphic PRFs
- Functional signatures and pseudorandom functions
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- New Algorithms for Learning in Presence of Errors
- Scalable zero knowledge with no trusted setup
- Secure arithmetic computation with constant computational overhead
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
Cited in
(24)- Actively secure half-gates with minimum overhead under duplex networks
- Sok: vector OLE-based zero-knowledge protocols
- A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions
- Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato}
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
- ZK-for-Z2K: MPC-in-the-head zero-knowledge proofs for \(\mathbb{Z}_{2^k}\)
- \textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head
- Toward malicious constant-rate 2PC via arithmetic garbling
- The hardness of LPN over any integer ring and field for PCG applications
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
- \textsf{Zinc}: succinct arguments with small arithmetization overheads from IOPs of proximity to the integers
- Efficient pseudorandom correlation generators over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Polynomial commitments for Galois rings and applications to SNARKs over \(\mathbb{Z}_{2^k}\)
- Low-bandwidth mixed arithmetic in VOLE-based ZK from low-degree PRGs
- One tree to rule them all: optimizing GGM trees and OWFs for post-quantum signatures
- 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
- Constrained pseudorandom functions for inner-product predicates from weaker assumptions
- Actively secure half-gates with minimum overhead under duplex networks
- Fast pseudorandom correlation functions from sparse LPN
- Pseudorandom correlation functions for garbled circuits
- \textsf{Justvengers}: batched VOLE ZK disjunctions in \(\mathcal{O}(R+B+C)\) communication
- Tunable zero-knowledge proof of inference in machine learning via protocols over \(\mathbb{Z}_{2^k} \)
This page was built for publication: Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166955)
