检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机科学》2008年第2期52-57,共6页Computer Science
基 金:天津市应用基础研究计划(自然科学基金)项目(06YFJMJC00200);南开大学创新基金项目
摘 要:在普适计算环境下,各种资源、设备和用户均是高度动态变化的,服务请求者和服务提供者一般互相不了解,因此普适计算环境下各陌生实体间的相互认证是传统的基于身份的认证机制无法解决的。普适计算信任建模机制可以解决普适计算环境下的不确定性问题,为陌生实体间建立信任关系,因此成为普适计算中的一个研究热点。基于此,本文对于目前国外关于普适计算信任建模机制的研究现状做了一个总结,通过分析和比较,给出了普适计算信任建模的设计原则,探讨了普适计算信任建模问题的未来发展方向。In pervasive computing environment, various resources, devices and users are frequently changeable. Servlce providers and requesters commonly do not know each other. Therefore, it becomes an important foundation to identify unknown entities for pervasive computing security. However, explicit identity is the base for traditional authentication methods. Strange entities can't be authenticated by those conventional solutions. Fortunately, trust model can solve the uncertainty problem in pervasive computing environments and set up trust relationship between strange entities. Consequently, it becomes one of the hot spots in pervasive computing research presently and there is much related work on it. Based on the status quo, an overview is made in this paper, in which different solutions presented are analyzed and discussed. Subsequently, several design guidelines of trust modeling for pervasive computing are summarized, too. Finally, a summary and a prospect for further interesting research directions are proposeed.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.42