To analyze the efficiency of the homomorphic encryption schemes at the core of the HEAT project, we studied how the Rényi divergence can be used instead of the statistical distance. The Rényi divergence is a measure of closeness of two probability distributions. In the HEAT project, we obtained that the latter divergence can often be used as an alternative to the statistical distance in security proofs for lattice-based cryptography, and therefore in homomorphic encryption schemes.

Our contributions are as follows:

and are described in the article

Our contributions are as follows:

- Smaller signatures for the Hash-and-Sign Gentry-Peikert-Vaikuntanathan signature scheme
- Smaller storage requirement for the Fiat-Shamir BLISS signature scheme
- Alternative proof that the Learning With Errors problem with noise chosen uniformly in an interval is no easier than the Learning With Errors problem with Gaussian noise (and tighter reduction!)
- Smaller parameters for the dual-Regev encryption scheme

and are described in the article

*Shi Bai and Adeline Langlois and Tancrède Lepoint and Damien Stehlé and Ron Steinfeld*

This article has been accepted for publication at ASIACRYPT 2015 and will receive the

*.***Best Paper Award**
ASIACRYPT 2015 is one of the top-tier conference of cryptography, organized by the IACR, and will take place in December 2015 in New Zealand.

## No comments:

## Post a Comment