首页> 外文期刊>Journal of statistical computation and simulation >Cosine similarity-based clustering and dynamic reputation trust aware key generation scheme for trusted communication on social networking
【24h】

Cosine similarity-based clustering and dynamic reputation trust aware key generation scheme for trusted communication on social networking

机译:基于余弦相似度的聚类和动态信誉信任密钥生成方案,用于社交网络上的可信通信

获取原文
获取原文并翻译 | 示例

摘要

Social networking sites (SNSs) make it possible to connect people and they can communicate with others. Due to the lack of privacy mechanisms, the users in SNSs are vulnerable to some kinds of attacks. Security and privacy issues have become critically important with the fast expansion of SNSs. Most network applications such as pervasive computing, grid computing and P2P networks can be viewed as multi-agent systems which are open, anonymous and dynamic in nature. Moreover, most of the existing reputation trust models (RTMs) do not depend on any clustering structures. The clustering structures are used to effectively calculate the trustworthiness of the network nodes. In this paper, a novel cosine similarity-based clustering and dynamic reputation trust aware key generation (CSBC-DRT) scheme is proposed. For better faced clustering, a cosine similarity measure is estimated for all the nodes on the network. Based on the similarity measure among the nodes, the network nodes are clustered into disjoint groups. The RTM is built in this proposed scheme. Here, an improved MD5 algorithm is explored for key generation and key verification. After the key verification, the trusted measures such as reputation value, positive edge and negative edge values are computed to formulate the trusted network. The proposed scheme performs better than the existing RTM, which provides trusted communication in social networks.
机译:社交网站(SNS)使人们之间的联系成为可能,并且他们可以与他人交流。由于缺乏隐私机制,SNS中的用户容易受到某些攻击。随着SNS的快速扩展,安全和隐私问题已变得至关重要。诸如普适计算,网格计算和P2P网络之类的大多数网络应用程序都可以被视为本质上是开放,匿名和动态的多代理系统。而且,大多数现有的信誉信任模型(RTM)不依赖于任何群集结构。聚类结构用于有效地计算网络节点的可信度。本文提出了一种基于余弦相似度的聚类和动态信誉信任密钥生成(CSBC-DRT)方案。为了更好地面对集群,估计网络上所有节点的余弦相似度。基于节点之间的相似性度量,网络节点被聚集成不相交的组。 RTM是在此提议的方案中构建的。在这里,为密钥生成和密钥验证探索了一种改进的MD5算法。密钥验证后,计算可信度(例如信誉值,正边缘和负边缘值)以制定可信网络。所提出的方案比现有的RTM更好,后者在社交网络中提供可信的通信。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号