HKUST Institutional Repository >
Computer Science and Engineering >
CSE Journal/Magazine Articles >
Please use this identifier to cite or link to this item:
|Title: ||Pseudo trust : zero-knowledge authentication in anonymous P2Ps|
|Authors: ||Lu, Li|
Ni, Lionel M.
|Issue Date: ||Oct-2008 |
|Citation: ||IEEE Transactions on Parallel and Distributed Systems, v. 19, no. 10, 2008, p. 1325-1337. (pre-published version)|
|Abstract: ||Most trust models in Peer-to-Peer (P2P) systems are identity based, which means that in order for one peer to trust another, it needs to know the other peer’s identity. Hence, there exists an inherent trade-off between trust and anonymity. To the best of our knowledge, there is currently no P2P protocol that provides complete mutual anonymity as well as authentication and trust management. We propose a zero-knowledge authentication scheme called Pseudo Trust (PT), where each peer, instead of using its real identity, generates an unforgeable and verifiable pseudonym using a one-way hash function. A novel authentication scheme based on Zero-Knowledge Proof is designed so that peers can be authenticated without leaking any sensitive information. With the help of PT, most existing identity-based trust management schemes become applicable in mutual anonymous P2P systems. We analyze the security and the anonymity in PT and evaluate its performance using trace-driven simulations and a prototype PT-enabled P2P network. The strengths of our design include the following: 1) no need for a centralized trusted party or Certificate Authority (CA); 2) high scalability and security; 3) low traffic and cryptography processing overheads; and 4) man-in-the-middle-attacks resistance.|
|Rights: ||© 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.|
|Appears in Collections:||CSE Journal/Magazine Articles|
Files in This Item:
Find published version via
All items in this Repository are protected by copyright, with all rights reserved.