In this paper we present FLS-like transformations that work for non-interactive statistical zero-knowledge arguments in the common random string model. They allow to go from single-theorem to multi-theorem zero-knowledge and also preserve soundness, for both properties in the adaptive and non-adaptive case. Our first transformation is based on the general assumption that one-way permutations exist, while our second transformation uses lattice-based assumptions. Additionally, we define different possible soundness notions for non-interactive arguments and discuss their relationships.
Category / Keywords: cryptographic protocols / Non-interactive arguments, statistical zero-knowledge, soundness, transformation, one-way permutation, lattices, dual-mode commitments Date: received 1 Oct 2020 Contact author: marc fischlin at cryptoplexity de, felix rohrbach@cryptoplexity de Available format(s): PDF | BibTeX Citation Version: 20201006:093705 (All versions of this report) Short URL: ia.cr/2020/1204