Abstract: Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently attracted much attention. Existing solutions suffer from either significant prover overhead (i ...

both circuits represent the addition of two numbers, but the arithmetic circuit simply uses one built-in addition gate, and the boolean circuit achieves (4-bit) addition using only boolean operations.

This project studies methods for optimizing boolean circuits in the context of fully homomorphic encryption (FHE). With respect to encrypted computation and securing machine learning, the complexity ...