Abstract—In this paper, we propose a scheme for a resilient distributed consensus problem through a set of trusted nodes within the network. Currently, algorithms that solve resilient consensus problem de-mand networks to have high connectivity to overrule the effects of adversaries, or require

Today, it is common for users to own more than tens of gigabytes of digital pictures, videos, experimental traces, etc. Although many users already back up such data on a cheap second disk, it is desirable to also seek off-site redundancies

works on the basis of authentication group signature, and onion routing protocol. In this paper proposal routing protocol method is Authenticated Anonymous Secure Routing with Trust based model. AASR protocol concept is to defend the neighbor nodes attack by the way of key-encryption and decryption

Abstract—In this paper, we propose a simple randomized protocol for identifying trusted nodes based on personalized trust in large scale distributed networks. The problem of identifying trusted nodes, based on personalized trust, in a large network setting stems from the huge computation

Abstract An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing

An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance

without pre-existing trust relationships wish to pool their resources. This paper studies attacks aimed at preventing correct message delivery in structured peer-to-peer overlays and presents defenses to these attacks. We describe and eval-uate techniques that allow nodes to join the overlay, to maintain

We propose a new definition for quasi-trusted relays. Our quasi-trusted relays are defined as follows: (1) being honest enough to correctly follow a given multi-party finitetime communication protocol; (2) however, being under the monitoring of eavesdroppers. From the new definition, we first

previously unknown nodes on the assumption that no global security infrastructure available. However, the assumption is improper for a network domain where involved nodes can establish trust with each other. In this paper, for such a network domain, we propose a ticket based BU authentication method. Our

, participate in the routing of client requests, and contribute storage to the system. Nodes are not trusted, they may join the system at any time and may silently leave the system without warning. Yet, the system is able to provide strong assurances, efficient storage access, load balancing and scalability.