模糊自主信任建立策略的研究

张仕斌; 何大可; 遠藤誉

模糊自主信任建立策略的研究

张仕斌^{①②;何大可},
何大可,
遠藤誉

计量
- 文章访问数: 2304
- HTML全文浏览量: 62
- PDF下载量: 563
- 被引次数: 0
出版历程
- 收稿日期: 2005-08-29
- 修回日期: 2006-02-01
- 刊出日期: 2006-08-19

Research of Fuzzy Autonomous Trust Establishment Strategy

Zhang Shi-bin^{①②;何大可},
He Da-ke,
Homare Endo

摘要

摘要: 该文首先从分析开放式网络环境中有关信任的问题和主观信任的模糊性入手，以模糊理论为基础，引入隶属度来描述信任的模糊性，解决了模糊信任模型的建模问题；以图论为基础，将网络环境模型化为一个无向图，定义了基于本地信息交互的信任评价规则；提出了基于开放式网络环境的模糊自主信任模型，具体研究了自主信任建立策略及建立完全可信网络的实现机制及条件；最后通过仿真实验讨论了网络拓扑结构对自主信任建立的影响，并以小世界网络模型(-model)为基础分析讨论了自主信任建立的速度问题，这为网络管理的研究提供了一个有价值的新思路。
- 自主信任建立;信任模型;信任向量;模糊集合理论;图论
Abstract: Firstly, this paper analyzes some questions of trust and the fuzziness of subjective trust, based on fuzzy set theory, the fuzziness of trust is described by membership function, and how to create the fuzzy trust model has been solved. Secondly, based on the graph theory, the network is modeled as an undirected graph , and the rule of trust evaluation is defined by the aid of local information interaction. Thirdly, the model of fuzzy autonomous trust establishment based on open network environment is proposed; trust establishment strategy, the mechanism and condition of establishing a fully trusted network are studied in this paper. Finally, the influence of network topology to autonomous trust establishment is discussed through simulation experiment, and the convergence rate of autonomous trust establishment based on the small-world model (-model) is analyzed in this paper, which enlightens a new way for network management.

HTML全文

参考文献(1)

Gambetta D. Can We Trust Trust [M] In D. Gambetta editor, Trust: Making and Breaking Cooperative Relations. Basil Blackwell: Oxford, 1990: 213-238.[2]Jsang A. Prospectives of modeling trust in information security [A]. In: Proceedings of the 2nd Australasian Conference on Information Security and Privacy [C]. Sydney, Australia, 1997: 219-231.[3]Jsang A. A logic for uncertain probabilities [J]. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2001, 9(3): 279-311.[4]Blaze M, Feigenbaum J, Keromytis A D. Keynote: Trust management for public-key infrastructures [A]. In: Christianson B, Crispo B, William S, et al.. eds. Cambridge 1998 Security Protocols International Workshop [C]. Cambridge, UK, April 15-17, 1998. Berlin: Springer-Verglag, 1999: 59-63.[5]Beth T, Borcherding M, Klein B. Valuation of trust in open networks [A]. In: Gollmann D. ed. Proceedings of the European Symposium on Research in Security (ESORICS) [C]. Brighton, United Kingdom, November 1994: 3-18.[6]Jsang A. Trust-Based decision making for electronic transactions [EB/OL]. In: Proceedings of the 4th Nordic Workshop on Secure Computer System(NORDSEC99) [C]. Stockholm, Sweden, Stockholm University Report 99-005, 1999.[7]Blaze M, Feigenbaum J, Lacy J. Decentralized trust management [A], In: Dale J, Dinolt G, eds. Proceedings of the Symposium on Security and Privacy [C]. Oakland: IEEE Computer Society Press, 1996: 164-173.[8][8] Pretty good privacy users guide [S]. Distributed with the PGP software. Version 8.0 .2003.[9][9] Housley R. Internet X.509 Public Key Infrastructure, Certificate and CRL Profiles[S]. RFC2459, 1999. [10] Sonja Buchegger, Jean-Yves Le Boudec. The effect of rumor spreading in reputation systems for mobile Ad-hoc networks [A]. In Proceedings of Modeling and Optimization in Mobile, Ad hoc and Wireless Networks (WiOpt) [C], Sophia-Antipolis, France, March 2003: 66-75.[10]Sepandar D. Kamvar, Mario T. Schlosser, Hector Garcia-Molina. The eigentrust algorithm for reputation management in p2p networks [A]. In Proceedings of the Twelfth International World Wide Web Conference [C]. Budapest, Hungary, 2003: 640-651.[11]Sergio Marti, Hector Garcia-Molina. Limited reputation sharing in p2p systems [A]. In Proceedings of the 5th ACM Conference on Electronic Commerce [C]. New York, NY, USA, 2004: 91-101.Tutte W T. Graph Theory [M]. Cambridge University Press, 2004.09: 78-97.[12]L.A .扎德著, 陈国权译. 模糊集合、语言变量及模糊逻辑 [M]. 北京: 科学出版社, 1982: 56-75.[13]谢季坚, 刘承平. 模糊数学方法及其应用[M]. 华中科技大学出版社, 2000: 16-20.[14]Chan Haowen, Perrig A, Song Dawn. Random key predistribution schemes for sensor networks [A]. In Proceedings of the 2003 IEEE Symposium on Security and Privacy [C]. IEEE Computer Society. 2003: 175-183.[15]Bremaud P, Chains M. Gibbs fields, Monte Carlo simulation, and queues [M]. Texts in Applied Mathematics; 31. Springer-Verlag New York, Inc., 1999: 234-266.[16]Watts D J, Strogatz S H. Collective dynamics of small-world networks [J].Nature.1998, 393:440-442[17]Watts D J. Small Worlds: the Dynamics of Networks Between Order and Randomness [M]. Princeton University Press, 2004: 124-147.

施引文献

资源附件(0)

访问统计