1 / 11

P2P Reputation Management Using Distributed Identities and Decentralized Recommendation Chains

P2P Reputation Management Using Distributed Identities and Decentralized Recommendation Chains. Authors: P. Dewan and P. Dasgupta Source: IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 7, pp. 1000-1013, 2010 Speaker: Shu-Fen Chiou ( 邱淑芬 ). Outline . Introduction

piper
Download Presentation

P2P Reputation Management Using Distributed Identities and Decentralized Recommendation Chains

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. P2P Reputation Management Using Distributed Identities and Decentralized Recommendation Chains Authors: P. Dewan and P. Dasgupta Source: IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 7, pp. 1000-1013, 2010 Speaker: Shu-Fen Chiou (邱淑芬)

  2. Outline • Introduction • Proposed method • Experimental results • Conclusions • Comments

  3. abc.mp3 REC: -0.5 abc.mp3 7 REC: 0.3 8 abc.mp3 REC: 0.65 REC: 0.6 6 4 5 3 2 1 Query abc.mp3 De-centralized P2P Architecture

  4. REC=0.3-> 0.8 8 False transaction 8’ 8’ 8’ 8’ 8’ Problem abc.mp3 REC: -0.5 abc.mp3 7 REC: 0.3 REC: 0.8 8 abc.mp3 REC: 0.6 liar farms 6 4 5 3 2 1 Query abc.mp3

  5. Contributions • A self-certification-based identity system protected by cryptographically blind identity mechanisms. • A light weight and simple reputation model. • An attack resistant cryptographic protocol for generation of authentic global reputation information of a peer.

  6. Proposed method CA Request certificate Get list and decide the provider with the highest reputation Search file or service P Verify, get file or service, and feedback reputation (Recommend)

  7. Proposed method • Certification request PK1, PK2 AK1, AK2 Peer (P) Authority (A) B1, IAlice B1={EBKa(IAliceτ)} B2=EAK2{EBKa(IAliceτ)} B2 EAK2{IAliceτ}={EBKa{B2}}

  8. Proposed method RK1, RK2 PK1, PK2 Requester (R) Provider (P) RTS, IDR IDP, TID, EPK2(H(TID||RTS)) Search for network: Search(PK1||TID) LTID=Max(Search(PK1||TID)) Check LTID<TID Past Recommendation Request, r CHAIN, EPK2(CHAIN) Verify CHAIN file or service B1 B1=EBKa(REC||TID||ERK2{H(REC||TID)}) B1||EPK2(H(B1),nonce), nonce verify Decrypt B1 Ka Stores: (IDR, {REC||TID||ERK2{H(REC||TID)}})

  9. Experimental Results

  10. Experimental Results

  11. Conclusions • Presents self-certification, an identity management mechanism, reputation model, and a cryptographic protocol. • The self-certification-based identity generation mechanism reduces the threat of liar farms.

More Related