基于完全敏感资源安全防护的信任协商算法  

Trust negotiation algorithm based on full privacy preservation

作　　者：陈喆[1] 王亚弟[2] 蔡国明[1] 卢明龙[1] 

机构地区：[1]解放军信息工程大学电子技术学院,郑州450004 [2]解放军信息工程大学,郑州450001

出　　处：《计算机应用研究》2010年第1期226-230,共5页Application Research of Computers

基　　金：国家"863"计划资助项目(2008AA01Z404);国防预研基金资助项目(9140A26010306JB5201)

摘　　要：传统信任协商存在对凭证和访问控制策略的安全防护不足、无法避免策略循环依赖等问题,不适用于安全性要求较高的应用环境。在对信任协商过程中现有敏感资源分类进行扩充的基础上,提出了一个基于完全敏感资源防护的信任协商算法(full privacy preservation based TNS,FPPB_TNA)。该算法采用广度优先搜索方法对协商双方的资源披露进行控制,通过安全双方计算对完全敏感资源进行保护,不仅提高了算法的执行效率,而且有效地解决了策略循环依赖问题。算法分析和应用实例证明FPPB_TNA算法具有较好的安全性和完备性。Traditional trust negotiation has the insufficiency of credence and privacy preservation of access control strategy, and unsuitably applies in the high security requirement environment. According to the extension of sensitivity resource classification in trust negotiation process, presented a trust negotiation algorithm based on full privacy preservation（FPPB_TNA）. This algorithm adopted breadth-first search to control the negotiators resources issuance, and adopted secure two-party computing to protect the full privacy, that not only improved the efficiency, but also effectively resolved policy cycle dependence. The analysis and application instance of algorithm prove the better security and maturity of the FPPB_TNA algorithm.

关 键 词：敏感资源 安全防护 信任协商 策略循环依赖 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]