Fully Homomorphic Encryption over the Integers

Fully Homomorphic Encryption over the Integers

ID:41188337

大小:358.39 KB

页数:28页

时间:2019-08-18

Fully Homomorphic Encryption over the Integers_第1页
Fully Homomorphic Encryption over the Integers_第2页
Fully Homomorphic Encryption over the Integers_第3页
Fully Homomorphic Encryption over the Integers_第4页
Fully Homomorphic Encryption over the Integers_第5页
资源描述:

《Fully Homomorphic Encryption over the Integers》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、FullyHomomorphicEncryptionovertheIntegersMartenvanDijkCraigGentryShaiHaleviVinodVaikuntanathanMITIBMResearchIBMResearchIBMResearchJune8,2010AbstractWedescribeaverysimple“somewhathomomorphic”encryptionschemeusingonlyelemen-tarymodulararithmetic,anduseGentry’stechniquestoconvertitintoafullyh

2、omomorphicscheme.ComparedtoGentry’sconstruction,oursomewhathomomorphicschememerelyusesadditionandmultiplicationovertheintegersratherthanworkingwithideallatticesoverapolynomialring.Themainappealofourapproachistheconceptualsimplicity.Wereducethesecurityofoursomewhathomomorphicschemetofindinga

3、napproximateintegergcd–i.e.,givenalistofintegersthatarenear-multiplesofahiddeninteger,outputthathiddeninteger.Weinvestigatethehardnessofthistask,buildingonearlierworkofHowgrave-Graham.1IntroductionWhatisthesimplestencryptionschemeforwhichonecanhopetoachievesecurity?TheCaesarcipherissimple,

4、butnotsecure.Webelievethatconventionalpublic-keyencryptionschemeswithmodularexponentiationsaresecure,butmodularexponentiationisnotaverysimpleoperation.Ifweweretoforgetourcurrentschemesandstartfromscratch,perhapssomethinglikethefollowingschemewouldbeagoodcandidateforasimplesymmetricencrypti

5、onscheme:KeyGen:Thekeyisanoddinteger,chosenfromsomeintervalp∈[2η−1,2η).Encrypt(p,m):Toencryptabitm∈{0,1},settheciphertextasanintegerwhoseresiduemodphasthesameparityastheplaintext.Namely,setc=pq+2r+m,wheretheintegersq,rarechosenatrandominsomeotherprescribedintervals,suchthat2rissmallerthanp

6、/2inabsolutevalue.Decrypt(p,c):Output(cmodp)mod2.Whenthenoiserissufficientlysmallerthanthesecretkeyp,thissimpleencryptionschemeturnsouttobe“somewhathomomorphic”inthesenseof[6]–namely,itcanbeusedtoevaluatelow-degreepolynomialsoverencrypteddata.Moreover,withajudiciouschoiceofparameters(say√3r≈

7、2ηandq≈2η),thissimpleschememayevenbesecure!Specifically,wereducethesecurityoftheschemetothehardnessoftheapproximateintegergreatestcommondivisors(approximateGCD)problemwhich,roughlyspeaking,saysthatitishardtorecoverpgiventhexi’s.Thisproblem,forthecaseoftwoxi’s,w

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。