Mobile Ad-hoc Network (MANET) is a quite challenging to ensures security because if it’s open nature, lack of infrastructure, and high mobility of nodes. MANETs is a fast changing network in a form of decentralized wireless system. It requires a unique, distinct and persistent identity per node in order to provide their security and also has become an indivisible part for communication for mobi...

The Kad network is a structured P2P network used for file sharing. Research has proved that Sybil and Eclipse attacks have been possible in it until recently. However, the past attacks are prohibited by newly implemented security measures in the client applications. We present a new attack concept which overcomes the countermeasures and prove its practicability. Furthermore, we analyze the effi...

MANETs are fast emerging as alternate network architecture to infrastructure networks. It is finding many applications and the constraints of processing power, memory, and bandwidth will be soon being overcome with the rapid improvement in the technologies. However the major concern which will remain is the security of the network. MANETs differ largely in the routing mechanism in the network l...

Distributed Hash Tables (DHTs) are very efficient distributed systems for routing, but at the same time vulnerable to disruptive nodes. Designers of such systems want them used in open networks, where an adversary can perform a sybil attack by introducing a large number of corrupt nodes in the network, considerably degrading its performance. We introduce a routing strategy that alleviates some ...

Reputation systems have become more and more important in facilitating transactions in online systems. However, the accuracy of reputation systems has always been a concern for the users due to the existence of unfair ratings. Though many approaches have been proposed to mitigate the adverse effect of unfair ratings, most of them use the credibility of the rating provider alone to decide whethe...

This paper presents a solution for the problem of merging privacy-friendly identifiers with trust information without support or assistance from central authorities during the operation phase. Trust information is dynamic and associated to the pseudonyms. Our solution is constructed using role-based pseudonyms that are associated to an arbitrary number of different contexts. Moreover, the prese...

Recent studies have discovered that the Internet delay space has many interesting properties such as triangle inequality violations (TIV), clustering structures, and constrained growth. Understanding these properties has so far benefited the design of network models and network-performance-aware systems. In this paper, we consider an interesting, previously unexplored connection between Interne...

Without trust, pervasive devices cannot collaborate effectively, and without collaboration, the pervasive computing vision cannot be made a reality. Distributed trust frameworks may support trust and thus foster collaboration in an hostile pervasive computing environment. Existing frameworks deal with foundational properties of computational trust. We here propose a distributed trust framework ...

Memory Bound Functions have been proposed for fighting spam, resisting Sybil attacks and other purposes. A particular implementation of such functions has been proposed in which the average effort required to generate a proof of effort is set by parameters E and l to E · l. The distribution of effort required to generate an individual proof about this average is fairly broad. When particular us...

P2P files sharing system is popular in network applications. The trust evaluation, designed for restricting the malicious peers in the system, is often based on reputation. When peers choose the trust nodes to download files in terms of the trust evaluation, they have established trust among themselves. Besides the trust, the utility (or interest) gained by peers is the other important factor d...