Polly Cracker, Revisited

Abstract : We formally treat cryptographic constructions based on the hardness of deciding ideal membership in multivariate polynomial rings. Of particular interest to us is a class of schemes known as "Polly Cracker." We start by formalising and studying the relation between the ideal membership problem and the problem of computing a Gröbner basis. We show both positive and negative results. On the negative side, we define a symmetric Polly Cracker encryption scheme and prove that this scheme only achieves bounded CPA security under the hardness of the ideal membership problem. Furthermore, we show that a large class of algebraic transformations cannot convert this scheme to a fully secure Polly Cracker-style scheme. On the positive side, we formalise noisy variants of the ideal-theoretic problems. These problems can be seen as natural generalisations of the learning with errors (LWE) and the approximate GCD problems over polynomial rings. After formalising and justifying the hardness of the noisy assumptions, we show that noisy encoding of messages results in a fully IND-CPA-secure and somewhat homomorphic encryption scheme. Together with a standard symmetric-to-asymmetric transformation for additively homomorphic schemes, we provide a positive answer to the long-standing open problem of constructing a secure Polly Cracker-style cryptosystem reducible to the hardness of solving a random system of equations. Indeed, our results go beyond this and also provide a new family of somewhat homomorphic encryption schemes based on generalised hard problems. Our results also imply that Regev's LWE-based public-key encryption scheme is (somewhat) multiplicatively homomorphic for appropriate choices of parameters.
Type de document :
Article dans une revue
Designs, Codes and Cryptography, Springer Verlag, 2011, pp.43
Liste complète des métadonnées

Littérature citée [66 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01112976
Contributeur : Ludovic Perret <>
Soumis le : mercredi 4 février 2015 - 09:27:34
Dernière modification le : vendredi 25 mai 2018 - 12:02:06
Document(s) archivé(s) le : mercredi 27 mai 2015 - 16:41:04

Fichier

mq-homomorphic (1).pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01112976, version 1

Collections

Citation

Martin Albrecht, Jean-Charles Faugère, Pooya Farshim, Gottfried Herold, Ludovic Perret. Polly Cracker, Revisited. Designs, Codes and Cryptography, Springer Verlag, 2011, pp.43. 〈hal-01112976〉

Partager

Métriques

Consultations de la notice

285

Téléchargements de fichiers

219