检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]河南农业大学信息与管理科学学院,河南郑州450046 [2]中州大学信息工程学院,河南郑州450044
出 处:《计算机仿真》2014年第12期421-424,共4页Computer Simulation
摘 要:高强度数据隐私保护下,存在高强度的数据加密,导致传统的数据查询方法,需要频繁的进行数据加密和解密运算才能完成查询过程,极大降低了数据查询效率。为提高快捷数据查询的精度,提出了一种应用前缀编码验证机制的数据优化查询方法,高强度隐私约束规则的数据属性分解,需要实现最小加密数据属性分解,依据该规范构建数据查询模型,对采集到的数据进行加密和编码处理,融入前缀编码验证机制,在感知端传递密文数据的同时,上传用于感知数据线性关系对比的编码数据,外包服务器利用线性关系对比,明确包含查询结果的最小加密数据属性集,再上传到用户端,由用户端进行解密,运算出数据查询结果,实现高强度隐私保护下数据优化查询。实验结果说明,所提方法可在高强度隐私保护下,对数据进行快速查询,并且具有较高的查询精度。In order to achieve the goal of properties decomposition of the data with high strength of privacy con- straint rule,the attribute decomposition of the minimum encrypted data was required. A data query model was con- strutted on the basis of that specification, the collected data were encrypted and coded, then infused into prefix enco- ding verification mechanism. On the process of conveying ciphertext data in the perceiver, the encoded data for per- ceiving its linear comparison relationship were uploaded. Outsourced server storage defined the minimum encrypted data set of properties which contained the query result by using the comparison of the linear relationship. The data set was then uploaded to the server and decoded by users, thus the query results can be computed and the data query op- timization was realized under high intensity of privacy protection. Experimental resuhs indicate that the proposed method is of great help in fast data query under the high strength of privacy protection, and the query precision is quite high.
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.223.213.54