首页> 外文会议>2010 IEEE International Conference on Fuzzy Systems >Possibilistic reasoning for trust-based access control enforcement in social networks
【24h】

Possibilistic reasoning for trust-based access control enforcement in social networks

机译:社交网络中基于信任的访问控制实施的可能性推理

获取原文

摘要

Web 2.0 services allow large amount of users to interact and share resources with each others in a very easy and timely way. However, as such services are very recent, there is still a need for developing new tools that considers their own characteristics and particularities. This is the case of the resource access control methods. In this paper we present the Max-Min method, a new trust-based algorithm for computing user reputation in social/peer-to-peer networks in an easy, fast and comprehensible manner. For these reasons, it can be used for resource access control enforcement. The novelty of Max-Min is that it is specifically designed for Web 2.0 applications. Therefore, it considers all the particularities of such scenarios. Additionally, we include in this work a set of experiments showing the viability of Max-Min model using a real trust dataset downloaded from Epinions, a Web 2.0 website.
机译:Web 2.0服务允许大量用户以非常简单及时的方式与彼此交互和共享资源。但是,由于此类服务是最近的,仍然需要开发思考自己特征和特征的新工具。这是资源访问控制方法的情况。本文介绍了最大MIN方法,以简单,快速,易于理解的方式计算社交/点对点网络中的用户声名的最大敏感方法。由于这些原因,它可以用于资源访问控制实施。 MAX-MIN的新颖性是它专为Web 2.0应用而设计。因此,它考虑了这种情况的所有特殊性。此外,我们在这项工作中包括一组实验,显示了Max-min模型的生存能力,使用从e exinions,Web 2.0网站下载的真实信任数据集。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号