Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
From MaRDI portal
Publication:778926
DOI10.1007/978-3-030-38471-5_12zbMath1453.94059OpenAlexW2941663220MaRDI QIDQ778926
Daniele Cozzo, Carsten Baum, Nigel P. Smart
Publication date: 21 July 2020
Full work available at URL: https://pure.au.dk/ws/files/172710289/2019_035.pdf
Related Items (14)
Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP ⋮ Honest majority MPC with abort with minimal online communication ⋮ MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK) ⋮ More efficient amortization of exact zero-knowledge proofs for LWE ⋮ Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) ⋮ Putting the online phase on a diet: covert security from short MACs ⋮ Mixed-technique multi-party computations composed of two-party computations ⋮ More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings ⋮ Secure multiparty computation from threshold encryption based on class groups ⋮ Toward practical lattice-based proof of knowledge from Hint-MLWE ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ On the Scaled Inverse of $(x^i-x^j)$ modulo Cyclotomic Polynomial of the form $\Phi_{p^s}(x)$ or $\Phi_{p^s q^t}(x)$ ⋮ The more the merrier: reducing the cost of large scale MPC ⋮ Actively secure setup for SPDZ
This page was built for publication: Using TopGear in overdrive: a more efficient ZKPoK for SPDZ