构造P2P环境下混合式信任模型

针对P2P网络中存在的安全性和可管理性较差、现有信任模型中信任度计算复杂等问题,提出了一种P2P环境下混合式信任模型。该模型采用混合式P2P网络结构,利用时间段机制计算节点信任度,有效地预防节点间的“夸大”、“诋毁”等行为;提出了模型的构建方法以及交互评价反馈方式。仿真结果表明该模型运算量小,并能够有效地孤立和识别恶意节点,具有较强的安全性能。     

移动P2P分布式信任模型设计

移动P2P网络的开放性和松耦合特性使得节点恶意攻击行为普遍存在,而现有基于声誉的信任模型大都基于“信誉值高的节点评价推荐越可信”的假设,无法识别恶意节点动态策略性攻击行为。针对这一问题,将社会网络相关理论引入信任系统,提出一种基于社会距离的信任模型（SD2Trust）。该模型区分了服务可信度和推荐评价可信度,用多维结构同型性描述向量刻画节点网络地位和行为特征,根据社会距离确定推荐节点集和推荐信誉计算权重,综合信任考虑了诋毁风险。理论分析和实验结果表明,该模型能有效对抗恶意节点动态策略攻击行为。     

METrust: A mutual evaluation-based trust model for P2P networks

It is necessary to construct an effective trust model to build trust relationship between peers in peer-to-peer (P2P) network and enhance the security and reliability of P2P systems. The current trust models only focus on the consumers evaluation to a transaction, which may be abused by malicious peers to exaggerate or slander the provider deliberately. In this paper, we propose a novel trust model based on mutual evaluation, called METrust, to suppress the peers malicious behavior, such as dishonest evaluation and strategic attack. METrust considers the factors including mutual evaluation, similarity risk, time window, incentive, and punishment mechanism. The trust value is composed of the direct trust value and the recommendation trust value. In order to inhibit dishonest evaluation, both participants should give evaluation information based on peers own experiences about the transaction while computing the direct trust value. In view of this, the mutual evaluation consistency factor and its time decay function are proposed. Besides, to reduce the risk of computing the recommendation trust based on the recommendations of friend peers, the similarity risk is introduced to measure the uncertainty of the similarity computing, while similarity is used to measure credibility. The experimental results show that METrust is effective, and it has advantages in the inhibition of the various malicious behaviors.     

A distributed trust management model for mobile P2P networks

In this paper we propose a distributed Trust Management Model (DTMM) for constructing much shorter and more robust trust chains in mobile p2p networks. With DTMM, each moving object within the same group tends to have a high probability of keeping stable distances from each other. The main contribution of this model is to predict the future availability of wireless links and lead to fast generating valid trust evidences. A major difference between DTMM and many existing models in trust literature is that DTMM does not rely on any fixed networking infrastructure, and therefore is able to adapt to both high mobility environments. Our work appears to be the first attempt to research the relationship between mobile patterns and trust management of peers in mobile P2P network. The simulation results show that our model is highly robust and scalable in the dynamic environment of mobile networks.     

基于生态网络的P2P环境信任博弈进化模型

P2P网络中信任机制能够很好地检测和惩罚恶意节点,激励节点之间合作。提出了一种基于生态网络协同进化机理的信任博弈模型,应用复制动态机制分析了节点之间信任关系的长期演化趋势,从理论与实践上说明了在P2P网络中应用此信任模型具有良好的演化稳定性及性能的整体最优性。     

A D-S evidence theory based fuzzy trust model in file-sharing P2P networks

In this paper we propose an advanced Dempster-Shafer (D-S) Evidence Theory based Fuzzy Trust model (ETFT) for Peer-to-Peer (P2P) networks. The primary goal of ETFT is to be able to address trust information uncertainty and fuzzy trust inference to deal with inconsistent or conflicting recommendation problems in a reputation based P2P environment. The D-S theory is therefore introduced to our trust model. To make the D-S theory fit into P2P systems, we creatively revise the combination rules and achieve greatly improved results. To further improve the accuracy and performance, ETFT filters out noisy referrals before combining the evidences. From the theoretical analyses and experimental results, it is evident that the proposed ETFT has a clear advantage in modeling dynamic trust relationship and aggregating recommendation information. Results also demonstrate that ETFT is more robust and can generate higher successful transaction rate than most existing frameworks.     

基于无限重复博弈的P2P网络信任模型研究

为解决P2P电子商务环境中存在的安全问题,针对现有一些信任模型的局限性,提出一种基于无限重复博弈理论的信任模型。通过建立奖惩策略,对节点的不合作行为,依据博弈策略对节点进行惩罚,同时对选择合作策略的节点进行奖励,并根据欺诈行为次数设定不同的惩罚周期。理论分析和仿真实验表明,合作策略会成为节点博弈的帕累托最优策略,该策略模型能有效遏制和惩罚恶意行为,提高节点诚实交易的积极性,从而有效提高网络环境的安全性和稳定性。     

一种基于组群的P2P网络信任模型*

由于P2P网络的开放、匿名等特点,使得P2P网络对节点缺乏约束机制,节点间缺乏信任。提出了一种应用于非结构化P2P网络的信任模型——BGTrust。该模型对组群内信任采用局部推荐信任和组群间信任采取全局信任的方法进行处理,充分结合了全局信任和局部信任的优点。仿真表明,该信任模型在对交互的信任度评价可信度和抑制恶意节点方面较已有模型有一定改进。     

混合底层拓扑网络中的P2P流媒体模型研究

网络不断演进会改变底层IPv4/IPv6的基础结构。主要讨论在这样的混合网络环境下部署和应用P2P流媒体的关键问题。提出了采用分层思想设计一个完整的P2P流媒体系统模型,该模型在考虑混合底层网络拓扑环境的情况下同时引入了P2P安全认证的机制,在有效提升流媒体分发效率的同时保证了安全性。仿真结果表明,该模型更能满足未来网络演进过程中混合拓扑环境下P2P应用的需要,并具有良好的安全性。     

A study on hybrid trust evaluation model for identifying malicious behavior in mobile P2P

P2P network has been widely used because of advantages such as efficient use of network bandwidth, saving of computing resources, and quick information exchange. In particular, the infra that manages each nodes centrally in P2P network does not exist and each node is a structure performing the sender and receiver roles. The service applying P2P technique in MANET is increased because this structure is very similar to the structure of MANET. However, the reliability may be lower by providing an erroneous service from malicious nodes because the supervision of management for nodes participating in P2P does not perform. In this paper, we propose hybrid trust evaluation technique based on Trust Zone structure to improve the reliability between nodes. TZM node is elected for trust evaluation of member nodes internal each TrustZone. The certificate of member nodes is issued in the elected TZM and the information is stored in TZMT. The data transmission of malicious nodes is blocked by limiting the data transmission of nodes that do not issued the certificate. The reputation-based trust management technique was applied to perform the fair file transmission of nodes and block the behavior of selfish nodes. The excellent performance of the proposed technique in this paper was confirmed through experiments.     

DrTrust: 一种非结构化P2P网络信任模型

P2P网络的动态性、匿名性和自治性带来许多安全问题,传统的结构化的P2P信任模型并不能很好的适应对等网络环境。提出了一种应用于非结构化P2P网络中的信任模型——DrTrust。该模型充分利用直接信任值和推荐信任值相结合方式的优点,实现了精确计算信任值,并采用分布式存储方式和激励、惩罚机制分别存储和更新信任值。仿真结果表明,DrTrust在准确计算节点信任值和抑制恶意节点行为等问题上较已有的信任模型有一定的改进。     

Chord-PKI: A distributed trust infrastructure based on P2P networks

Many P2P applications require security services such as privacy, anonymity, authentication, and non-repudiation. Such services could be provided through a hierarchical Public Key Infrastructure. However, P2P networks are usually Internet-scale distributed systems comprised of nodes with an undetermined trust level, thus making hierarchical solutions unrealistic. In this paper, we propose Chord-PKI, a distributed PKI architecture which is build upon the Chord overlay network, in order to provide security services for P2P applications. Our solution distributes the functionality of a PKI across the peers by using threshold cryptography and proactive updating. We analyze the security of the proposed infrastructure and through simulations we evaluate its performance for various scenarios of untrusted node distributions.     

P2P环境下改进的基于信誉的信任模型

现有的基于信誉的信任模型对于节点在进行信誉反馈时的行为突然改变不能做出迅速反应,针对该问题,在保留TBRM(mast-bascd reputatlion model)优势的基础上,提出了一种改进的基于信誉的信任模型.该模型引入了惩罚因子加大对节点在进行信誉反馈时的动态摇摆行为的惩罚力度,并且细化了模型的分布式存储策略.仿真实验结果表明,在P2P文件共享网络中,该模型能有效遏制恶意节点的动态摇摆行为,提高真实文件的下载成功率.     

P2P环境下的一种混合式信任模型

提出了一种P2P环境下的混合式动态信任模型来解决当前P2P网络的安全性差、难于管理等问题缺陷。该模型融合了本地信任、推荐信任和全局信任模型,通过有机的结合能充分发挥各自模型的优点。同时通过相应的反馈机制能够有效地判断节点信任度的变化和抵御诋毁、夸大等安全问题。仿真结果表明,该模型能有效地判断节点的信任度,同时具有良好的安全性。     

论P2P网络信任机制的影响因素

P2P网络具有开放性、匿名性和自治性等特点。信任的缺乏导致节点之间的交易存在风险,阻碍了P2P网络的进一步发展。针对P2P网络所建立的信任机制能确保节点间正常交易,但由于P2P网络的特点和网络的复杂性,使P2P信任机制的部署不易实施。为此,分析了P2P网络中信任机制面临的网络攻击,详细研究了相关的影响因素,发现信誉值的计算不仅应关注上传节点,还应该关注下载节点。从上传节点和下载节点两个角度给出了影响因素的分布。这些影响因素的研究有助于对P2P信任机制的进一步研究。     

一种基于信任机制的混合式P2P模型

以改善P2P网络的安全性能为目标,介绍了基于关键节点的混合式P2P结构和基于信誉的信任机制,提出了一种基于该信任机制的混合式P2P模型,描述了该模型的工作机制。利用该模型可以在两个对等实体之间建立高效、可靠的信任关系,有效防止恶意攻击,提高P2P网络的效率和安全。     

P2P网络中基于贝叶斯理论的信任模型研究

借助于社会人工学中信任的概念,把P2P网络中节点交互的历史信息作为样本信息,结合先验信息对节点的未来行为做出推断,并根据节点之间信任关系不同,区分了直接信任和推荐信任,并分别给出了两种信任关系基于贝叶斯理论的计算方法。最后与L.Mui等人的模型作了比较。     

P2P环境下基于Bayesian网络的多粒度信任模型

Peer-to-Peer网络中,为保证系统的整体可用性,节点间的信任评估模型必须被建立起来。现有的模型不能灵活的反映考虑不同影响因素情况下节点的信任值。同时,不能避免Free Riding现象。本文全面地描述了节点的行为,将激励机制引入信任模型中。同时考虑了影响节点信任值的不同因素,以及他们之间复杂的依赖关系,利用bayesian网络和领域层次结构相结合的方法有效合理的将各方面因素整合起来,形成能够反映节点在不同方面的本地信任值。     

P2P环境下基于声誉的信任管理模型

在分析以往面向节点与面向资源的信任管理模型的优点与不足的基础上,提出一个新的基于声誉的信任管理模型。该模型首先根据价值量对节点所拥有的资源进行分类,在此基础上进而综合考虑资源与节点的声誉问题。模型通过节点以往交互行为的评价信息来对将要发生的行为进行预测与判断。此外,讨论了关于声誉值初始化的问题,使得模型更加具有实际意义。     

移动P2P网络中的多粒度信任模型

移动P2P网络的应用越来越广泛,随之而来的是大量欺诈等恶意行为,使系统的有效性和可用性难以保证。现有模型大多针对固定网络,忽略了终端类型对节点信任值的影响,而且不能很好地解决节点在不同领域、不同方面的可信度计算问题。针对上述问题,利用聚类思想和时间因子的概念,提出一种多粒度信任模型MGT（Multiple Granularity Trust Model）,并给出基于该模型的资源选择协议的工作流程。分析结果表明,模型能够有效地抵御恶意节点的破坏,增强P2P网络的安全性。