Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-15497-3_20 | ESORICS |
Keywords | Field | DocType |
process algebra,p2p overlay,peer-to-peer system,p2p architecture,specific security property,security mechanism,root authenticity,verifying security property,wide range,security issue,ra property,trusted computing,csp,formal verification,p2p | Architecture,Trusted Computing,Peer-to-peer,Computer security,Computer science,Overlay,Process calculus,Computer security model,Distributed computing,Formal verification | Conference |
Volume | ISSN | ISBN |
6345 | 0302-9743 | 3-642-15496-4 |
Citations | PageRank | References |
2 | 0.37 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tien Tuan Anh Dinh | 1 | 212 | 19.13 |
| Mark Ryan | 2 | 913 | 47.87 |