排序可驗(yàn)證的語(yǔ)義模糊可搜索加密方案
發(fā)布時(shí)間:2018-02-24 05:09
本文關(guān)鍵詞: 云計(jì)算安全 可搜索加密 語(yǔ)義相似度 域加權(quán)得分 排序可驗(yàn)證 出處:《工程科學(xué)與技術(shù)》2017年04期 論文類(lèi)型:期刊論文
【摘要】:為解決現(xiàn)有語(yǔ)義模糊可搜索加密方案無(wú)法取得排序可驗(yàn)證的問(wèn)題,提出一種支持語(yǔ)義模糊搜索并能對(duì)搜索結(jié)果的排序進(jìn)行驗(yàn)證的方案。首先引入相關(guān)度分?jǐn)?shù)和域加權(quán)得分,構(gòu)造精確度更高的倒排索引結(jié)構(gòu)。通過(guò)非線性保序加密,云服務(wù)器可以對(duì)搜索結(jié)果進(jìn)行高效排序,減少了用戶的計(jì)算開(kāi)銷(xiāo)和網(wǎng)絡(luò)資源浪費(fèi)。接著基于WordNet詞典集對(duì)查詢關(guān)鍵詞進(jìn)行語(yǔ)義拓展。在構(gòu)造出語(yǔ)義拓展樹(shù)后,只選取最相關(guān)的語(yǔ)義拓展詞進(jìn)行查詢。通過(guò)引入語(yǔ)義相似度,設(shè)計(jì)雙因子排序算法對(duì)搜索結(jié)果進(jìn)行精確排序。然后為創(chuàng)建驗(yàn)證信息,將關(guān)鍵詞集合插入布隆過(guò)濾器中,并計(jì)算布隆過(guò)濾器、安全索引、密文文檔的消息認(rèn)證碼。在搜索階段,通過(guò)布隆過(guò)濾器可以驗(yàn)證索引中是否存在查詢關(guān)鍵詞,并使用消息認(rèn)證碼對(duì)索引、文檔的完整性和正確性進(jìn)行驗(yàn)證。通過(guò)引入索引樹(shù)結(jié)構(gòu)進(jìn)一步提高方案的搜索效率。最后,將本方案與相關(guān)方案在功能、存儲(chǔ)開(kāi)銷(xiāo)、搜索開(kāi)銷(xiāo)等方面進(jìn)行比較,并對(duì)創(chuàng)建索引、創(chuàng)建驗(yàn)證信息、語(yǔ)義拓展、加密查詢、查詢、驗(yàn)證等方面的開(kāi)銷(xiāo)進(jìn)行仿真實(shí)驗(yàn)。方案對(duì)比分析顯示本方案在語(yǔ)義搜索、排序、驗(yàn)證等功能上具有優(yōu)勢(shì)。實(shí)驗(yàn)結(jié)果表明,本方案不僅實(shí)現(xiàn)了語(yǔ)義模糊搜索與結(jié)果排序,而且實(shí)現(xiàn)了排序結(jié)果可驗(yàn)證功能。
[Abstract]:In order to solve the problem that the existing semantic fuzzy searchable encryption schemes can not obtain sort verifiability, this paper proposes a scheme that supports semantic fuzzy search and verifies the ranking of search results. Firstly, correlation score and domain weighted score are introduced. Construct a more accurate inverted index structure. Through nonlinear sequential encryption, cloud servers can efficiently sort search results. After constructing the semantic extension tree, only the most relevant semantic extension words are selected to query, and the semantic similarity is introduced. Design two-factor sorting algorithm to sort the search results accurately. Then to create validation information, insert the keyword set into the Bloom filter, and calculate the message authentication code of the Bron filter, security index, ciphertext document. It is possible to verify whether there are query keywords in the index by using the Bron filter, and verify the integrity and correctness of the index and document by using the message authentication code. By introducing the index tree structure, the search efficiency of the scheme can be further improved. Finally, the search efficiency of the scheme is further improved by introducing the index tree structure. The scheme is compared with the related schemes in terms of function, storage overhead, search cost, etc., and the index is created, the verification information is created, the semantic extension, the query is encrypted, and the query is queried. The comparison analysis shows that the scheme has advantages in semantic search, sorting, verification and so on. The experimental results show that the scheme not only realizes semantic fuzzy search and result sorting, but also shows that the proposed scheme has the advantages of semantic search, sorting and verification. Moreover, the verification function of sorting results is realized.
【作者單位】: 福州大學(xué)數(shù)學(xué)與計(jì)算機(jī)科學(xué)學(xué)院;網(wǎng)絡(luò)系統(tǒng)信息安全福建省高校重點(diǎn)實(shí)驗(yàn)室;福州大學(xué)物理與信息工程學(xué)院;
【基金】:國(guó)家自然科學(xué)基金資助項(xiàng)目(61402112;61502086) 福建省教育廳科技項(xiàng)目資助(JA12028) 中央高;究蒲袠I(yè)務(wù)費(fèi)資助(ZYGX2014J01)
【分類(lèi)號(hào)】:TP309
【參考文獻(xiàn)】
相關(guān)期刊論文 前1條
1 林柏鋼;吳陽(yáng);楊e,
本文編號(hào):1528984
本文鏈接:http://sikaile.net/kejilunwen/ruanjiangongchenglunwen/1528984.html
最近更新
教材專(zhuān)著