Research article · Jan 2014
Research articlePublished Mar 2014
Secure Reputation Mechanism For Unstructured Peer To Peer System
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
Distributed hash tables (DHTs) share storage and routing responsibility among all nodes in a peer-to-peer network. These networks have bounded path length unlike unstructured networks. Unfortunately, nodes can deny access to keys or misroute lookups. We address both of these problems through replica placement. In its simplest form, a peer-topeer network is created when two or more PCs are connected and share resources without going through a separate server computer. In effect, every connected PC is at once a server and a client. Peer to peer networks can be categorized into structured and unstructured peer to peer networks. The proposed system can be used on top of both structured and unstructured peer to peer networks. In structured networks, the peer or system which start to search a file into other peers by establishing paths (i.e. the source system knows where the searching happen are). The unstructured peer to peer networks do not have a well-known architecture. In unstructured networks, there is no relationship between the source with other peers except neighbor peer and its location. Our proposed work is to search a file in a structured and unstructured peer to peer network. The absence of a central authority in a peer to peer network poses unique challenges for reputation management in the network. These challenges include identity management of the peers, secure reputation data management, Sybil attacks, and above all, availability of reputation data. Reputation management is each and every peer must store the searching and file identified information or details which help to reduce the searching time in both type of peer to peer network. Need security for unstructured network search because the searching peer doesn’t know where the file is searched and download. In this project, we added a cryptographic protocol for ensuring secure and timely availability of the reputation data of a peer to other peers at extremely low costs. Content auditing is done on receiver side even signature fails and mentions the ratio or impact of fake content. As result, a peer’s reputation motivates it to cooperate and desist from malicious activities. The cryptographic protocol is coupled with self-certification and cryptographic mechanisms for identity management and countering Sybil attack.
Ask about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
Similar by topic
Research article · May 2014
Load Balancing in Structured Peer to Peer Systems
Research article · Feb 2014
Ensuring Secure and Timely Availability of Reputation Data in Peer To Peer Networks
Research article · Aug 2011
REPUTATION SYSTEM IN PEER-TO-PEER NETWORK: DESIGN AND CLASSIFICATION
Research article · 2011
Secured Communication Protocol for Wireless Peer to Peer Messaging
More from this journal
The newest in International Journal of Innovative Research in Computer and Communication Engineering.
Commentary · 2023
Computer Vision and Pattern Recognition
Commentary · 2023
Computer Network and Network Optimization
Perspective · 2023
Cloud Computing and Big Data Analysis
Conferences in this field
Upcoming conferences in this field.
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalInternational Journal of Innovative Research in Computer and Communication Engineering
- SubjectComputer Science & IT
- SubjectEngineering
- SubjectSocial Sciences & Humanities
- BylineArticles whose byline prints “N. Vijaya Kumar.”
- BylineArticles whose byline prints “Prof. Senthilnathan”
