Algorithm Design And Model Analysis On Trust Management

With the advent of the Internet, distributed computing has become increasingly prevalent. A number of new models of distributed computing have emerged. Traditional authorization is not fit for these systems. The trust management approach to distributed system security was developed as an answer to the inadequacy of traditional authorization mechanisms. Trust management engines avoid the need to resolve"identity"in an authorization decision. The trust management approach includes proofs that requested transactions comply with local policies and system architectures that encourage developers and administrators to consider an application's security policy carefully and specify it explicitly. This dissertation focuses on the algorithm and model analysis of trust-management system. Following are the main results of this thesis:A new proof of compliance algorithm in PolicyMaker is proposed.The algorithm apply graphic theory's DFS notion and the dynamic character,in the face of withdrawing the delegation,we delete the delegation side,then newly search ,find other chain discovery until the end.It solve the negative credentials,compared with the time and space complicated degree of the original algorithm,prove the algorithm more simple and shortcut.Then some typical trust management is analysed in detail. Finally,the current works and future research direction is discussed.