【摘要】：針對(duì)Van Dijk等人在2010年歐密會(huì)上提出的基于整數(shù)的全同態(tài)加密方案進(jìn)行了研究,此方案的主要優(yōu)勢(shì)在于概念上的簡(jiǎn)單性,將原來(lái)的基于理想格的同態(tài)加密體制替換為一個(gè)非常簡(jiǎn)單的整數(shù)描述的同態(tài)加密體制,但是它的公鑰尺寸為O(λ~(10)),并且每次只能加密1 bit。在原始DGHV同態(tài)加密的基礎(chǔ)上,通過(guò)改變整數(shù)的選取方式和模數(shù),提出了一種一次可以加密k bit的同態(tài)加密方案,且公鑰的尺寸降低至O(λ~7)。最后給出了安全性證明和效率分析,方案與原始方案基于相同的困難問(wèn)題,且加/解密效率有所提高。
[Abstract]:The integer-based full homomorphism encryption scheme proposed by Van Dijk et al in 2010 is studied. The main advantage of this scheme is its conceptual simplicity. The original homomorphic encryption scheme based on ideal lattice is replaced with a very simple homomorphic encryption scheme described by integers, but its public key size is O (位 ~ (10),) and can only be encrypted by 1 bit. at a time. Based on the original DGHV homomorphism encryption, a homomorphic encryption scheme which can encrypt k-bit at one time is proposed by changing the choice of integer and modulus, and the size of public key is reduced to O (位 ~ 7). Finally, the security proof and efficiency analysis are given. The scheme is based on the same difficult problem as the original scheme, and the efficiency of encryption / decryption is improved.
【作者單位】： 北京印刷學(xué)院;西安電子科技大學(xué)通信工程學(xué)院;北京電子科技學(xué)院;
【基金】：國(guó)家自然科學(xué)基金資助項(xiàng)目(61370188) 北京市支持中央高校共建項(xiàng)目—青年英才計(jì)劃資助項(xiàng)目 中央高�；究蒲袠I(yè)務(wù)費(fèi)專項(xiàng)資金資助項(xiàng)目
【分類號(hào)】：TN918.4

【相似文獻(xiàn)】

相關(guān)期刊論文 前10條

1 閆世斗;劉念;李子臣;;公鑰密碼體制的同態(tài)性分析[J];北京電子科技學(xué)院學(xué)報(bào);2012年02期

2 楊耀增;;用同態(tài)，

本文編號(hào)：2457312