CertSGN
Jump to navigation
Jump to search
We will briefly describe here the contributions of the article[1], in which members of the certSign research group introduced a new method for producing the following:
- Starting with an encryption scheme which is homomorphic with respect to one operation (such as multiplication), the recipe of the authors produces another encryption scheme which is now homomorphic with respect to two operations (for example, addition and multiplication).
The authors use this technique to construct examples of encryption schemes that, theoretically can handle any algebraic function on encrypted data.
The homomorphic encryption scheme CSGN, a symmetric homomorphic encryption scheme with plaintext was introduced in the same article. The latter plays an essential role the architecture of a privacy-preserving contact tracing application, developed by certSign as part of the TAMEC project. [2]
The content of the article is protected under the law by two patents. [3]
- ↑ M. Barcau and V. Pasol, Bounded Fully Homomorphic Encryption from Monoid Algebras, https://eprint.iacr.org/2018/584
- ↑ https://www.certsign.ro/en/projects
- ↑ U.S. Patent Appln. No. 14/936,097 and European Patent Appln. No. EP 15193706.7
