Section:
New Results
Homomorphic encryption
D. Augot, in collaboration with L. Perret from Salsa team, and
Bochum Universität [22] , designed a
“secret-key” homomorphic encryption scheme, which is much more
efficient than the public-key ones. It is based on -ary
Reed-Muller codes (or multi-variate evaluation-interpolation
schemes). The main drawback is a severe restriction on the number of
uses of a given secret key, but the ease of decrypting leads to
think that the scheme can reencrypt its keys, enabling its reuse.