Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Admission control in Peer-to-Peer: design and performance evaluation
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
SOSIMPLE: A Serverless, Standards-based, P2P SIP Communication System
AAA-IDEA '05 Proceedings of the First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications
P2PNS: A Secure Distributed Name Service for P2PSIP
PERCOM '08 Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications
A survey of peer-to-peer security issues
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
A survey of DHT security techniques
ACM Computing Surveys (CSUR)
Security challenges for peer-to-peer SIP
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
In this paper, we modify and extend the P2PSIP's leading draft (RELOAD) in order to both adjust its operation better with respect to the properties of wireless ad hoc networks and improve the provided security level. In terms of security, a public/private key infrastructure scheme is used along with a symmetric cryptographic mechanism. Public key cryptography is used to encrypt the communication between the peers, while symmetric cryptography is used primarily for authentication purposes. The public/private key pair of each peer is periodically refreshed to further improve the security level of the system. Two schemes are proposed: the Hierarchical RELOAD (HR), where the Bootstrap peers are central to all the operations implemented within the protocol, and the Semi-Hierarchical RELOAD (SHR) that follows the same logic with HR but also permits, for a limited time window, a more distributed operation for the protocol. We evaluate the proposed protocols in comparison to RELOAD, and the results show that HR produces considerably lower communication overhead within the peer-to-peer network than both RELOAD and SHR, with the latter's however more flexible network operation justifying the additional cost.