Sok: vector OLE-based zero-knowledge protocols

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Extending oblivious transfer with low communication via key-homomorphic PRFs
\(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
Stacked garbling for disjunctive zero-knowledge proofs
Efficient pseudorandom correlation generators from ring-LPN
Improved primitives for MPC over mixed arithmetic-binary circuits
Efficient protocols for oblivious linear function evaluation from ring-LWE
\textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
Garbled circuits with sublinear evaluator
Asymptotically quasi-optimal cryptography
Zero-knowledge proofs on secret-shared data via fully linear PCPs
Efficient pseudorandom correlation generators: silent OT extension and more
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
Multiparty Computation from Somewhat Homomorphic Encryption
A New Approach to Practical Active-Secure Two-Party Computation
Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge
Two Halves Make a Whole
Semi-homomorphic Encryption and Multiparty Computation
Improved Primitives for Secure Multiparty Integer Computation
LEGO for Two-Party Secure Computation
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
The knowledge complexity of interactive proof-systems
Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
Practical Homomorphic MACs for Arithmetic Circuits
Quadratic Span Programs and Succinct NIZKs without PCPs
SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)

This page was built for publication: Sok: vector OLE-based zero-knowledge protocols