Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
PALISADE (software)
open-in-new
<h2 id="history">History</h2> <p>PALISADE adopted the open modular design principles of the predecessor SIPHER software library from the <a href="/facts/DARPA/Uf9sarhT">DARPA</a> 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. </p><p>PALISADE development was funded originally by the <a href="/facts/DARPA/Uf9sarhT">DARPA</a> PROCEED and SafeWare programs, with subsequent improvements funded by additional <a href="/facts/DARPA/Uf9sarhT">DARPA</a> programs, <a href="/facts/IARPA/oLbo3Kj4">IARPA</a>, the <a href="/facts/NSA/Sg6MGV1o">NSA</a>, <a href="/facts/NIH/G3Eytfcc">NIH</a>, <a href="/facts/Office_of_Naval_Research/qKug0oD2">ONR</a>, the <a href="/facts/United_States_Navy/xYK0fUou">United States Navy</a>, the <a href="/facts/Sloan_Foundation/bIGkfYAS">Sloan Foundation</a> 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 <a href="/facts/Seed_round/RDEjrBJ6">Seed round</a><a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a> and a later <a href="/facts/Series_A_round/uzd006jy">Series A round</a><a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a> led by <a href="/facts/Intel_Capital/Ms9ejsH9">Intel Capital</a>. </p><p>In 2022 <a href="/facts/OpenFHE/NWWrrPHj">OpenFHE</a> was released as a fork that also implements <a href="/facts/HEAAN/VuoK9I4u">CKKS</a> bootstrapping. </p> <h2 id="features">Features</h2> <p>PALISADE includes the following features:<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a> </p> <ul><li><a href="/facts/Post-quantum_cryptography/1qeqUQve">Post-quantum public-key encryption</a></li> <li>Fully <a href="/facts/Homomorphic_encryption/pbfGnqBn">homomorphic encryption</a> (FHE) <ul><li>Brakerski/Fan-Vercauteren (BFV) scheme<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a><a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a> for integer arithmetic with <a href="/facts/Residue_number_system/HuG4hY6u">RNS</a> optimizations<a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a><a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a><a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a></li> <li>Brakerski-Gentry-Vaikuntanathan (BGV) scheme<a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a> for integer arithmetic with <a href="/facts/Residue_number_system/HuG4hY6u">RNS</a> optimizations<a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a></li> <li>Cheon-Kim-Kim-Song (CKKS) scheme<a class="footnote-ref" id="fnref:12" href="#fn:12"><sup>12</sup></a> for real-number arithmetic with <a href="/facts/Residue_number_system/HuG4hY6u">RNS</a> optimizations<a class="footnote-ref" id="fnref:13" href="#fn:13"><sup>13</sup></a><a class="footnote-ref" id="fnref:14" href="#fn:14"><sup>14</sup></a><a class="footnote-ref" id="fnref:15" href="#fn:15"><sup>15</sup></a><a class="footnote-ref" id="fnref:16" href="#fn:16"><sup>16</sup></a></li> <li>Ducas-Micciancio (FHEW) scheme<a class="footnote-ref" id="fnref:17" href="#fn:17"><sup>17</sup></a> for Boolean circuit evaluation with optimizations<a class="footnote-ref" id="fnref:18" href="#fn:18"><sup>18</sup></a></li> <li>Chillotti-Gama-Georgieva-Izabachene (TFHE)<a class="footnote-ref" id="fnref:19" href="#fn:19"><sup>19</sup></a> scheme for Boolean circuit evaluation with extensions<a class="footnote-ref" id="fnref:20" href="#fn:20"><sup>20</sup></a></li></ul></li> <li>Multiparty extensions of FHE <ul><li>Threshold FHE for BGV, BFV, and CKKS schemes<a class="footnote-ref" id="fnref:21" href="#fn:21"><sup>21</sup></a></li> <li><a href="/facts/Proxy_re-encryption/YYqkV3dk">Proxy re-encryption</a> for BGV, BFV, and CKKS schemes<a class="footnote-ref" id="fnref:22" href="#fn:22"><sup>22</sup></a></li></ul></li> <li>Digital signature<a class="footnote-ref" id="fnref:23" href="#fn:23"><sup>23</sup></a></li> <li>Identity-based encryption<a class="footnote-ref" id="fnref:24" href="#fn:24"><sup>24</sup></a></li> <li>Ciphertext-policy attribute-based encryption<a class="footnote-ref" id="fnref:25" href="#fn:25"><sup>25</sup></a></li></ul> <h2 id="availability">Availability</h2> <p>There are several known git repositories/ports for PALISADE: </p> <h3>C++</h3> <ul><li><a href="https://gitlab.com/palisade/palisade-release">PALISADE Stable Release</a> (official stable release repository)</li> <li><a href="https://gitlab.com/palisade/palisade-development">PALISADE Preview Release</a> (official development/preview release repository)</li> <li><a href="https://gitlab.com/palisade/palisade-signature">PALISADE Digital Signature Extensions</a></li> <li><a href="https://gitlab.com/palisade/palisade-abe">PALISADE Attribute-Based Encryption Extensions</a> (includes identity-based encryption and ciphertext-policy attribute-based encryption)</li></ul> <h3>JavaScript / WebAssembly</h3> <ul><li><a href="https://gitlab.com/palisade/palisade-wasm">PALISADE WebAssembly</a> (official WebAssembly port)</li></ul> <h3>Python</h3> <ul><li><a href="https://gitlab.com/palisade/palisade-python-demo">Python Demos</a> (official Python demos)</li></ul> <h3>FreeBSD</h3> <ul><li><a href="https://www.freshports.org/security/palisade">PALISADE</a> (FreeBSD port)</li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>"PALISADE Homomorphic Encryption Software Library – An Open-Source Lattice Crypto Software Library". Archived from the original on 2019-11-16. Retrieved 2019-11-21. <a href="https://palisade-crypto.org/" target="_blank">https://palisade-crypto.org/</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>"Walmart, Microsoft, AT&T-Backed Foundry Invests Millions in Encryption Pioneer". Fortune. Archived from the original on 2019-04-03. Retrieved 2019-11-21. <a href="https://fortune.com/2018/11/13/encryption-startup-walmart-microsoft-att/" target="_blank">https://fortune.com/2018/11/13/encryption-startup-walmart-microsoft-att/</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>"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. <a href="https://venturebeat.com/2019/10/30/duality-technologies-raises-16-million-for-privacy-preserving-data-science-solutions/" target="_blank">https://venturebeat.com/2019/10/30/duality-technologies-raises-16-million-for-privacy-preserving-data-science-solutions/</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>"PALISADE Lattice Cryptography Library Documentation". Retrieved 4 December 2019. <a href="https://palisade-crypto.org/documentation" target="_blank">https://palisade-crypto.org/documentation</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Fan, Junfeng; Vercauteren, Frederik (2012). "Somewhat Practical Fully Homomorphic Encryption". Cryptology ePrint Archive. <a href="https://eprint.iacr.org/2012/144" target="_blank">https://eprint.iacr.org/2012/144</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>Z. Brakerski. Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP, In CRYPTO 2012 (Springer) <a href="http://eprint.iacr.org/2012/078" target="_blank">http://eprint.iacr.org/2012/078</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>Bajard JC., Eynard J., Hasan M.A., Zucca V. A Full RNS Variant of FV Like Somewhat Homomorphic Encryption Schemes, In SAC 2016 (Springer) <a href="https://eprint.iacr.org/2016/510" target="_blank">https://eprint.iacr.org/2016/510</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>Halevi S., Polyakov Y., Shoup V. An Improved RNS Variant of the BFV Homomorphic Encryption Scheme, In CT-RSA 2019 (Springer) <a href="https://eprint.iacr.org/2018/117" target="_blank">https://eprint.iacr.org/2018/117</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>Kim, Andrey; Polyakov, Yuriy; Zucca, Vincent (2021). "Revisiting Homomorphic Encryption Schemes for Finite Fields". Cryptology ePrint Archive. <a href="https://eprint.iacr.org/2021/204" target="_blank">https://eprint.iacr.org/2021/204</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> <li id="fn:10"><p>Z. Brakerski, C. Gentry, and V. Vaikuntanathan. Fully Homomorphic Encryption without Bootstrapping, In ITCS 2012 <a href="http://eprint.iacr.org/2011/277" target="_blank">http://eprint.iacr.org/2011/277</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li> <li id="fn:11"><p>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. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li> <li id="fn:12"><p>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. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li> <li id="fn:13"><p>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. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></p></li> <li id="fn:14"><p>M. Blatt, A. Gusev, Y. Polyakov, K. Rohloff, and V. Vaikuntanathan. Optimized Homomorphic Encryption Solution for Secure Genome-Wide Association Studies, 2019 <a href="https://eprint.iacr.org/2019/223" target="_blank">https://eprint.iacr.org/2019/223</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></p></li> <li id="fn:15"><p>Han K. and Ki D.. Better Bootstrapping for Approximate Homomorphic Encryption, In CT-RSA 2020 <a href="https://eprint.iacr.org/2019/688" target="_blank">https://eprint.iacr.org/2019/688</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></p></li> <li id="fn:16"><p>Kim, Andrey; Papadimitriou, Antonis; Polyakov, Yuriy (2020). "Approximate Homomorphic Encryption with Reduced Approximation Error". Cryptology ePrint Archive. <a href="https://eprint.iacr.org/2020/1118" target="_blank">https://eprint.iacr.org/2020/1118</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></p></li> <li id="fn:17"><p>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 href="https://ir.cwi.nl/pub/23686/23686B.pdf" target="_blank">https://ir.cwi.nl/pub/23686/23686B.pdf</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></p></li> <li id="fn:18"><p>D. Micciancio and Y. Polyakov. Bootstrapping in FHEW-like Cryptosystems, 2020 <a href="https://eprint.iacr.org/2020/086" target="_blank">https://eprint.iacr.org/2020/086</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></p></li> <li id="fn:19"><p>Ilaria Chillotti; Nicolas Gama; Mariya Georgieva; Malika Izabachene. "Faster Fully Homomorphic Encryption: Bootstrapping in less than 0.1 Seconds". Retrieved 31 December 2016. <a href="https://tfhe.github.io/tfhe" target="_blank">https://tfhe.github.io/tfhe</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></p></li> <li id="fn:20"><p>D. Micciancio and Y. Polyakov. Bootstrapping in FHEW-like Cryptosystems, 2020 <a href="https://eprint.iacr.org/2020/086" target="_blank">https://eprint.iacr.org/2020/086</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></p></li> <li id="fn:21"><p>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. <a href="978-3-642-29010-7" target="_blank">978-3-642-29010-7</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></p></li> <li id="fn:22"><p>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. <a href="https://eprint.iacr.org/2017/410" target="_blank">https://eprint.iacr.org/2017/410</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></p></li> <li id="fn:23"><p>Gentry C., Peikert C., Vaikuntanathan V. Trapdoors for Hard Lattices and New Cryptographic Constructions, In STOC 2008 <a href="https://eprint.iacr.org/2007/432" target="_blank">https://eprint.iacr.org/2007/432</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></p></li> <li id="fn:24"><p>Gentry C., Peikert C., Vaikuntanathan V. Trapdoors for Hard Lattices and New Cryptographic Constructions, In STOC 2008 <a href="https://eprint.iacr.org/2007/432" target="_blank">https://eprint.iacr.org/2007/432</a> <a href="#fnref:24" class="footnote-back-ref">↩</a></p></li> <li id="fn:25"><p>Zhang, Jiang; Zhang, Zhenfeng; Ge, Aijun (2012). "Ciphertext policy attribute-based encryption from lattices". Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security - ASIACCS '12. p. 16. doi:10.1145/2414456.2414464. ISBN 9781450316484. S2CID 15973033. <a href="9781450316484" target="_blank">9781450316484</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></p></li> </ol>