ALCHEMY: A Language and Compiler for Homomorphic Encryption Made easY
ALCHEMY: A Language and Compiler for Homomorphic Encryption Made easY
复制标题
ALCHEMY：一种轻松实现同态加密的语言和编译器
DOI：
--
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
Chad Sharp
中科院分区：
文献类型：
--
作者：
E. Crockett;Chris Peikert;Chad Sharp
完全同态加密（FHE）是一个加密的“圣杯”，它允许工人对客户加密的数据进行任意计算，而无需了解数据本身。自2009年首次合理的结构以来，已经为特定的感兴趣应用提供了各种实施并使用了各种实施。不幸的是，使用FHE当前非常复杂，并且需要大量的专业知识才能正确实施非平凡的同构计算。这项工作引入了炼金术，这是一种模块化和可扩展的系统，可简化和加速使用FHE。炼金术以模块化特异性语言〜（DSL）编写的明文计算汇编“清除”计算，以对相应的密文计算进行密文 - - 没有程序员所需的特殊知识。编译器通过静态推断密文噪声速率自动选择（大多数）参数，生成密钥和“键切换提示”，计划适当的密文维护“维护”操作等。此外，它的组件可以模块化以提供其他有用的功能，例如在整个计算过程中记录密文的经验噪声速率，而无需对原始DSL代码进行任何更改。作为测试床的应用程序，我们证明了基于RING-LWR的伪随机函数〜（PRF）的快速同态评估，其整个实现仅几十个简单的DSL代码。对于单个（非批次）评估，我们的未优化实现仅需大约10秒钟的商品PC，它比其他PRF的最先进的同型评估要快的阶段，包括其他PRF的最先进的同型评估，包括一些专门设计的。为了进行同态评估。
Fully Homomorphic Encryption (FHE) is a cryptographic "holy grail" that allows a worker to perform arbitrary computations on client-encrypted data, without learning anything about the data itself. Since the first plausible construction in 2009, a variety of FHE implementations have been given and used for particular applications of interest. Unfortunately, using FHE is currently very complicated, and a great deal of expertise is required to properly implement nontrivial homomorphic computations. This work introduces ALCHEMY, a modular and extensible system that simplifies and accelerates the use of FHE. ALCHEMY compiles "in-the-clear" computations on plaintexts, written in a modular domain-specific language~(DSL), into corresponding homomorphic computations on ciphertexts---with no special knowledge of FHE required of the programmer. The compiler automatically chooses (most of the) parameters by statically inferring ciphertext noise rates, generates keys and "key-switching hints," schedules appropriate ciphertext "maintenance" operations, and more. In addition, its components can be combined modularly to provide other useful functionality, such logging the empirical noise rates of ciphertexts throughout a computation, without requiring any changes to the original DSL code. As a testbed application, we demonstrate fast homomorphic evaluation of a pseudorandom function~(PRF) based on Ring-LWR, whose entire implementation is only a few dozen lines of simple DSL code. For a single (non-batched) evaluation, our unoptimized implementation takes only about 10 seconds on a commodity PC, which is more than an order of magnitude faster than state-of-the-art homomorphic evaluations of other PRFs, including some specifically designed for amenability to homomorphic evaluation.
影响因子：
3
作者：
Gentry, Craig;Groth, Jens;Smith, Adam
通讯作者：
Smith, Adam