首页> 外文会议>International conference on information security and cryptology >Cryptanalysis of a Homomorphic Encryption Scheme Over Integers
【24h】

Cryptanalysis of a Homomorphic Encryption Scheme Over Integers

机译:整数同态加密方案的密码分析

获取原文

摘要

At Eurocrypt 2010, van Dijk et al. described a fully homomorphic encryption scheme (abbreviated as DGHV) over integers. It is conceptually simple but the public key size is large. After DGHV scheme was proposed, many variants of DGHV schemes with smaller public key size were proposed. In this paper, we present a multi-ciphertexts attack on a variant of the DGHV scheme with much smaller public key (abbreviated as HE~(RK)), which was proposed by Govinda Ramaiah and Vijaya Kumari at CNC 2012. Multi-ciphertexts attack considers the security of the schemes when the attacker captures a certain amount of cipher-texts. It is a common phenomena that the attacker can easily obtain enough ciphertexts in most of practical applications of fully homomorphic encryptions (even for public-key schemes). For all the four groups of the recommended parameters of HE~(RK), we can recover the plaintexts successfully if we only capture five ciphertexts. Our attack only needs to apply LLL algorithm twice on two small dimension lattices, and the data show that the plaintexts can be recovered in seconds.
机译:在2010年Eurocrypt大会上,van Dijk等人。描述了整数上的完全同态加密方案(缩写为DGHV)。它在概念上很简单,但是公钥大小很大。在提出DGHV方案之后,提出了具有较小公钥大小的DGHV方案的许多变体。在本文中,我们提出了对DGHV方案的变体的多密文攻击,该变体的公钥要小得多(缩写为HE〜(RK)),这是Govinda Ramaiah和Vijaya Kumari在CNC 2012上提出的。当攻击者捕获一定数量的密文时,考虑方案的安全性。常见的现象是,攻击者可以在大多数完全同态加密的实际应用中轻松获得足够的密文(即使对于公钥方案)。对于HE〜(RK)的所有四个推荐参数组,如果仅捕获五个密文,则可以成功恢复明文。我们的攻击只需要在两个小尺寸的格子上应用两次LLL算法,数据表明纯文本可以在几秒钟内恢复。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号