本文關(guān)鍵詞：帶關(guān)鍵字搜索的代理重加密的研究及其實(shí)現(xiàn)　出處：《山西大學(xué)》2014年碩士論文　論文類(lèi)型：學(xué)位論文

  更多相關(guān)文章： 代理重加密 雙線性對(duì) 選擇密文安全 帶關(guān)鍵詞搜索的代理重加密

【摘要】：隨著云計(jì)算技術(shù)在全球范圍內(nèi)的迅猛發(fā)展,用戶將大量復(fù)雜的數(shù)據(jù)存儲(chǔ)到云平臺(tái)上。盡管云存儲(chǔ)給用戶提供了很多便利,但是安全和隱私問(wèn)題阻礙著云計(jì)算技術(shù)被廣泛應(yīng)用。為了提高云數(shù)據(jù)存儲(chǔ)的安全性和保護(hù)用戶的隱私,如何對(duì)加密的數(shù)據(jù)進(jìn)行高效地搜索查詢,即帶關(guān)鍵字搜索的加密體制成為密碼學(xué)的一個(gè)活躍研究課題。本文主要研究帶關(guān)鍵字搜索的代理重加密((Proxy encryption with key word search)PRES)體制的安全模型和方案的構(gòu)造。給出了指定檢驗(yàn)者的具有關(guān)鍵字搜索性質(zhì)的代理重加密(dPRES)的定義和安全模型,且構(gòu)造出了一個(gè)在適應(yīng)性合謀模型下可證明CCA-安全的dPRES方案,而且所構(gòu)造方案在標(biāo)準(zhǔn)模型下可證明安全。該方案基于三個(gè)相關(guān)的困難問(wèn)題：判定雙線性Diffie-Hellman即(DBDH)假設(shè)；Hash Diffie-Hellman(HDH)假設(shè)；商判定雙線性Diffie-Hellman即(QDBDH)假設(shè)。我們所構(gòu)造的方案有以下三個(gè)優(yōu)點(diǎn)：首先,當(dāng)用戶傳遞給指定檢驗(yàn)者關(guān)鍵字的陷門(mén)時(shí),不使用安全信道；第二,我們所構(gòu)造的dPRES方案能夠抵制關(guān)鍵字離線猜測(cè)攻擊；第三,本方案不使用強(qiáng)不可偽造一次性簽名方案,從而使得我們的方案更加有效。本文還對(duì)算法涉及的雙線性映射運(yùn)算用java語(yǔ)言編碼實(shí)現(xiàn),具體包括了：元素相等性判斷,散列值計(jì)算,自身加操作計(jì)算,相加計(jì)算,曲線元素的實(shí)現(xiàn),橢圓曲線兩點(diǎn)線性映射對(duì)計(jì)算,大整數(shù)運(yùn)算工具函數(shù)等具體的程序?qū)崿F(xiàn)函數(shù)。為新構(gòu)造的方案部署到實(shí)際的云計(jì)算、郵件服務(wù)系統(tǒng)等實(shí)際應(yīng)用提供了方便。
[Abstract]:With the rapid development of cloud computing technology in the world, users will store a large number of complex data on the cloud platform, although cloud storage provides users with a lot of convenience. In order to improve the security of cloud data storage and protect the privacy of users, how to efficiently search and query encrypted data. The encryption system with keyword search has become an active research topic in cryptography. Proxy encryption with key word search. The definition and security model of proxy reencryption with keyword search property are given. And a dPRES scheme which can prove CCA-security under adaptive collusion model is constructed. Moreover, the proposed scheme can be proved to be safe under the standard model. The scheme is based on three related difficult problems: the bilinear Diffie-Hellman hypothesis; Hash Diffie-Hellman hypothesis; Quotient decision bilinear Diffie-Hellman (QDBDH) hypothesis. Our scheme has the following three advantages: first, when the user passes to the trapping door of the specified verifier keyword. Do not use secure channels; Secondly, the proposed dPRES scheme can resist the off-line keyword guessing attack. Third, this scheme does not use strong unforgeable one-time signature scheme, which makes our scheme more effective. The bilinear mapping algorithm involved in the algorithm is also implemented by java language coding. It includes: element equality judgment, hash value calculation, self-addition operation calculation, addition calculation, curve element realization, elliptic curve two-point linear mapping pair calculation. Large integer operation tool functions and other specific program implementation functions, for the new scheme to deploy to the actual cloud computing, mail service systems and other practical applications to provide convenience.
【學(xué)位授予單位】：山西大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類(lèi)號(hào)】：TN918.4

【參考文獻(xiàn)】

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

1 陳康;鄭緯民;;云計(jì)算:系統(tǒng)實(shí)例與研究現(xiàn)狀[J];軟件學(xué)報(bào);2009年05期

，

本文編號(hào)：1386737