CAJ | 학술논문

传统信任协商存在对凭证和访问控制策略的安全防护不足、无法避免策略循环依赖等问题,不适用于安全性要求较高的应用环境.在对信任协商过程中现有敏感资源分类进行扩充的基础上,提出了一个基于完全敏感资源防护的信任协商算法(full privacy preservation based TNS, FPPB_TNA).该算法采用广度优先搜索方法对协商双方的资源披露进行控制,通过安全双方计算对完全敏感资源进行保护,不仅提高了算法的执行效率,而且有效地解决了策略循环依赖问题.算法分析和应用实例证明FPPB_TNA算法具有较好的安全性和完备性.
전통신임협상존재대빙증화방문공제책략적안전방호불족、무법피면책략순배의뢰등문제,불괄용우안전성요구교고적응용배경.재대신임협상과정중현유민감자원분류진행확충적기출상,제출료일개기우완전민감자원방호적신임협상산법(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.