检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘思聪[1] 郑日忠[2] 张启坤 蔡增玉[1] 甘勇[1]
机构地区:[1]郑州轻工业学院计算机与通信工程学院,河南郑州450001 [2]河南建筑职业技术学院,河南郑州450064
出 处:《计算机技术与发展》2018年第2期130-134,共5页Computer Technology and Development
基 金:国家自然科学基金资助项目(61572445;61501406;61672471);河南省自然科学基金(162300410322);河南省高等学校重点科研项目(15A520032;15A510015)
摘 要:访问控制是保障秘密信息免受非法访问及获取的关键技术之一,基于信任机制的访问控制是其常用的方法。鉴于堆结构具有较快的收敛速度,能高效地反馈信息,以及贝叶斯算法能够有效地预测未知访问者的可靠度和信任度,提出基于堆结构的多域间访问控制模型。通过改进贝叶斯算法,建立一种更加准确的信任度预测方法。将堆结构和改进的贝叶斯算法相结合,建立基于堆结构的信任体制。通过堆的性质及固有的计算效率,以及贝叶斯信任度预测算法的准确性,提高信任度的收敛速度及准确度。依据信任度的可靠性,快速、有效地约束域间资源访问,以实现域间访问控制的目的。实验结果表明,与相关技术相比,提出的方案具有高效性和较高的准确率。Access control is one of the key technologies to protect confidential information from unauthorized access and stealing. Trust-based access control is a common approach. In consideration of the heap structure with fast convergence speed and efficient information feedback,and the Bayesian algorithm which can effectively predict the reliability and trust of unknown visitors,in this paper we propose a heap-based access control model of multi-domain. We improve the Bayesian algorithm and establish a more accurate trust forecasting. Thencombined both heap structure and the improved Bayesian algorithm,a trust system based on heap structure is constructed. For the nature ofthe heap and its inherent computational efficiency,as well as the accuracy of the Bayesian trust degree prediction algorithm,the convergencespeed and accuracy of the trust degree are improved. According to the reliability,it can be fast and effective constraint of resource access between different domains,to achieve the purpose of inter-domain access control. Experiment shows that the proposed scheme is more effectiveand accurate compared with the related technology.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.177