1 / 21

Anonymity in MANETs Threats and Mitigations

Anonymity in MANETs Threats and Mitigations. Roy Friedman, Neer Roggel Technion, Israel Institute of Technology Computer Science Department {roy,nroggel}@cs.technion.ac.il. Outline. What are MANETs? Anonymity scenarios Attackers and threats Our approach: IP hopping

grant-mcfarland
Download Presentation

Anonymity in MANETs Threats and Mitigations

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. Anonymity in MANETs Threats and Mitigations Roy Friedman, Neer RoggelTechnion, Israel Institute of TechnologyComputer Science Department{roy,nroggel}@cs.technion.ac.il

  2. Outline • What are MANETs? • Anonymity scenarios • Attackers and threats • Our approach: IP hopping • Limitations and future work • Open discussion

  3. What is a MANET?

  4. What are MANETs?

  5. What are MANETs?

  6. Anonymity Scenarios • Battlefield • Units in motion • Sensor network • Content sharing • Oppressive regime • Rights protected content

  7. Attacker Capabilities • Eavesdropping • Geolocating a node • Device fingerprinting • Generating traffic • Man in the middle • Node compromise • Worm holes

  8. Threats to Anonymity • Irrefutably implicating a node • Distorting route construction • “Chattering laptops” • Attacks on timing • Traffic analysis

  9. Traffic Analysis

  10. IP1 IP8 IP2 IP7 IP3 IP4 IP6 IP5 Traffic Analysis Example K A P B L O D A B M D E E L K O P

  11. Our Approach

  12. Simple Example IP1 IP8 IP2 K L A IP7 IP3 D M B IP4 IP6 P E O IP5

  13. IP Hopping • Step 1: agree on shared information A B M D E E D M B A

  14. IP Hopping • Step 2: derive temporary addresses

  15. IP Hopping • Step 3: use temporary addresses [Ai,B,M,D,Ei] [Ai,B,M,D,Ei] A [Ai,B,M,D,Ei] B [Ai,B,M,D,Ei] M D E

  16. Traffic Analysis Revisited K IP1 IP8 IP2 L IP7 IP3 A B M D E IP4 IP6 IP5 O P

  17. Limitations • Routing efficiency • Discovery, maintenance • In-band agreement • Network services • Authentication, service discovery, address binding, address assignment

  18. Future Research Directions • More IP information leaks • Better routing mechanisms • TCP stream information leaks

  19. Discussion • How can we tell the network to help us find someone we are looking for without telling the network who it is we are looking for? • Once the route is known, how do we ensure that all nodes along the way are capable of receiving the packet and forwarding it?

More Related