OpenFHE

Development began with the OpenFHE precursor PALISADE (software).

PALISADE adopted the open modular design principles of the predecessor SIPHER software library from the DARPA PROCEED program.

SIPHER development began in 2010, with a focus on modular open design principles to support rapid application deployment over multiple FHE schemes and hardware accelerator back-ends, including on mobile, FPGA and CPU-based computing systems.

PALISADE began building from earlier SIPHER designs in 2014, with an open-source release in 2017 and substantial improvements every subsequent 6 months. Much of the development was done at Raytheon BBN and NJIT.

PALISADE development was funded originally by the DARPA PROCEED and SafeWare programs, with subsequent improvements funded by additional DARPA programs, IARPA, the NSA, NIH, ONR, the United States Navy, the Sloan Foundation and commercial entities such as Duality Technologies. PALISADE has subsequently been used in commercial offerings, such as by Duality Technologies who raised funding in a Seed round{{Cite web|url=https://fortune.com/2018/11/13/encryption-startup-walmart-microsoft-att/|title=Walmart, Microsoft, AT&T-Backed Foundry Invests Millions in Encryption Pioneer|last=|first=|date=|website=Fortune|language=en|url-status=live|archive-url=https://web.archive.org/web/20190403092114/http://amp.timeinc.net/fortune/2018/11/13/encryption-startup-walmart-microsoft-att|archive-date=2019-04-03|access-date=2019-11-21}} and a later Series A round{{Cite web|url=https://venturebeat.com/2019/10/30/duality-technologies-raises-16-million-for-privacy-preserving-data-science-solutions/|title=Duality Technologies raises $16 million for privacy-preserving data science solutions|last=|first=|date=2019-10-30|website=VentureBeat|language=en-US|url-status=live|archive-url=https://web.archive.org/web/20191102133236/https://venturebeat.com/2019/10/30/duality-technologies-raises-16-million-for-privacy-preserving-data-science-solutions/|archive-date=2019-11-02|access-date=2019-11-21}} led by Intel Capital.

PALISADE authors along with selected authors of HElib, HEAAN, and FHEW libraries released a new library in July 2022.{{Cite web |date=2022-07-26 |title=OpenFHE Brings New Encryption Tools to Developers |url=https://www.darkreading.com/dr-tech/openfhe-brings-new-encryption-tools-to-developers |url-status=live |archive-url= https://web.archive.org/web/20220819094042/https://www.darkreading.com/dr-tech/openfhe-brings-new-encryption-tools-to-developers |archive-date=2022-08-19 |access-date=2022-09-13 |website=Dark Reading |language=en}}{{Cite web |date=2022-07-21 |title=Privacy, regulations and cross-border data sharing in finance |url=https://www.fintechfutures.com/2022/07/privacy-regulations-and-cross-border-data-sharing-in-finance/ |url-status=live |archive-url=https://web.archive.org/web/20220913051020/https://www.fintechfutures.com/2022/07/privacy-regulations-and-cross-border-data-sharing-in-finance/ |archive-date=2022-09-13 |access-date=2022-09-13 |website=FinTech Futures |language=en-GB}}

The initial release of the library included all features of PALISADE v1.11 and added several new design features, such as Hardware Acceleration Layer for multiple hardware acceleration backends and new bootstrapping procedures.

OpenFHE is used as an FHE backend for the Google Transpiler project.{{Cite web |last=Naik |first=Amit Raja |date=2021-07-17 |title=Google Launches General Purpose Transpiler For Fully Homomorphic Encryption |url=https://analyticsindiamag.com/google-launches-general-purpose-transpiler-for-fully-homomorphic-encryption/ |url-status=live |archive-url=https://web.archive.org/web/20220913134833/https://analyticsindiamag.com/google-launches-general-purpose-transpiler-for-fully-homomorphic-encryption/ |archive-date=2022-09-13 |access-date=2022-09-13 |website=Analytics India Magazine |language=en-US}}

OpenFHE includes the following features:

• Post-quantum public-key encryption
• Fully homomorphic encryption (FHE)
• Brakerski/Fan-Vercauteren (BFV) scheme

{{cite journal

|last1=Fan |first1=Junfeng

|last2=Vercauteren |first2=Frederik

|title=Somewhat Practical Fully Homomorphic Encryption

|url=https://eprint.iacr.org/2012/144

|date=2012}}

Z. Brakerski. [http://eprint.iacr.org/2012/078 Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP], In Crypto 2012 (Springer) for integer arithmetic with approximate bootstrapping and RNS optimizationsBajard JC., Eynard J., Hasan M.A., Zucca V. [https://eprint.iacr.org/2016/510 A Full RNS Variant of FV Like Somewhat Homomorphic Encryption Schemes], In SAC 2016 (Springer)Halevi S., Polyakov Y., Shoup V. [https://eprint.iacr.org/2018/117 An Improved RNS Variant of the BFV Homomorphic Encryption Scheme], In CT-RSA 2019 (Springer)

{{cite journal

|last1=Kim |first1=Andrey

|last2=Polyakov |first2=Yuriy

|last3=Zucca |first3=Vincent

|title=Revisiting Homomorphic Encryption Schemes for Finite Fields

|url=https://eprint.iacr.org/2021/204

|date=2021}}

• Brakerski-Gentry-Vaikuntanathan (BGV) schemeZ. Brakerski, C. Gentry, and V. Vaikuntanathan. [http://eprint.iacr.org/2011/277 Fully Homomorphic Encryption without Bootstrapping], In ITCS 2012 for integer arithmetic with RNS optimizations

{{cite conference

|last1=Gentry |first1=Craig

|last2=Halevi |first2=Shai

|last3=Smart |first3=Nigel

|title=Homomorphic Evaluation of the AES Circuit.

|publisher=Springer, Berlin, Heidelberg

|conference=Crypto 2012 |date=2012 |book-title=Safavi-Naini R., Canetti R. (eds) Advances in Cryptology – Crypto 2012 |pages=850–867 |doi=10.1007/978-3-642-32009-5_49

|doi-access=free }}

• Cheon-Kim-Kim-Song (CKKS) scheme

{{cite conference

|last1=Cheon |first1=Jung Hee

|last2=Kim |first2=Andrey

|last3=Kim |first3=Miran

|last4=Song |first4=Yongsoo

|title=Homomorphic encryption for arithmetic of approximate numbers

|publisher=Springer, Cham

|conference=AsiaCrypt 2017 |date=2017 |book-title=Takagi T., Peyrin T. (eds) Advances in Cryptology – AsiaCrypt 2017 |pages=409–437 |doi=10.1007/978-3-319-70694-8_15 }}

for real-number arithmetic with RNS optimizations

{{cite conference

|last1=Cheon |first1=Jung Hee

|last2=Han |first2=Kyoohyung

|last3=Kim |first3=Andrey

|last4=Kim |first4=Miran

|last5=Song |first5=Yongsoo

|title=A Full RNS Variant of Approximate Homomorphic Encryption

|publisher=Springer, Cham

|conference=SAC 2018 |date=2018 |book-title=Cid C., Jacobson Jr. M. (eds) Selected Areas in Cryptography – SAC 2018 |pages=347–368 |doi=10.1007/978-3-030-10970-7_16

|pmc=8048025 }}M. Blatt, A. Gusev, Y. Polyakov, K. Rohloff, and V. Vaikuntanathan. [https://eprint.iacr.org/2019/223 Optimized Homomorphic Encryption Solution for Secure Genome-Wide Association Studies], 2019Han K. and Ki D.. [https://eprint.iacr.org/2019/688 Better Bootstrapping for Approximate Homomorphic Encryption], In CT-RSA 2020

{{cite journal

|last1=Kim |first1=Andrey

|last2=Papadimitriou |first2=Antonis

|last3=Polyakov |first3=Yuriy

|title=Approximate Homomorphic Encryption with Reduced Approximation Error

|url=https://eprint.iacr.org/2020/1118

|date=2020}}

• Ducas-Micciancio (FHEW) scheme

{{cite conference

|last1=Ducas |first1=Leo

|last2=Micciancio |first2=Daniele

|title=FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second

|publisher=Springer, Berlin, Heidelberg

|conference=EuroCrypt 2015 |date=2015 |book-title=Oswald E., Fischlin M. (eds) Advances in Cryptology – EuroCrypt 2015 |pages=617–640 |doi=10.1007/978-3-662-46800-5_24

|url=https://ir.cwi.nl/pub/23686/23686B.pdf }} for Boolean circuit evaluation with optimizationsD. Micciancio and Y. Polyakov. [https://eprint.iacr.org/2020/086 Bootstrapping in FHEW-like Cryptosystems], 2020

• Chillotti-Gama-Georgieva-Izabachene (TFHE)

{{cite web

|title=Faster Fully Homomorphic Encryption: Bootstrapping in less than 0.1 Seconds

|url=https://tfhe.github.io/tfhe

|author=Ilaria Chillotti|author2=Nicolas Gama|author3=Mariya Georgieva|author4=Malika Izabachene

|accessdate=31 December 2016}}

scheme for Boolean circuit evaluation with extensions

• Multiparty extensions of FHE
• Threshold FHE for BGV, BFV, and CKKS schemes{{Cite book|chapter-url=https://link.springer.com/chapter/10.1007/978-3-642-29011-4_29|doi=10.1007/978-3-642-29011-4_29|chapter=Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE|title=Advances in Cryptology – Eurocrypt 2012|series=Lecture Notes in Computer Science|year=2012|last1=Asharov|first1=Gilad|last2=Jain|first2=Abhishek|last3=López-Alt|first3=Adriana|last4=Tromer|first4=Eran|last5=Vaikuntanathan|first5=Vinod|last6=Wichs|first6=Daniel|volume=7237|pages=483–501|isbn=978-3-642-29010-7}}
• Proxy re-encryption for BGV, BFV, and CKKS schemes{{cite journal

|title=Fast Proxy Re-Encryption for Publish/Subscribe Systems

|url=https://eprint.iacr.org/2017/410

|author=Yuriy Polyakov and Kurt Rohloff and Gyana Sahu and Vinod Vaikuntanthan

|journal=ACM Transactions on Privacy and Security

|year=2017

}}

{{reflist}}

• [https://www.openfhe.org/ Official Website]

Category:Homomorphic encryption

Category:Cryptographic software

Category:Free and open-source software

Category:Software using the BSD license