Zero-knowledge and succinctness are two important properties that arise in the study of non-interactive arguments. Previously, Kitagawa et al. (TCC 2020) showed how to obtain a non-interactive zero-knowledge (NIZK)
argument for NP from a succinct non-interactive argument (SNARG) for NP. In particular, their work demonstrates
how to leverage the succinctness property from an argum服务器托管网ent system and transform it into a zero-knowledge property.
In this wor服务器托管网k, we study a similar question of leveraging succinctness for zero-knowledge. Our starting point
is a batch argument for NP, a primitive that allows a prover to convince a verier of NP statements 1
with a proof whose size scales sublinearly with . Unlike SNARGs for NP, batch arguments for NP can be built from
group-based assumptions in both pairing and pairing-free groups and from lattice-based assumptions. The challenge
with batch arguments is that the proof size is only amortized over the number of instances, but can still encode full
information about the witness to a small number of instances.
We show how to combine a batch argument for NP with a local pseudorandom generator (i.e., a pseudorandom
generator where each output bit only depends on a small number of input bits) and a dual-mode commitment scheme
to obtain a NIZK for NP. Our work provides a new generic approach of realizing zero-knowledge from succinctness
and highlights a new connection between succinctness and zero-knowledge.
服务器托管，北京服务器托管，服务器租用 http://www.fwqtg.net
机房租用，北京机房租用，IDC机房托管， http://www.fwqtg.net
一、开发调优 复用RDD并进行持久化 对于同一份数据的读取，避免创建多个RDD，尽可能复用，并且对于多次使用的RDD进行持久化，避免重复计算。 错误写法 val rdd1 = sc.textFile(“hello.txt”) rdd1.map(…).cou…
