The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
There has been a spurt of works showing that the existence of sybil attacks is a serious threat to Peer-to-Peer networks, where one or more attackers can forge a large number of fictitious identities. In this paper, we present a distributed protocol to reduce the adverse effects of sybil attacks in free riding problem. Our approach focuses on restricting nodes to obtain the number of service units...
Present indirect contribution transaction protocols are vulnerable to sybil attacks where one or more attackers can forge a large number of fictitious nodes. In this paper, we propose a decentralized sybil-resilient contribution transaction protocol. It allows nodes to obtain service for use from remote nodes, while restricting the amount of service which sybil nodes receive from honest nodes even...
Reciprocity technique emerges as an effective way to control freeloading problem. However, direct reciprocity schemes are not suitable for P2P networks with high churn rate; indirect reciprocity schemes are susceptible to sybil attacks. This paper presents a novel indirect reciprocity P2P protocol for limiting the capacity of sybil attacks. Our protocol accounts contributions of nodes and allows nodes...
An common difficulty in structured P2P networks is caused by the dynamic membership of nodes (churn). This results in constant reorganization of overlay topology. The objective of this paper is to handle churn in P2P networks by a flexible cluster-based protocol. In our protocol, a cluster of nodes work together to achieve efficient greedy routing and the size of each cluster varies between an upper...
Peer-to-peer (P2P) systems can be classified into two categories: unstructured and structured. A crucial requirement for practical structured P2P systems is that they should be able to cope with system splitting and merging. To address this issue, we first present a randomized and fault-tolerance broadcast algorithm called RBA. It can inform all nodes in P2P system of splitting or merging. We analyze...
An important and fundamental issue in designing structured P2P systems is the tradeoff between the number of logical links and the number of hops. This paper presents K-Chord (KC), a flexible protocol based on Chord and the idea of proportional search. We conduct an in-depth study on KC. Let D denote any given number, in order to guarantee that each query can be resolved in 0(D) hops, it is necessary...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.