One-Round Secure Computation and Secure Autonomous Mobile Agents0

One-Round Secure Computation and Secure Autonomous Mobile Agents0

ID:40086701

大小:224.26 KB

页数:12页

时间:2019-07-20

One-Round Secure Computation and Secure Autonomous Mobile Agents0_第1页
One-Round Secure Computation and Secure Autonomous Mobile Agents0_第2页
One-Round Secure Computation and Secure Autonomous Mobile Agents0_第3页
One-Round Secure Computation and Secure Autonomous Mobile Agents0_第4页
One-Round Secure Computation and Secure Autonomous Mobile Agents0_第5页
资源描述:

《One-Round Secure Computation and Secure Autonomous Mobile Agents0》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、One-RoundSecureComputationandSecureAutonomousMobileAgents(ExtendedAbstract)ChristianCachin1,JanCamenisch1,JoeKilian2,andJoyM•uller1Abstract.Thispaperinvestigatesone-roundsecurecomputationbe-tweentwodistrustingparties:AliceandBobeachhaveprivateinputstoac

2、ommonfunction,butonlyAlice,actingasthereceiver,istolearntheoutput;theprotocolislimitedtoonemessagefromAlicetoBobfollowedbyonemessagefromBobtoAlice.AmodelinwhichBobmaybecompu-tationallyunboundedisinvestigated,whichcorrespondstoinformation-theoreticsecuri

3、tyforAlice.Itisshownthat1.forhonest-but-curiousbehaviorandunboundedBob,anyfunctioncomputablebyapolynomial-sizecircuitcanbecomputedsecurelyassumingthehardnessofthedecisionalDie-Hellmanproblem;2.formaliciousbehaviorbyboth(bounded)parties,anyfunctioncom-p

4、utablebyapolynomial-sizecircuitcanbecomputedsecurely,inapublic-keyframework,assumingthehardnessofthedecisionalDie-Hellmanproblem.Theresultsareappliedtosecureautonomousmobileagents,whichmi-gratebetweenseveraldistrustinghostsbeforereturningtotheirorigina

5、-tor.Aschemeispresentedforprotectingtheagent'ssecretssuchthatonlytheoriginatorlearnstheoutputofthecomputation.1IntroductionSupposeAlicehasasecretinputx,Bobhasasecretinputy,andtheywishtocomputeg(x;y)securelyusingoneroundofinteraction:Aliceshouldlearng(x;

6、y)butnothingelseaboutyandBobshouldlearnnothingatall.Commu-nicationisrestrictedtoonemessagefromAlicetoBobfollowedbyonemessagefromBobtoAlice.Withouttherestrictiononthenumberofrounds,thisistheproblemofsecurefunctionevaluationintroducedbyYao[26]andGoldreich

7、etal.[17].Itisknownthatundercryptographicassumptions,everyfunctioncanbecomputedsecurelyandusinga(small)constantnumberofrounds.Theproblemiscloselyrelatedtothequestionofcomputingwithencrypteddata"[22]:Aliceholdssomeinputx,Bobholdsafunctionf,andAliceshoul

8、dlearnf(x)inaone-roundprotocol,whereAlicesendstoBobanencryption"ofx,Bobcomputesfontheencrypted"dataxandsendstheresulttoAlice,whodecrypts"thistof(x).Thedualofthisiscomputingwithencryptedfunctions,"whereAliceholdsafunctionf,Bob

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

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

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