本文關(guān)鍵詞： 函數(shù)加密 內(nèi)積函數(shù)加密 ORE體制 加密數(shù)據(jù)范圍查詢　出處：《浙江理工大學(xué)》2017年碩士論文　論文類型：學(xué)位論文

【摘要】：函數(shù)加密是對傳統(tǒng)加密的擴(kuò)展,它允許第三方在不解密密文的情況下計算輸出明文的函數(shù)值,非常適合于加密數(shù)據(jù)外包計算場景。函數(shù)加密是現(xiàn)代密碼學(xué)的重要分支,具有重要的理論價值及廣泛的應(yīng)用前景。然而,目前所有的支持任意函數(shù)的通用函數(shù)加密體制都要使用低效的不可區(qū)分混淆器,因而還不是很實用。本文我們將重點(diǎn)研究支持特定函數(shù)的實用函數(shù)加密體制,如內(nèi)積函數(shù)加密、order-revealing encryption(ORE)。這些特定函數(shù)的加密體制是通用函數(shù)加密體制的特例,它們的構(gòu)造并不依靠不可區(qū)分混淆器,因而是非常高效的。我們的主要研究成果如下:1.Kim等闡述了函數(shù)隱藏的內(nèi)積函數(shù)加密方案的三個應(yīng)用場景:加密生物特征認(rèn)證、加密最近鄰向量查找、加密線性回歸。他們并沒有對這三個應(yīng)用實現(xiàn)程序。我們的主要貢獻(xiàn)如下:對三個應(yīng)用實現(xiàn)過程進(jìn)行了具體描述,給出了程序?qū)崿F(xiàn)及測試與比較。2.Lewi等提出了基于ORE方案的加密數(shù)據(jù)范圍查詢體制。他們的方案使用了順序表組織數(shù)據(jù),采用的是二叉查找算法。該算法的查找時間復(fù)雜度是對數(shù)級別,但是在插入、刪除的時候需要移動大量的數(shù)據(jù),造成了很多不必要的開銷。本文,我們采用基于B+樹數(shù)據(jù)結(jié)構(gòu)來組織加密數(shù)據(jù),我們的改進(jìn)方案在查找、插入和刪除等方面的時間復(fù)雜度都是對數(shù)級別。
[Abstract]:Function encryption is an extension of traditional encryption, which allows third parties to calculate the output value of plaintext without decrypting ciphertext, which is very suitable for outsourced computing scenarios of encrypted data. Function encryption is an important branch of modern cryptography. It has important theoretical value and wide application prospect. However, at present, all general function encryption schemes that support arbitrary functions must use indistinguishable obfuscators with low efficiency. Therefore, it is not very practical. In this paper, we will focus on the study of functional encryption schemes that support specific functions, such as inner product functions, such as order-realing encryption schemes, which are special examples of general function encryption schemes. They are very efficient because they do not rely on indiscernible obfuscators. Our main research results are as follows: 1. Kim and others describe the three application scenarios of the function hidden inner product function encryption scheme: encryption biometric authentication. Encryption nearest neighbor vector search, encryption linear regression. They did not implement the three applications. Our main contribution is as follows: the implementation of the three applications are described in detail. The program implementation and test and comparison. 2. Lewi and others put forward a scheme based on ORE scheme to query the range of encrypted data. Their scheme uses the order table to organize the data. Binary search algorithm is used in this algorithm. The complexity of the algorithm is logarithmic, but when inserting and deleting, a lot of data need to be moved, resulting in a lot of unnecessary overhead. We use the B-tree data structure to organize the encrypted data. The time complexity of our improved scheme is logarithmic in the aspects of lookup, insertion and deletion.
【學(xué)位授予單位】：浙江理工大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP309.7

【參考文獻(xiàn)】

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

1 肖招娣;高維數(shù)據(jù)集上的降維算法及其應(yīng)用[D];華南理工大學(xué);2013年

，

本文編號：1502713