计算机应用与软件Issue(11)：289-291,320,4.DOI:10.3969/j.issn.1000-386x.2014.11.073
自动信任协商中最优信任证披露序列的构建方法
CONSTRUCTING OPTIMAL CREDENTIAL DISCLOSURE SEQUENCE IN AUTOMATED TRUST NEGOTIATION
摘要
Abstract
In order to lower the overhead of credentials disclosure in automated trust negotiation (ATN), we introduce the notion of re-source disclosure policy tree (RDPT).By adding an integrity level field and a confidentiality level field to the secure associated load of initial exchange messages of IKEv2 protocol, the RDFPT is allowed to support the secure exchange of ATN policy, thus the data base is provided for the construction of RDPT.We present the optimal credential disclosure sequence search algorithm, which can search from RDPT the creden-tial disclosure policy with best efficiency.关键词
自动信任协商/信任证/披露策略/访问控制Key words
Automated trust negotiation/Credential/Disclosure policy/Access control分类
信息技术与安全科学引用本文复制引用
陈泽茂,王浩..自动信任协商中最优信任证披露序列的构建方法[J].计算机应用与软件,2014,(11):289-291,320,4.基金项目
国家自然科学基金项目（61100042）。 （）
