【摘要】：可驗(yàn)證計(jì)算是分布式計(jì)算和云計(jì)算環(huán)境下,解決任務(wù)分包以及任務(wù)委托計(jì)算中產(chǎn)生的計(jì)算結(jié)果可靠性(可信性)問(wèn)題的重要手段.本文總結(jié)可驗(yàn)證計(jì)算重要研究進(jìn)展,主要涉及計(jì)算機(jī)理論領(lǐng)域和密碼學(xué)領(lǐng)域的最新研究進(jìn)展.在計(jì)算機(jī)理論領(lǐng)域的可驗(yàn)證計(jì)算研究方面,討論了交互式證明、可隨機(jī)檢查證明定理(PCP theorem)和可靠性證明(CS proof)之間的聯(lián)系、發(fā)展及其在可驗(yàn)證計(jì)算中的應(yīng)用.在密碼學(xué)領(lǐng)域的可驗(yàn)證計(jì)算方面,主要對(duì)應(yīng)用密碼學(xué)工具構(gòu)建的可驗(yàn)證計(jì)算方案進(jìn)行了分析總結(jié).此外,簡(jiǎn)要介紹代理存儲(chǔ)背景下的可驗(yàn)證計(jì)算.最后對(duì)可驗(yàn)證計(jì)算未來(lái)的發(fā)展方向進(jìn)行展望.
[Abstract]:Verifiable computing is an important means to solve the reliability (credibility) problem of task subcontracting and task entrustment computing in distributed computing and cloud computing environment. In this paper, the important research progress of verifiable computing is summarized, mainly involving the latest research progress in the field of computer theory and cryptography. In the field of computer theory, the relationship between interactive proof, random checking proof theorem (PCP theorem) and reliability proof (CS proof) is discussed, and its application in verifiable calculation is also discussed. In the field of cryptography, the verifiable computing scheme constructed by cryptography tools is analyzed and summarized. In addition, the verifiable calculation under the background of proxy storage is briefly introduced. Finally, the future development direction of verifiable computing is prospected.
【作者單位】： 中國(guó)科學(xué)院信息工程研究所信息安全國(guó)家重點(diǎn)實(shí)驗(yàn)室;上海科技大學(xué)信息科學(xué)與技術(shù)學(xué)院;
【基金】：國(guó)家自然科學(xué)基金(批準(zhǔn)號(hào):61402471,61472414,61170280) 中國(guó)科學(xué)院戰(zhàn)略性先導(dǎo)科技專項(xiàng)(批準(zhǔn)號(hào):XDA06010701)資助
【分類(lèi)號(hào)】：TP338.8;TP309

【相似文獻(xiàn)】

相關(guān)碩士學(xué)位論文 前1條

1 張?jiān)?可驗(yàn)證計(jì)算協(xié)議的改進(jìn)與應(yīng)用研究[D];北京郵電大學(xué);2015年

，

本文編號(hào)：2484261