本文選題：隱私保護 + 范圍查詢　； 參考：《北京郵電大學(xué)學(xué)報》2015年06期

【摘要】：針對兩層傳感器網(wǎng)絡(luò)環(huán)境,提出了一種安全高效的范圍查詢算法.在數(shù)據(jù)存儲階段,傳感節(jié)點對感知數(shù)據(jù)進行加密處理,并利用保序函數(shù)生成保序編碼,然后將密文和編碼數(shù)據(jù)上傳至存儲節(jié)點.在查詢處理階段,Sink通過克萊姆法則將查詢范圍轉(zhuǎn)換成下上限多項式,并將查詢請求信息發(fā)送給存儲節(jié)點;存儲節(jié)點通過多項式信息和保序編碼,實現(xiàn)無須明文數(shù)值參與下的大小比較,從而確定查詢結(jié)果,并返回給Sink;Sink獲得查詢結(jié)果,并對感知數(shù)據(jù)進行真實性和完整性驗證.理論分析和實驗結(jié)果表明,該算法能夠保證感知數(shù)據(jù)、查詢結(jié)果和目標(biāo)范圍區(qū)間的隱私,且與現(xiàn)有方法相比具有更高的能效.
[Abstract]:A secure and efficient range query algorithm is proposed for two-layer sensor networks. In the data storage phase, the sensor node encrypts the perceptual data and generates the order-preserving encoding by using the order-preserving function, then uploads ciphertext and encoded data to the storage node. In the stage of query processing, Sink converts the query range into lower upper bound polynomial by Clem's rule, and sends the query request information to the storage node, which is encoded by polynomial information and order-preserving code. The size comparison without the participation of plaintext value is implemented to determine the query results and return them to SinkSink to obtain the query results and verify the authenticity and integrity of the perceptual data. Theoretical analysis and experimental results show that the proposed algorithm can guarantee the privacy of perceptual data, query results and target range, and is more energy efficient than the existing methods.
【作者單位】： 南京航空航天大學(xué)計算機科學(xué)與技術(shù)學(xué)院;安徽師范大學(xué)數(shù)學(xué)計算機科學(xué)學(xué)院;南京郵電大學(xué)計算機學(xué)院;
【基金】：國家自然科學(xué)基金項目(61402014;61373015;61300240) 國家教育部高等學(xué)校博士學(xué)科點專項科研基金資助項目(20103218110017) 江蘇高校優(yōu)勢學(xué)科建設(shè)工程資助項目 中央高�；究蒲袠I(yè)務(wù)費專項基金項目(NP2013307) 安徽省自然科學(xué)基金項目(1508085QF133)
【分類號】：TN915.08;TP212.9

【相似文獻】

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

1 扈紅超;郭云飛;龐琳;卜佑軍;;動態(tài)均衡的LB-BvN分組保序調(diào)度機制[J];通信學(xué)報;2011年04期

，

本文編號：1933055