Porcupine:一种矢量化同态加密的综合加密算法
Porcupine: A Synthesizing Compiler for Vectorized Homomorphic Encryption
摘要:
同态加密(HE)是一种隐私保护技术,它可以直接对加密数据进行计算。尽管它的承诺,他已经看到有限的使用,由于性能开销和编译的挑战。最近的工作已经取得了显着的进步,以解决性能开销,但高效的HE内核的自动编译仍然相对未开发。本文介绍了一种优化编译器Porcupine和一个名为Quill的HE DSL,用于使用程序合成自动生成HE代码。HE提出了三个主要的编译挑战:它只支持有限的一组类似SIMD的运算符,它使用长向量操作数,如果密文噪声增长没有得到适当的管理,解密可能会失败。Quill捕获底层HE操作符行为,使Porcupine能够推理挑战带来的复杂权衡,并生成优化的、经过验证的HE内核。为了提高综合时间,我们提出了一系列的优化,包括一个草图设计适合他和指令限制,以缩小程序搜索空间。我们使用一组内核来评估Ruppine,并显示与人工驱动的手动优化内核相比,加速高达51%(几何平均值为11%)。豪猪的合成代码的分析表明,最佳的解决方案并不总是直观的,强调在这个领域的自动推理的效用。
英文摘要:
Homomorphic encryption (HE) is a privacy-preserving technique that enables computation directly on encrypted data. Despite its promise, HE has seen limited use due to performance overheads and compilation challenges. Recent work has made significant advances to address the performance overheads but automatic compilation of efficient HE kernels remains relatively unexplored. This paper presents Porcupine, an optimizing compiler, and HE DSL named Quill to automatically generate HE code using program synthesis. HE poses three major compilation challenges: it only supports a limited set of SIMD-like operators, it uses long-vector operands, and decryption can fail if ciphertext noise growth is not managed properly. Quill captures the underlying HE operator behavior that enables Porcupine to reason about the complex trade-offs imposed by the challenges and generate optimized, verified HE kernels. To improve synthesis time, we propose a series of optimizations including a sketch design tailored to HE and instruction restriction to narrow the program search space. We evaluate Procupine using a set of kernels and show speedups of up to 51% (11% geometric mean) compared to heuristic-driven hand-optimized kernels. Analysis of Porcupine's synthesized code reveals that optimal solutions are not always intuitive, underscoring the utility of automated reasoning in this domain.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。