Reputation systems represent soft security mechanisms that complement traditional information security mechanisms. They are now widely used in online e-commerce markets and communities in order to stimulate good behav...Reputation systems represent soft security mechanisms that complement traditional information security mechanisms. They are now widely used in online e-commerce markets and communities in order to stimulate good behaviors as well as to restrain adverse behaviors. This paper analyzes the limitations of the conversational reputation models and proposes an incentive reputation model called the resilient reputation model （RRM） for the distributed reputation systems. The objective of this reputation model is not only to encourage the users to provide good services and, therefore, to maximize the probability of good transaction outcomes, but also to punish those adverse users who are trying to manipulate the application systems. The simulation results indicate that the proposed reputation model （RRM） could effectively resist against the common adverse behaviors, while protecting the profits of sincere users from being blemished by those adversaries.展开更多
In order to deal with the problems in P2P systems such as unreliability of the Service, security risk and attacks caused by malicious peers, a novel trust model MSL-TM based on the Multinomial Subjective Logic is prop...In order to deal with the problems in P2P systems such as unreliability of the Service, security risk and attacks caused by malicious peers, a novel trust model MSL-TM based on the Multinomial Subjective Logic is proposed. The model uses multinomial ratings and Dirichlet distribution to compute the expectation of the subjective opinion and accordingly draws the peer’s reputation value and risk value, and finally gets the trust value. The decay of time, rating credibility and the risk value are introduced to reflect the recent behaviors of the peers and make the system more sensitive to malicious acts. Finally, the effectiveness and feasibility of the model is illustrated by the simulation experiment designed with peersim.展开更多
The advancements in Mobile Ad-hoc Network(MANET)are suitable to wide applications,which involve military applications,civilian domains,and disaster recovery systems.It is assumed that the nodes present in the routing ...The advancements in Mobile Ad-hoc Network(MANET)are suitable to wide applications,which involve military applications,civilian domains,and disaster recovery systems.It is assumed that the nodes present in the routing protocols of MANETs are cooperative and trustworthy.This assumption makes MANET more prone to manipulation and interception,which generates several possibilities of different suspicious attacks,such as Denial of Service(DoS)attacks.Hence,security is considered as an important parameter as the network is fond of suspicious attacks.This paper addresses the security issues by proposing an optimization algorithm,named Jaya Cuckoo Search(JCS)algorithm,which is the combination of Jaya algorithm and Cuckoo Search(CS)algorithm for initiating secure route among the MANET nodes so that the path attained is feasible and secure.The proposed JCS algorithm uses a fitness function,which considers a multiobjective function using parameters,such as distance,link lifetime,delay,energy,trust,along with the reputation factor to select a secured path.The JCS algorithm shows maximum performance with energy,throughput,and PDR values as 27.826 J,0.554,and 0.628,respectively.展开更多
In unstructured peer-to-peer （P2P） systems such as Gnutella, a general routing search algorithm is used to blindly flood a query through network among peers. But unfortunately, malicious nodes could easily make use ...In unstructured peer-to-peer （P2P） systems such as Gnutella, a general routing search algorithm is used to blindly flood a query through network among peers. But unfortunately, malicious nodes could easily make use of the search approach launching distributed denial of service （DDoS） attack which aims at the whole network. In order to alleviate or minimize the bad effect due to behavior of malicious nodes using the flooding search mechanism, the paper proposes a Markov-based evaluation model which exerts the trust and reputation mechanism to computing the level of trustworthy of nodes having the information requested by evaluation of the nodes＇ history behavior. Moreover, it can differentiate malicious nodes as early as possible for isolating and controlling the ones＇ message transmitted. The simulation results of the algorithm proposed show that it could effectively isolate malicious nodes, and hold back the transmission of vicious messages so that it could enhance tolerance of DDoS based on flooding in Guutella-like P2P network.展开更多
基金the National Basic Research Program of China (973 Program) (Grant No. 2003CB314800)the National Natural Science Foundation of China (Grant No. 60203044)the 242 Program (Grant No. (242)2007A07)
文摘Reputation systems represent soft security mechanisms that complement traditional information security mechanisms. They are now widely used in online e-commerce markets and communities in order to stimulate good behaviors as well as to restrain adverse behaviors. This paper analyzes the limitations of the conversational reputation models and proposes an incentive reputation model called the resilient reputation model （RRM） for the distributed reputation systems. The objective of this reputation model is not only to encourage the users to provide good services and, therefore, to maximize the probability of good transaction outcomes, but also to punish those adverse users who are trying to manipulate the application systems. The simulation results indicate that the proposed reputation model （RRM） could effectively resist against the common adverse behaviors, while protecting the profits of sincere users from being blemished by those adversaries.
文摘In order to deal with the problems in P2P systems such as unreliability of the Service, security risk and attacks caused by malicious peers, a novel trust model MSL-TM based on the Multinomial Subjective Logic is proposed. The model uses multinomial ratings and Dirichlet distribution to compute the expectation of the subjective opinion and accordingly draws the peer’s reputation value and risk value, and finally gets the trust value. The decay of time, rating credibility and the risk value are introduced to reflect the recent behaviors of the peers and make the system more sensitive to malicious acts. Finally, the effectiveness and feasibility of the model is illustrated by the simulation experiment designed with peersim.
文摘The advancements in Mobile Ad-hoc Network(MANET)are suitable to wide applications,which involve military applications,civilian domains,and disaster recovery systems.It is assumed that the nodes present in the routing protocols of MANETs are cooperative and trustworthy.This assumption makes MANET more prone to manipulation and interception,which generates several possibilities of different suspicious attacks,such as Denial of Service(DoS)attacks.Hence,security is considered as an important parameter as the network is fond of suspicious attacks.This paper addresses the security issues by proposing an optimization algorithm,named Jaya Cuckoo Search(JCS)algorithm,which is the combination of Jaya algorithm and Cuckoo Search(CS)algorithm for initiating secure route among the MANET nodes so that the path attained is feasible and secure.The proposed JCS algorithm uses a fitness function,which considers a multiobjective function using parameters,such as distance,link lifetime,delay,energy,trust,along with the reputation factor to select a secured path.The JCS algorithm shows maximum performance with energy,throughput,and PDR values as 27.826 J,0.554,and 0.628,respectively.
基金Supported by the National Natural Science Foundation of China (No.6057312, 60473090)
文摘In unstructured peer-to-peer （P2P） systems such as Gnutella, a general routing search algorithm is used to blindly flood a query through network among peers. But unfortunately, malicious nodes could easily make use of the search approach launching distributed denial of service （DDoS） attack which aims at the whole network. In order to alleviate or minimize the bad effect due to behavior of malicious nodes using the flooding search mechanism, the paper proposes a Markov-based evaluation model which exerts the trust and reputation mechanism to computing the level of trustworthy of nodes having the information requested by evaluation of the nodes＇ history behavior. Moreover, it can differentiate malicious nodes as early as possible for isolating and controlling the ones＇ message transmitted. The simulation results of the algorithm proposed show that it could effectively isolate malicious nodes, and hold back the transmission of vicious messages so that it could enhance tolerance of DDoS based on flooding in Guutella-like P2P network.
