| Developer(s) | New Jersey Institute of Technology, Duality Technologies, Samsung Advanced Institute of Technology, Intel Corporation, Raytheon BBN Technologies, MIT, University of California, San Diego and other contributors [1] |
|---|---|
| Initial release | July 19, 2022 |
| Stable release | 1.1.2
/ December 16, 2023 |
| Repository | github |
| Written in | C++ |
| Platform | Microsoft Windows, MacOS, Linux |
| License | BSD 2-Clause |
| Website | openfhe |
OpenFHE is an open-source cross platform software library that provides implementations of fully homomorphic encryption schemes.[2] OpenFHE is a successor of PALISADE and incorporates selected design features of HElib, HEAAN, and FHEW libraries.[3]
History
PALISADE
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[4] and a later Series A round[5] led by Intel Capital.
OpenFHE
PALISADE authors along with selected authors of HElib, HEAAN, and FHEW libraries released a new library in July 2022.[6][7] 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.[8]
Features
OpenFHE includes the following features:
- Post-quantum public-key encryption
- Fully homomorphic encryption (FHE)
- Brakerski/Fan-Vercauteren (BFV) scheme[9][10] for integer arithmetic with approximate bootstrapping and RNS optimizations[11][12][13]
- Brakerski-Gentry-Vaikuntanathan (BGV) scheme[14] for integer arithmetic with RNS optimizations[15]
- Cheon-Kim-Kim-Song (CKKS) scheme[16] for real-number arithmetic with RNS optimizations[17][18][19][20]
- Ducas-Micciancio (FHEW) scheme[21] for Boolean circuit evaluation with optimizations[22]
- Chillotti-Gama-Georgieva-Izabachene (TFHE)[23] scheme for Boolean circuit evaluation with extensions[22]
- Multiparty extensions of FHE
- Threshold FHE for BGV, BFV, and CKKS schemes[24]
- Proxy re-encryption for BGV, BFV, and CKKS schemes[25]
References
- ^ "Community – PALISADE Homomorphic Encryption Software Library". Archived from the original on 2019-12-04. Retrieved 2019-12-11.
- ^ "Duality Advances Homomorphic Encryption Landscape". www.businesswire.com. 2022-07-19. Archived from the original on 2022-09-13. Retrieved 2022-09-13.
- ^ "OpenFHE: Open-Source Fully Homomorphic Encryption". Help Net Security. 2022-08-19. Archived from the original on 2022-09-13. Retrieved 2022-09-13.
- ^ "Walmart, Microsoft, AT&T-Backed Foundry Invests Millions in Encryption Pioneer". Fortune. Archived from the original on 2019-04-03. Retrieved 2019-11-21.
- ^ "Duality Technologies raises $16 million for privacy-preserving data science solutions". VentureBeat. 2019-10-30. Archived from the original on 2019-11-02. Retrieved 2019-11-21.
- ^ "OpenFHE Brings New Encryption Tools to Developers". Dark Reading. 2022-07-26. Archived from the original on 2022-08-19. Retrieved 2022-09-13.
- ^ "Privacy, regulations and cross-border data sharing in finance". FinTech Futures. 2022-07-21. Archived from the original on 2022-09-13. Retrieved 2022-09-13.
- ^ Naik, Amit Raja (2021-07-17). "Google Launches General Purpose Transpiler For Fully Homomorphic Encryption". Analytics India Magazine. Archived from the original on 2022-09-13. Retrieved 2022-09-13.
- ^
Fan, Junfeng; Vercauteren, Frederik (2012). "Somewhat Practical Fully Homomorphic Encryption".
{{cite journal}}: Cite journal requires|journal=(help) - ^ Z. Brakerski. Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP, In Crypto 2012 (Springer)
- ^ Bajard JC., Eynard J., Hasan M.A., Zucca V. A Full RNS Variant of FV Like Somewhat Homomorphic Encryption Schemes, In SAC 2016 (Springer)
- ^ Halevi S., Polyakov Y., Shoup V. An Improved RNS Variant of the BFV Homomorphic Encryption Scheme, In CT-RSA 2019 (Springer)
- ^
Kim, Andrey; Polyakov, Yuriy; Zucca, Vincent (2021). "Revisiting Homomorphic Encryption Schemes for Finite Fields".
{{cite journal}}: Cite journal requires|journal=(help) - ^ Z. Brakerski, C. Gentry, and V. Vaikuntanathan. Fully Homomorphic Encryption without Bootstrapping, In ITCS 2012
- ^ Gentry, Craig; Halevi, Shai; Smart, Nigel (2012). "Homomorphic Evaluation of the AES Circuit.". Safavi-Naini R., Canetti R. (eds) Advances in Cryptology – Crypto 2012. Crypto 2012. Springer, Berlin, Heidelberg. pp. 850–867. doi:10.1007/978-3-642-32009-5_49.
- ^ Cheon, Jung Hee; Kim, Andrey; Kim, Miran; Song, Yongsoo (2017). "Homomorphic encryption for arithmetic of approximate numbers". Takagi T., Peyrin T. (eds) Advances in Cryptology – AsiaCrypt 2017. AsiaCrypt 2017. Springer, Cham. pp. 409–437. doi:10.1007/978-3-319-70694-8_15.
- ^ Cheon, Jung Hee; Han, Kyoohyung; Kim, Andrey; Kim, Miran; Song, Yongsoo (2018). "A Full RNS Variant of Approximate Homomorphic Encryption". Cid C., Jacobson Jr. M. (eds) Selected Areas in Cryptography – SAC 2018. SAC 2018. Springer, Cham. pp. 347–368. doi:10.1007/978-3-030-10970-7_16. PMC 8048025.
- ^ M. Blatt, A. Gusev, Y. Polyakov, K. Rohloff, and V. Vaikuntanathan. Optimized Homomorphic Encryption Solution for Secure Genome-Wide Association Studies, 2019
- ^ Han K. and Ki D.. Better Bootstrapping for Approximate Homomorphic Encryption, In CT-RSA 2020
- ^
Kim, Andrey; Papadimitriou, Antonis; Polyakov, Yuriy (2020). "Approximate Homomorphic Encryption with Reduced Approximation Error".
{{cite journal}}: Cite journal requires|journal=(help) - ^ Ducas, Leo; Micciancio, Daniele (2015). "FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second" (PDF). Oswald E., Fischlin M. (eds) Advances in Cryptology – EuroCrypt 2015. EuroCrypt 2015. Springer, Berlin, Heidelberg. pp. 617–640. doi:10.1007/978-3-662-46800-5_24.
- ^ a b D. Micciancio and Y. Polyakov. Bootstrapping in FHEW-like Cryptosystems, 2020
- ^ Ilaria Chillotti; Nicolas Gama; Mariya Georgieva; Malika Izabachene. "Faster Fully Homomorphic Encryption: Bootstrapping in less than 0.1 Seconds". Retrieved 31 December 2016.
- ^ Asharov, Gilad; Jain, Abhishek; López-Alt, Adriana; Tromer, Eran; Vaikuntanathan, Vinod; Wichs, Daniel (2012). "Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE". Advances in Cryptology – Eurocrypt 2012. Lecture Notes in Computer Science. Vol. 7237. pp. 483–501. doi:10.1007/978-3-642-29011-4_29. ISBN 978-3-642-29010-7.
- ^ Yuriy Polyakov and Kurt Rohloff and Gyana Sahu and Vinod Vaikuntanthan (2017). "Fast Proxy Re-Encryption for Publish/Subscribe Systems". ACM Transactions on Privacy and Security.
External links
This page was last edited on 22 January 2024, at 17:46