Nam Ngo
·
Last edited by Nam Ngo on Feb 6, 2025
Linked with GitHub
Contributed by

There is no commentSelect some text and then click Comment, or simply add a comment to this page from below to start a discussion.

FHE-FFT

WIP

Materials

TACEO's MHEGA blog [1]
Blind zk-SNARKs paper 2024 [2]
Diagonal Method in 4.2 [3]

Method 1 ("No-FFT" + No Bootstrapping FHE + Diagonal Method)

Just do DFT in the FHE way

Method 2 ("Split-FFT" with depth-2 FHE)

Last changed by

Nam Ngo

PPD and Where to find It?

PPD, or Private Proof Delegation, refers to the situation where a weak client, who holds some secret witness to a (public) statement, would like to generate a (public verifiable) zero-knowledge proof of the knowledge of the witness (and that it satisfies some relation), but not able to do so, due to resource constraint such as low computational power, shortage of power (battery life), or low memory. While computational power or battery life are somewhat able to circumvent, memory cap remains a hard constraint of such weak client.

Mar 5, 2025

Public Verifiable MPC

Secure Multiparty Computation (MPC) allows n parties P_1, \ldots, P_n to securely evaluate a joint function f(x_1, \ldots, x_n) while keeping the secret input x_i private to its owner P_i. MPC comes with two main flavors of security, namely Semi-honest and Active Security:

Feb 27, 2025