Introducing GRAFHEN: Group-based Fully Homomorphic Encryption without Noise
Pierre Guillot, Auguste Hoang Duc, Michel Koskas, Florian Méhats
我们提出了GRAFHEN,一种新的加密方案,提供完全同态加密,无需引导(或者换句话说,没有噪音)。 在Nuida和其他人的工作基础上,我们使用组中的编码来实现这一点。 这些组在机器上使用重写系统表示。 通过这种方式,攻击者必须解决的子组成员资格问题才能打破方案,从而变得极其困难,同时保留性能。 事实上,我们包括一个简单的基准,表明我们的实施运行速度比现有标准快几个数量级。 我们审查许多针对我们协议的可能攻击,并解释如何在每种情况下保护该计划。
We present GRAFHEN, a new cryptographic scheme which offers Fully Homomorphic Encryption without the need for bootstrapping (or in other words, without noise). Building on the work of Nuida and others, we achieve this using encodings in groups. The groups are represented on a machine using rewriting systems. In this way the subgroup membership problem, which an attacker would have to solve in order to break the scheme, becomes maximally hard, while performance is preserved. In fact we include a ...