PCSP: A Probable Concurrent Secure and Portable Peer-to-Peer Protocol

Unstructured peer-to-peer (P2P) networks for content distribution are decentralized and robust. Searching for content in the network is based on the Gnutella protocol which does not provide security. Communication between two or more peers is secure if it can provide authentication and ensures the confidentially and integrity of the data exchanged. Authentication enables the identity verification of the devices sending and receiving the data. Confidentiality and integrity of the data guarantee that only the users that are authorized can understand the data and that an adversary is unable to modify the data exchanged. The challenge is how to authenticate users and establish a decentralized protocol that exploits concurrency and can provide confidentiality and integrity in content distribution networks? We propose the design of a probable concurrent secure and portable (PCSP) local look-up search P2P protocol. PCSP is based on the Diffie-Hellman key agreement protocol (DH) to establish a shared session key that can provide confidentiality and integrity. Authentication is achieved by concurrent processed secretly encrypting the Internet address (IP) of the peer exchanging the key in a bloom filter, and hiding the existence of the bloom filter in a picture.