欢迎访问中国科学院大学学报,今天是

中国科学院大学学报 ›› 2012, Vol. 29 ›› Issue (1): 109-117.DOI: 10.7523/j.issn.2095-6134.2012.1.016

• 计算机科学 • 上一篇    下一篇

基于信任度与参数化约束的后向凭证链发现算法

陈博1, 席菁1, 叶勇1, 李明楚2   

  1. 1. 中国科学技术大学苏州研究院, 江苏 苏州 215123;
    2. 大连理工大学软件学院, 辽宁 大连 116621
  • 收稿日期:2010-10-19 修回日期:2011-03-03 发布日期:2012-01-15
  • 基金资助:

    国家自然科学基金(60673046)、高等学校博士学科点基金(200801410028)、国家自然科学重点基金(90715037)和国家重点基础研究发展(973)计划项目(2007CB714205)资助

Backword credential chain discovery algorithm based on trust worthiness and parameterized constraints

CHEN Bo1, XI Jing1, YE Yong1, LI Ming-Chu2   

  1. 1. Software School, University of Science and Technology of China, Suzhou 215123, Jiangsu, China;
    2. Software School, Dalian University of Technology, Dalian 116621, Liaoning, China
  • Received:2010-10-19 Revised:2011-03-03 Published:2012-01-15

摘要:

提出一种将信任度与参数化身份约束相结合的凭证链发现算法.模拟实验表明,该算法可以有效地对不良实体的请求进行屏蔽,实现了较灵活的细粒度授权;同时该算法提高了计算效率,减少了建立凭证链所耗费的空间.

关键词: 信任管理, 凭证链, 信任度, 参数化

Abstract:

We propose an algorithm which combines parameterized constraints and trust worthiness. Simulation results show that the algorithm can effectively shield the requests from the undesirable entities, achieving the fine grit authorization in a rather flexible way. Simultaneously, this algorithm enhances the computing efficiency and reduces the space for building the credential chains.

Key words: trust management, credential chain, trust worthiness, parametrization

中图分类号: