TY - GEN
T1 - EZEE
T2 - 7th IEEE European Symposium on Security and Privacy, Euro S and P 2022
AU - Yang, Yibin
AU - Heath, David
AU - Kolesnikov, Vladimir
AU - Devecsery, David
N1 - Funding Information:
This work was supported in part by NSF award #1909769, by a Cisco research award, by Georgia Tech’s IISP cybersecurity seed funding (CSF) award. This material is also based upon work supported in part by DARPA under Contract No. HR001120C0087. Any opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of DARPA.
Funding Information:
This work was supported in part by NSF award #1909769, by a Cisco research award, by Georgia Tech s IISP cybersecurity seed funding (CSF) award. This material is also based upon work supported in part by DARPA under Contract No. HR001120C0087. Any opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of DARPA.
Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - 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.
AB - 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.
KW - Interactive ZK
KW - Parallelism
KW - Zero Knowledge
UR - http://www.scopus.com/inward/record.url?scp=85134040302&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85134040302&partnerID=8YFLogxK
U2 - 10.1109/EuroSP53844.2022.00015
DO - 10.1109/EuroSP53844.2022.00015
M3 - Conference contribution
AN - SCOPUS:85134040302
T3 - Proceedings - 7th IEEE European Symposium on Security and Privacy, Euro S and P 2022
SP - 109
EP - 123
BT - Proceedings - 7th IEEE European Symposium on Security and Privacy, Euro S and P 2022
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 6 June 2022 through 10 June 2022
ER -