Pyfhel: PYthon']PYthon For Homomorphic Encryption Libraries

被引:33
作者
Ibarrondo, Alberto [1 ,2 ]
Viand, Alexander [3 ]
机构
[1] IDEMIA, Courbevoie, France
[2] EURECOM, Sophia Antipolis, France
[3] Swiss Fed Inst Technol, Zurich, Switzerland
来源
PROCEEDINGS OF THE 9TH WORKSHOP ON ENCRYPTED COMPUTING & APPLIED HOMOMORPHIC CRYPTOGRAPHY, WAHC 2021 | 2021年
关键词
Fully Homomorphic Encryption; FHE; !text type='Python']Python[!/text; Abstraction;
D O I
10.1145/3474366.3486923
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Fully Homomorphic Encryption (FHE) allows private computation over encrypted data, disclosing neither the inputs, intermediate values nor results. Thanks to recent advances, FHE has become feasible for a wide range of applications, resulting in an explosion of interest in the topic and ground-breaking real-world deployments. Given the increasing presence of FHE beyond the core academic community, there is increasing demand for easier access to FHE for wider audiences. Efficient implementations of FHE schemes are mostly written in high-performance languages like C++, posing a high entry barrier to novice users. We need to bring FHE to the (higher-level) languages and ecosystems non-experts are already familiar with, such as Python, the de-facto standard language of data science and machine learning. We achieve this through wrapping existing FHE implementations in Python, providing one-click installation and convenience in addition to a significantly higher-level API. In contrast to other similar works, Pyfhel goes beyond merely exposing the underlying API, adding a carefully designed abstraction layer that feels at home in Python. In this paper, we present Pyfhel, introduce its design and usage, and highlight how its unique support for accessing low-level features through a high-level API makes it an ideal teaching tool for lectures on FHE.
引用
收藏
页码:11 / 16
页数:6
相关论文
共 32 条
[1]  
[Anonymous], 2012, IACR Cryptol. ePrint Arch.
[2]   Cython: The Best of Both Worlds [J].
Behnel, Stefan ;
Bradshaw, Robert ;
Citro, Craig ;
Dalcin, Lisandro ;
Seljebotn, Dag Sverre ;
Smith, Kurt .
COMPUTING IN SCIENCE & ENGINEERING, 2011, 13 (02) :31-39
[3]  
Benaissa A, 2021, Arxiv, DOI arXiv:2104.03152
[4]   Secure large-scale genome-wide association studies using homomorphic encryption [J].
Blatt, Marcelo ;
Gusev, Alexander ;
Polyakov, Yuriy ;
Goldwasser, Shafi .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2020, 117 (21) :11608-11613
[5]  
Brakerski Zvika, 2014, ACM Transactions on Computation Theory, V6, DOI 10.1145/2633600
[6]   Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP [J].
Brakerski, Zvika .
ADVANCES IN CRYPTOLOGY - CRYPTO 2012, 2012, 7417 :868-886
[7]   Privacy-preserving semi-parallel logistic regression training with fully homomorphic encryption [J].
Carpov, Sergiu ;
Gama, Nicolas ;
Georgieva, Mariya ;
Troncoso-Pastoriza, Juan Ramon .
BMC MEDICAL GENOMICS, 2020, 13 (Suppl 7)
[8]  
Chabanne H., 2017, IACR CRYPTOL EPRINT, V2017, DOI DOI 10.1109/WITS.2017.7934613
[9]   Labeled PSI from Fully Homomorphic Encryption with Malicious Security [J].
Chen, Hao ;
Huang, Zhicong ;
Laine, Kim ;
Rindal, Peter .
PROCEEDINGS OF THE 2018 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'18), 2018, :1223-1237
[10]   Fast Private Set Intersection from Homomorphic Encryption [J].
Chen, Hao ;
Laine, Kim ;
Rindal, Peter .
CCS'17: PROCEEDINGS OF THE 2017 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2017, :1243-1255