1 / 23

Persea : Making Networks More Secure Since Early 2013

Persea : Making Networks More Secure Since Early 2013. By: Rebecca Navarre & Michael Baker II. Biography. Rebecca Navarre Wesleyan College Applied Mathematical Sciences Michael Baker II Tarrant County College Mechanical Engineering. Background. Peer-to-Peer Networks

aletha
Download Presentation

Persea : Making Networks More Secure Since Early 2013

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. Persea:Making Networks More Secure Since Early 2013 By: Rebecca Navarre &Michael Baker II

  2. Biography Rebecca Navarre Wesleyan College Applied Mathematical Sciences Michael Baker II Tarrant County College Mechanical Engineering

  3. Background Peer-to-Peer Networks Distributed Hash Tables (DHTs) Kad

  4. Peer-to-Peer Networks Purpose: file & resource sharing network Nodes capable of acting like client and server Accessible to peers directly( for pure, no central/intermediary entity) Workload is partitioned between peers. There is no central point of failure. Examples: Napster(centralized), Freenet(Gnutella protocol), Gnutella2 and Kazaa (hybrid)

  5. Peer-to-Peer cont. • Hybrid vs. Pure • For Hybrid: • Allows for a central entity to provide network services or act as a security check. • For Pure • All nodes are equal. • When one node is removed, the network continues without suffering a loss.

  6. Distributed Hash Table Purpose: System of Efficient Resource Discovery Messages come into DHTs, retrieved by matching keys Based on <key, value> pairs. If change occurs, minimal disruption Allows for large scale data recovery

  7. Kad Purpose: offers consistent search/find protocol Figure 1

  8. Kad Continued • Nodes know about neighbors • K-buckets offer resistance to DOS attacks • Can’t flood out nodes with LIFO • Lookup • Source selectsα # of closest nodes from its k-bucket • Source sends look up request to each α node selected • Eachα node returns β # of nodes from searching k-buckets • Source then has α into β # of nodes in list • From this, source selects selects α # of closest nodes from its k-bucket • Process continues until it reaches target node

  9. Persea Security • Initial Security • Social Network & DHT • Invitation Only • Kad • Message entry New Node N N DHT Social Network N

  10. Hierarchical Node ID Distribution Security Chunk factor: .65 Bootstrap/Initiator Nodes 128 0 63 127 191 192 64 255 A B C D 207 15 206 193 221 d1 d2 1 14 28 a2 a1 6 7 11 2 Chunk Factor Calculation 64^(.65) = floor(14.929) = 14 p1 p2 4 3 q1

  11. Persea Look Up Effeciency Replication KAD PERSEA k=3, stored in k-closest nodes Node holding <key,value> pair

  12. What Persea Is Up Against? • Sybil Attack • Advanced Attack • Node Insertion • Node ID Hijacking

  13. The Roles of the Attackers Silent Active

  14. Topologies

  15. Silent vs. Active Sybil Attack Social Network Data Set used: soc-Epinions1

  16. Hop Count: Active Sybil Attack

  17. Active Sybil Attack(wiki-Vote) Social Network Data Set used: wiki-Vote

  18. Advanced & Sybil Attack

  19. Nodes per Attack Edge Social Network Data Set used: soc-Epinions1

  20. Active Sybil Attack (wiki-Vote) Social Network Data Set used: wiki-Vote

  21. Hop Count: Advanced & Sybil Attack Social Network Data Set used: soc-Epinions1

  22. Acknowledgements Dr. Matthew Wright Ph. D. Students: MahdiNasrullah Al-Ameen & Charles Gatz Dr. Yazdani University of Texas at Arlington National Science Foundation

  23. Questions? Thank you for your time.

More Related