EZEE: Epoch Parallel Zero Knowledge for ANSI C
EZEE: Epoch Parallel Zero Knowledge for ANSI C
复制标题
DOI：
10.1109/eurosp53844.2022.00015
复制
发表时间：
2022-06
期刊：
影响因子：
--
通讯作者：
Yibin Yang;David Heath;V. Kolesnikov;David Devecsery
中科院分区：
文献类型：
--
作者：
Yibin Yang;David Heath;V. Kolesnikov;David Devecsery
最近的工作已经产生了交互式零知识（ZK）证明系统，可以将证明表达为任意 C 程序（Heath 等人，2021，以下称为 ZEE）；这些程序可以由运行在 10KHz 范围内的模拟 ZK 处理器执行。在这项工作中，我们证明这种证明系统适合高度并行性。我们基于纪元并行的方法允许证明者和验证者将 ZK 证明分成多个部分，以便每个部分可以在不同的机器上执行。然后可以将这些证明片段粘合在一起，并且粘合的并行证明相当于原始的顺序证明。我们实现并实验评估了 ZEE 证明系统的纪元并行版本。通过在 31 台 2 核机器上运行证明者和验证者，我们实现了运行速度高达 394KHz 的 ZK 处理器。这使我们能够运行涉及 Linux 程序 bzip2 的基准测试，而使用以前的 ZEE 系统至少需要 11 天，而现在只用了 8.5 小时。
Recent work has produced interactive Zero Knowledge (ZK) proof systems that can express proofs as arbitrary C programs (Heath et al., 2021, henceforth referred to as ZEE); these programs can be executed by a simulated ZK processor that runs in the 10KHz range. In this work, we demonstrate that such proof systems are amenable to high degrees of parallelism. Our epoch parallelism-based approach allows the prover and verifier to divide the ZK proof into pieces such that each piece can be executed on a different machine. These proof snippets can then be glued together, and the glued parallel proofs are equivalent to the original sequential proof. We implemented and we experimentally evaluate an epoch parallel version of the ZEE proof system. By running the prover and verifier each across 31 2-core machines, we achieve a ZK processor that runs at up to 394KHz. This allowed us to run a benchmark involving the Linux program bzip2, which would have required at least 11 days with the former ZEE system, in only 8.5 hours.