• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Designs, Codes and Crytography >Group homomorphic encryption: characterizations, impossibility results, and applications
【24h】

Group homomorphic encryption: characterizations, impossibility results, and applications

机译：组同态加密：表征，不可能结果和应用

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We give a complete characterization both in terms of security and design of all currently existing group homomorphic encryption schemes, i.e., existing encryption schemes with a group homomorphic decryption function such as ElGamal and Paillier. To this end, we formalize and identify the basic underlying structure of all existing schemes and say that such schemes are of shift-type. Then, we construct an abstract scheme that represents all shift-type schemes (i.e., every scheme occurs as an instantiation of the abstract scheme) and prove its IND-CCA1 (resp. IND-CPA) security equivalent to the hardness of an abstract problem called Splitting Oracle-Assisted Subgroup Membership Problem (SOAP) (resp. Subgroup Membership Problem, SMP). Roughly, SOAP asks for solving an SMP instance, i.e., for deciding whether a given ciphertext is an encryption of the neutral element of the ciphertext group, while allowing access to a certain oracle beforehand. Our results allow for contributing to a variety of open problems such as the IND-CCA1 security of Paillier's scheme, or the use of linear codes in group homomorphic encryption. Furthermore, we design a new cryptosystem which provides features that are unique up to now: Its IND-CPA security is based on the k-linear problem introduced by Shacham, and Hofheinz and Kiltz, while its IND-CCA1 security is based on a new k-problem that we prove to have the same progressive property, namely that if the k-instance is easy in the generic group model, the (k + 1 )-instance is still hard.
机译：我们在安全性和设计上都对所有当前存在的组同态加密方案（即具有组同态解密功能的现有加密方案，例如ElGamal和Paillier）进行了完整的描述。为此，我们形式化并确定了所有现有方案的基本底层结构，并说此类方案是移位型的。然后，我们构造一个代表所有移位类型方案的抽象方案（即，每个方案都作为抽象方案的实例出现），并证明其IND-CCA1（相当于IND-CPA）的安全性等同于抽象问题的难度称为拆分Oracle协助的子组成员资格问题（SOAP）（分别是子组成员资格问题，SMP）。粗略地说，SOAP要求解决SMP实例，即，确定给定的密文是否是密文组中性元素的加密，同时允许事先访问某个特定的oracle。我们的结果有助于解决各种开放性问题，例如Paillier方案的IND-CCA1安全性，或在组同态加密中使用线性代码。此外，我们设计了一种新的密码系统，该系统提供了迄今为止独一无二的功能：其IND-CPA安全性是基于Shacham，Hofheinz和Kiltz提出的k线性问题，而其IND-CCA1安全性是基于一种新的我们证明k问题具有相同的渐进性质，即，如果在通用组模型中k实例很容易，则（k +1）实例仍然很困难。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号