Practical Lattice-based Cryptography in PALISADE

          @misc{ scivideos_15667,
            doi = {},
            url = {https://simons.berkeley.edu/talks/palisade-lattice-library},
            author = {},
            keywords = {},
            language = {en},
            title = {Practical Lattice-based Cryptography in PALISADE},
            publisher = {The Simons Institute for the Theory of Computing},
            year = {2020},
            month = {may},
            note = {15667 see, \url{https://scivideos.org/index.php/Simons-Institute/15667}}
          }
          

Abstract

Several lattice-based cryptography primitives and protocols are now practical and even available in commercial products, for example, public-key cryptography, homomorphic encryption, proxy re-encryption (PRE), and digital signatures. Many of these primitives based on the Learning With Errors problem are implemented in the PALISADE lattice cryptography library. This talk presents a survey of state-of-the-art lattice algorithms implemented in PALISADE (both for already practical primitives and research prototypes of more advanced capabilities) and discusses some of their applications. The first part of the talk focuses on FHE schemes and their extensions, such as PRE and threshold FHE. The remaining part is centered around lattice trapdoors and the protocols where lattice trapdoors are used as a primitive, including identity-based encryption, key-policy attribute-based encryption, and program obfuscation.