arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2412.12481cs.ARcs.CR
收藏

if-ZKP:基于英特尔 FPGA 的零知识证明加速

if-ZKP: Intel FPGA-Based Acceleration of Zero Knowledge Proofs

Shahzad Ahmad Butt, Benjamin Reynolds, Veeraraghavan Ramamurthy, Xiao Xiao, Pohrong Chu, Setareh Sharifian, Sergey Gribok, Bogdan Pasca

AI总结:

本文提出一种基于英特尔 FPGA 的架构,利用并行性和优化模运算库加速 zk-SNARK 证明者计算中的多标量乘法,实现 110-150 倍加速,并首次报告 BLS12-381 和 BN128 曲线的硬件加速结果。

摘要:

零知识证明(ZKP)已成为一种重要的密码学技术,它允许一方(证明者)向另一方(验证者)证明某个陈述的正确性,而不泄露任何其他信息。ZKP 在区块链、数字投票和机器学习等许多应用中保障了用户的隐私。传统上,ZKP 面临可扩展性差的难题,但最近,一类被称为零知识简洁非交互式知识论证(zk-SNARK)的 ZKP 子类解决了这一挑战。它们正受到广泛关注,并被许多公共库所实现。在本文中,我们提出了一种新颖的可扩展架构,适用于在 FPGA 上加速 zk-SNARK 证明者的计算。我们重点关注多标量乘法(MSM),它占据了 zk-SNARK 系统中大部分计算时间。MSM 计算大量依赖于模运算,因此使用了高度优化的英特尔 IP 库进行模运算。所提出的架构利用了 MSM 固有的并行性,并使用英特尔 OneAPI 框架针对 FPGA 实现。与参考软件库相比,我们的实现运行速度快 110 倍至 150 倍,使用雅可比坐标下的通用曲线形式,并且是首个报告 BLS12-381 和 BN128 椭圆曲线族 FPGA 硬件加速结果的工作。

英文摘要:

Zero-Knowledge Proofs (ZKPs) have emerged as an important cryptographic technique allowing one party (prover) to prove the correctness of a statement to some other party (verifier) and nothing else. ZKPs give rise to user's privacy in many applications such as blockchains, digital voting, and machine learning. Traditionally, ZKPs suffered from poor scalability but recently, a sub-class of ZKPs known as Zero-knowledge Succinct Non-interactive ARgument of Knowledges (zk-SNARKs) have addressed this challenge. They are getting significant attention and are being implemented by many public libraries. In this paper, we present a novel scalable architecture that is suitable for accelerating the zk-SNARK prover compute on FPGAs. We focus on the multi-scalar multiplication (MSM) that accounts for the majority of computation time spent in zk-SNARK systems. The MSM calculations extensive rely on modular arithmetic so highly optimized Intel IP Libraries for modular arithmetic are used. The proposed architecture exploits the parallelism inherent to MSM and is implemented using the Intel OneAPI framework for FPGAs. Our implementation runs 110x-150x faster compared to reference software library, uses a generic curve form in Jacobian coordinates and is the first to report FPGA hardware acceleration results for BLS12-381 and BN128 family of elliptic curves.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑