View article

In this work, we explore the question of simultaneous privacy and soundness amplification for non-interactive zero-knowledge argument systems (NIZK). We show that any sound and zero-knowledge NIZK candidate satisfying , for any constant , can be turned into a computationally sound and zero-knowledge candidate with the only extra assumption of a subexponentially secure public-key encryption.

We develop novel techniques to leverage the use of leakage simulation lemma (Jetchev-Peitzrak TCC 2014) to argue amplification. A crucial component of our result is a new notion for secret sharing instances. We believe that this may be of independent interest.

To achieve this result we analyze following two transformations:

• Parallel Repetition: We show that using parallel repetition any sound and zero-knowledge candidate can be turned into (roughly) sound and …