VOProof: Efficient zkSNARKs from Vector Oracle Compilers
Yuncong Zhang, Alan Szepieniec, Ren Zhang, Shifeng Sun, Geng Wang, Dawu Gu
摘要
The design of zkSNARKs is increasingly complicated and requires familiarity with a broad class of cryptographic and algebraic tools. This complexity in zkSNARK design also increases the difficulty in zkSNARK implementation, analysis, and optimization. To address this complexity, we develop a new workflow for designing and implementing zkSNARKs, called VOProof. In VOProof, the designer only needs to construct a Vector Oracle (VO) protocol that is intuitive and straightforward to design, and then feeds this protocol to our VO compiler to transform it into a fully functional zkSNARK. This new workflow conceals most algebraic and cryptographic operations inside the compiler, so that the designer is no longer required to understand these cumbersome and error prone procedures. Moreover, our compiler can be fine-tuned to compile one VO protocol into multiple zkSNARKs with different tradeoffs.
问 Lune
尽管问,回答都注明出处。
Lune 会读相关的 Paper,每个回答都附上所依据的原文段落。
相关 Paper
- SoK: Understanding zk-SNARKs: The Gap Between Research and PracticeJunkai Liang, Daqi Hu, Pengfei Wu, Yunbo Yang 等USENIX Security 2025
- Real-World Universal zkSNARKs are Non-MalleableAntonio Faonio, Dario Fiore, Luigi RussoCCS 2024 · 5 次引用
- Witness-Succinct Universally-Composable SNARKsChaya Ganesh, Yashvanth Kondi, Claudio Orlandi, Mahak Pancholi 等EUROCRYPT 2023 · 24 次引用
- Eos: Efficient Private Delegation of zkSNARK ProversAlessandro Chiesa, Ryan Lehmkuhl, Pratyush Mishra, Yinuo ZhangUSENIX Security 2023
- LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge ProofsMatteo Campanelli, Dario Fiore, Anaïs QuerolCCS 2019 · 3 次引用
