Verifying Security Property of Peer-to-Peer Systems Using CSP

Due to their nature, Peer-to-Peer (P2P) systems are subject to a wide range of security issues. In this paper, we focus on a specific security property, called the root authenticity (or RA) property of the so-called structured P2P overlays. We propose a P2P architecture that uses Trusted Computing as the security mechanism. We formalize that system using a process algebra (CSP), then verify that it indeed meets the RA property. Key words: Peer-to-Peer, Trusted Computing, formal verification, CSP

• Type: Conference
• Year: 2010
• Where: ESORICS
• Authors: Tien Tuan Anh Dinh, Mark Ryan
• Keywords: ESORICS 2010, Security Privacy, So-called Structured P2p, Specific Security Property, Trusted Computing