自动信任协商中一种最小信任披露策略

A Minimum Credential Disclosure Strategy in Automated Trust Negotiation

自动信任协商是通过逐渐请求和披露数字证书在两个陌生实体间建立相互信任的方法。当前对自动信任协商协商策略的研究,往往存在很多问题。文章提出了一种基于期望因子的自动信任协商模型,该模型采用MCD策略,通过分析各信任证书的期望因子,当可能的协商存在时,它能披露和请求最小的信任证找到一条成功的协商路径,当协商不可能成功时,尽快的发现并终止它。它能保证在协商的过程中没有不相关的信任证被披露并且不需要暴露双方的访问控制策略,同时通过实验证了明MCD策略是完备的。

Automated trust negotiation is an approach establishing mutual trust between strangers by gradually requesting and disclosing digitally signed credential. Previous negotiation strategies are either not complete. In this paper, we propose a new trust negotiation model based on expected factor, which adopts the MCD strategy. With the analysis of each credential＇s expected factor, it can always find a successful negotiation which request and disclose credentials as fewer as possible whenever one exist. If a negotiation is found impossible to succeed, terminal it as soon as possible. It also makes sure that no irrelevant credentials will be disclosed and don＇t need to expose both sides＇ policies. We prove that the MCD strategy is complete.