Abstract

A peer-to-peer network within which interconnected nodes (“peers”) shares resources amongst one another without the utilization of centralized administrative systems. In communication network, the foremost common problems are privacy and security. During this network, anonymity is additionally crucial issue. The foremost anonymity for peer-to-peer users involved with the users' identities and actions which may be discovered by the other members. An intruder will get info regarding the content of the information, the sender's and receiver's identities. There are several approaches proposed to produce anonymous peer-topeer communications. This paper provides anonymous communication with additional privacy and security. Anonymous approaches are designed with the subsequent 3 goals: to safeguard the identity of provider, to safeguard the identity of requester and to safeguard the contents of transferred information between them. This paper presents a new peer-to-peer approach to realize anonymity between a requester and a provider in peer-to-peer networks with trustworthy servers known as supper node in order that the provider won't be able to determine the requester and no alternative peers will determine the two act parties with certainty. This paper shows that the proposed algorithmic rule improved reliableness and has a lot of security. This algorithmic rule, based on onion routing and organization, protects transferring information against traffic analysis attack. The ultimate goal of this anonymous communications algorithmic rule is to permit a requester to speak with a provider in such a way that no-one will confirm the requester’s identity and therefore the content of transferred information.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.