1 / 10

Bounding Virus Proliferation in P2P Networks with a Diverse-Parameter Trust Management Scheme

Bounding Virus Proliferation in P2P Networks with a Diverse-Parameter Trust Management Scheme. Authors: C. Lin and R. C. Roberto Source: IEEE Communications Letters, Vol. 13, No. 10, pp. 812-814, 2009 Speaker: Shu-Fen Chiou ( 邱淑芬 ). Introduction. download. Request file id 3. Introduction.

basil-sanford
Download Presentation

Bounding Virus Proliferation in P2P Networks with a Diverse-Parameter Trust Management Scheme

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. Bounding Virus Proliferation in P2P Networks with aDiverse-Parameter Trust Management Scheme Authors: C. Lin and R. C. Roberto Source: IEEE Communications Letters, Vol. 13, No. 10, pp. 812-814, 2009 Speaker: Shu-Fen Chiou (邱淑芬)

  2. Introduction download Request file id 3

  3. Introduction • Bounding the virus proliferation. • File reputation table • Reputation value of the file-- F(i, fl) • Peer trust table • Peer trust value (high)--Tv(i, j) • Infection value (low)--Iv(i, j)

  4. Proposed method • File request File reputation table If F(i, fl)>THR request file THR=0.6 F(F, 2)=0.8>0.6

  5. Proposed method Peer Trust table • File search File reputation table Peer Trust table If Tv(i, j)>THT  trustee peer, search file THT=0.5 Tv(F, A)=0.8>0.5, Tv(F, B)=0.8>0.5 Tv(F, C)=no value, ask E, Tv(E, C)=0.4 <0.5 Tv(F, D)=0.7>0.5 Tv(F, E)=0.5=0.5

  6. Proposed method • Post-download update- clean file File reputation table Peer Trust table 1.2 Tv(i, j)=αTv(i, j), α>1 α=1.5 Tv(F, B)=0.8*1.5=1.2

  7. Proposed method • Post-download update- infected file File reputation table 1.8 Peer Trust table 0.32 1.1 Tv(i, j)=δTv(i, j), 0<δ<1 Iv(i, j)=Iv(i, j)+l F(i, fl)=F(i, fl)+1 δ=0.4 Tv(F, B)=0.8*0.4=0.32 Iv(F, B)=0.1+1=1.1 F(F, 2)=0.8+1=1.8 Warning message: {ID, vj, fl, △, d} {001, B, 2, 0.5, 5 } IF Tv(i, j)<THWissue warning message THw=0.4, Tv(F, B)<0.4

  8. Proposed method • Post warning update Warning message: { {001, B, 2, 0.4, 5 } File reputation table 1.6 Peer Trust table 0.35 0.9 THT=0.5 Tv(A, F)=0.8>0.5 Tv(A, B)=0.7-(0.5*0.7)=0.35 Iv(A, B)=0.1+4/5=0.9 F(A, 2)=0.8+4/5=1.6 △=0.5*4/5=0.4 If Tv(i, k)>THT  Tv(i, j)=Tv(i, j)-△Tv(i,j ) Iv(i, j)=Iv(i, j)+(d-1)/d F(i, fl)=F(i, fl)+(d-1)/d △= △((d-1)/d) Warning message: {ID, vj, fl, △, d} {001, B, a.mp3, 0.5, 5 }

  9. Performance analysis • 100 nodes, 150 files Pd=probability of detect virus PI=probability of infected file FR=File Reputation

  10. Performance analysis

More Related