Tunable zero-knowledge proof of inference in machine learning via protocols over Z₂^k

DOI10.1007/978-3-032-22931-1_12MaRDI QIDQ7349002zbMATH OpenFDO

Authors Yi Kuang, Fuchun Lin, Chaoping Xing

Publication date 15 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-22931-1_12

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
• A new approach to practical active-secure two-party computation
• Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions
• More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
• 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}\)
• Semi-homomorphic encryption and multiparty computation
• Time-optimal interactive proofs for circuit evaluation

This page was built for publication: Tunable zero-knowledge proof of inference in machine learning via protocols over \(\mathbb{Z}_{2^k} \)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349002)