2 research outputs found
SNARGs for Bounded Depth Computations from Sub-Exponential LWE
We construct a succinct non-interactive publicly-verifiable delegation scheme for any log-space uniform circuit under the sub-exponential assumption, a standard assumption that is believed to be post-quantum secure. For a circuit of size and depth , the prover runs in time poly, and the verifier runs in time , where is the input size. We obtain this result by slightly modifying the protocol and proving that the Fiat-Shamir heuristic is sound when applied to this modified protocol. We build on the recent works of Canetti et al. (STOC 2019) and Peikert and Shiehian (Crypto 2020), which prove the soundness of the Fiat-Shamir heuristic when applied to a specific (non-succinct) zero-knowledge protocol.
As a corollary, by the work of Choudhuri et al. (STOC 2019), this implies that the complexity class is hard (on average) under the sub-exponential assumption, assuming that with variables is hard (on average)
Non-Interactive Batch Arguments for NP from Standard Assumptions
We study the problem of designing *non-interactive batch arguments* for . Such an argument system allows an efficient prover to prove multiple statements, with size smaller than the combined witness length.
We provide the first construction of such an argument system for in the common reference string model based on standard cryptographic assumptions. Prior works either require non-standard assumptions (or the random oracle model) or can only support private verification.
At the heart of our result is a new *dual mode* interactive batch argument system for . We show how to apply the correlation-intractability framework for Fiat-Shamir -- that has primarily been applied to proof systems -- to such interactive arguments