Middle-Product Learning with Rounding Problem and its Applications

Shi Bai (1) , Katharina Boudgoust (2) , Dipayan Das (3) , Adeline Roux-Langlois (2) , Weiqiang Wen (2) , Zhenfei Zhang (4)

1 Florida Atlantic University [Boca Raton]
2 IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires
3 NIT Durgapur - National Institute of Technology [Durgapur]
4 Algorand Foundation

At CRYPTO 2017, Roşca et al. introduce a new variant of the Learning With Errors (LWE) problem, called the Middle-Product LWE (MP-LWE). The hardness of this new assumption is based on the hardness of the Polynomial LWE (P-LWE) problem parameterized by a set of polynomials, making it more secure against the possible weakness of a single defining polynomial. As a cryptographic application, they also provide an encryption scheme based on the MP-LWE problem. In this paper, we propose a deterministic variant of their encryption scheme, which does not need Gaussian sampling and is thus simpler than the original one. Still, it has the same quasi-optimal asymptotic key and ciphertext sizes. The main ingredient for this purpose is the Learning With Rounding (LWR) problem which has already been used to deran-domize LWE type encryption. The hardness of our scheme is based on a new assumption called Middle-Product Computational Learning With Rounding, an adaption of the computational LWR problem over rings, introduced by Chen et al. at ASIACRYPT 2018. We prove that this new assumption is as hard as the decisional version of MP-LWE and thus benefits from worst-case to average-case hardness guarantees.

Mots clés: Public Key Encryption; Middle-Product; LWR; LWE

Domaines: Informatique [cs]

Shi Bai, Katharina Boudgoust, Dipayan Das, Adeline Roux-Langlois, Weiqiang Wen, et al.. Middle-Product Learning with Rounding Problem and its Applications. Asiacrypt 2019 - 25th Annual International Conference on the Theory and Application of Cryptology and Information Security, Dec 2019, Kobe, Japan. ⟨10.1007/978-3-030-34578-5_3⟩. ⟨hal-02880043⟩