Alibi Routing Dave Levin, Youndo Lee, Luke Valenta, Zhihao Li, Victoria Lai, Cristian Lumezanu, Brendan Rowen, Neil Spring, Bobby Bhattacharjee Presented.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Chris Karlof and David Wagner
ECE /24/2005 A Survey on Position-Based Routing in Mobile Ad-Hoc Networks Alok Sabherwal.
Mitigating Routing Misbehavior in Mobile Ad-Hoc Networks Reference: Mitigating Routing Misbehavior in Mobile Ad Hoc Networks, Sergio Marti, T.J. Giuli,
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
Data and Computer Communications
LASTor: A Low-Latency AS-Aware Tor Client
Impact Analysis of Cheating in Application Level Multicast s 1090176 Masayuki Higuchi.
Fabián E. Bustamante, 2007 Meridian: A lightweight network location service without virtual coordinates B. Wong, A. Slivkins and E. Gün Sirer SIGCOM 2005.
EL9331 Meridian: A Lightweight Network Location Service without Virtual Coordinates Bernard Wong, Aleksandrs Slivkins, Emin Gun Sirer SIGCOMM’05 ( Slides.
Rumor Routing in Sensor Networks David Braginsky and Deborah Estrin Presented By Tu Tran 1.
Security and Privacy Issues in Wireless Communication By: Michael Glus, MSEE EEL
SUSTAIN: An Adaptive Fault Tolerance Service for Geographically Overlapping Wireless Cyber-Physical Systems Gholam Abbas Angouti Kolucheh, Qi Han
Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.
IPlane: An Information Plane for Distributed Services Offence by: Anup Goyal Sagar Vemuri.
Criticisms of I3 Jack Lange. General Issues ► Design ► Performance ► Practicality.
Criticisms of I3 Zhichun Li. General Issues Functionality Security Performance Practicality If not significant better than existing schemes, why bother?
An Effective Placement of Detection Systems for Distributed Attack Detection in Large Scale Networks Telecommunication and Security LAB. Dept. of Industrial.
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
© 2003 By Default! A Free sample background from Slide 1 SAVE: Source Address Validity Enforcement Protocol Authors: Li,
Mitigating routing misbehavior in ad hoc networks Mary Baker Departments of Computer Science and.
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
Secure routing for structured peer-to-peer overlay networks (by Castro et al.) Shariq Rizvi CS 294-4: Peer-to-Peer Systems.
Freenet A Distributed Anonymous Information Storage and Retrieval System I Clarke O Sandberg I Clarke O Sandberg B WileyT W Hong.
Di Wu 03/03/2011 Geographic Routing in Clustered Multi-layer Vehicular Ad Hoc Networks for Load Balancing Purposes.
Routing Protocol Pertemuan 21 Matakuliah: H0484/Jaringan Komputer Tahun: 2007.
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
On Self Adaptive Routing in Dynamic Environments -- A probabilistic routing scheme Haiyong Xie, Lili Qiu, Yang Richard Yang and Yin Yale, MR and.
 Structured peer to peer overlay networks are resilient – but not secure.  Even a small fraction of malicious nodes may result in failure of correct.
Hashing it Out in Public Common Failure Modes of DHT-based Anonymity Schemes Andrew Tran, Nicholas Hopper, Yongdae Kim Presenter: Josh Colvin, Fall 2011.
Secure Localization Algorithms for Wireless Sensor Networks proposed by A. Boukerche, H. Oliveira, E. Nakamura, and A. Loureiro (2008) Maria Berenice Carrasco.
J.H.Saltzer, D.P.Reed, C.C.Clark End-to-End Arguments in System Design Reading Group 19/11/03 Torsten Ackemann.
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
MOBILE AD-HOC NETWORK(MANET) SECURITY VAMSI KRISHNA KANURI NAGA SWETHA DASARI RESHMA ARAVAPALLI.
1 / 18 Fariba alamshahi Secure Routing and Intrusion Detection in Ad Hoc Networks Supervisor: Mr.zaker Translator: fariba alamshahi.
9/15/2015CS622 - MIRO Presentation1 Wen Xu and Jennifer Rexford Department of Computer Science Princeton University Chuck Short CS622 Dr. C. Edward Chow.
Thesis Proposal Data Consistency in DHTs. Background Peer-to-peer systems have become increasingly popular Lots of P2P applications around us –File sharing,
HERO: Online Real-time Vehicle Tracking in Shanghai Xuejia Lu 11/17/2008.
An efficient secure distributed anonymous routing protocol for mobile and wireless ad hoc networks Authors: A. Boukerche, K. El-Khatib, L. Xu, L. Korba.
Denial of Service (DoS) Attacks in Green Mobile Ad–hoc Networks Ashok M.Kanthe*, Dina Simunic**and Marijan Djurek*** MIPRO 2012, May 21-25,2012, Opatija,
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
Security Patterns in Wireless Sensor Networks By Y. Serge Joseph October 8 th, 2009 Part I.
1 Distributed Hash Tables (DHTs) Lars Jørgen Lillehovde Jo Grimstad Bang Distributed Hash Tables (DHTs)
A Routing Underlay for Overlay Networks Akihiro Nakao Larry Peterson Andy Bavier SIGCOMM’03 Reviewer: Jing lu.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Distributed Authentication in Wireless Mesh Networks Through Kerberos Tickets draft-moustafa-krb-wg-mesh-nw-00.txt Hassnaa Moustafa
CSCI 465 D ata Communications and Networks Lecture 15 Martin van Bommel CSCI 465 Data Communications & Networks 1.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Peer Pressure: Distributed Recovery in Gnutella Pedram Keyani Brian Larson Muthukumar Senthil Computer Science Department Stanford University.
Data Communications and Networking Chapter 11 Routing in Switched Networks References: Book Chapters 12.1, 12.3 Data and Computer Communications, 8th edition.
Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols ► Acts as denial of service by disrupting the flow of data between a source and.
PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
Secure and Energy-Efficient Disjoint Multi-Path Routing for WSNs Presented by Zhongming Zheng.
The new protocol of freenet Taken from Ian Clarke and Oskar Sandberg (The Freenet Project)
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
Eclipse Attacks on Overlay Networks: Threats and Defenses By Atul Singh, et. al Presented by Samuel Petreski March 31, 2009.
SGPS A Hybrid of Topology and Location Based Protocol for Ad hoc Networks Jingyi Yu Computer Graphics Group.
LASTor: A Low-Latency AS-Aware Tor Client. Tor  Stands for The Onion Router  Goals: Anonymity ○ Each hop only knows previous and next hop on a path.
An Enhanced Cross-Layer Protocol for Energy Efficiency in Wireless Sensor Networks Jaehyun Kim, Dept. of Electrical & Electronic Eng., Yonsei University;
Networks, Part 2 March 7, Networks End to End Layer  Build upon unreliable Network Layer  As needed, compensate for latency, ordering, data.
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.
Routing Semester 2, Chapter 11. Routing Routing Basics Distance Vector Routing Link-State Routing Comparisons of Routing Protocols.
Lecture 18 Page 1 CS 236 Online Advanced Research Issues In Security: Securing Key Internet Technologies CS 236 On-Line MS Program Networks and Systems.
A Secure Routing Protocol with Intrusion Detection for Clustering Wireless Sensor Networks International Forum on Information Technology and Applications.
GPSR Greedy Perimeter Stateless Routing
Location Cloaking for Location Safety Protection of Ad Hoc Networks
CS590B/690B Detecting network interference (Spring 2018)
Presentation transcript:

Alibi Routing Dave Levin, Youndo Lee, Luke Valenta, Zhihao Li, Victoria Lai, Cristian Lumezanu, Brendan Rowen, Neil Spring, Bobby Bhattacharjee Presented by Kirill Varshavskiy

Sniff sniff  State agencies censor and log citizens’ internet traffic  Abundant in certain regions  China  Syria  North Korea  Saudi Arabia  Bahrain  Iran  Vietnam

Censor-avoidance  Censorship and Surveillance  Dropping packets  Injecting data into packets  Logging packets  Routing protocols often don’t consider intermediate nodes  Traffic can route through geographic region which might inject data into packet  Data integrity  Nations may log routing info + drop packets

Past Approaches  BGP Poisoning (avoidance)  Failure prone regions blacklisted in BGP  Tor (other overlay systems)  Anonymized internet usage  May pass through censored region when going between hops  Geographical routing  Greedy routing, no avoidance  Some systems provide means to monitor regions visited, but no insurance/proof that certain places were not visited

What Alibi routing is and what it isn’t  Provides  Overlay P2P network for data routing  Proof that sent packet did not enter forbidden region after packet has completed its RTT  Proof per packet as routing can traverse various paths due to packet switching/routing decisions  Does not Provide  Guarantee that data is not delivered to forbidden region  Malicious nodes not in forbidden region might copy and send it elsewhere  Assurance of reliable communication, just a proof that it didn’t enter the region AFTER transmission

Terminology and definitions  Forbidden Region  Geographical location that should not be entered  Represented by a list of coordinates depicting a geo-polygon  Alibi  Relay that can be safely used to divert traffic around forbidden region  Picked such that passing through Alibi AND forbidden region will cause noticeable delay increase  Target regions  Regions in which Alibis might reside  Aid in locating Alibi  δ (delta)  Coefficient to ensure safety under latency fluctuations  Used to determine target regions

Proof of avoidance  Proving something did not happen is difficult  Proving something related cannot possibly happen is less difficult  How do you prove packet did not go through forbidden region?  Consider event x depicting a situation in which a packet traverses through a forbidden region  Consider event A depicting a situation where a packet does not traverse through a forbidden region  A and x are mutually exclusive  Showing x is impossible, authors show A is true

Assumptions  All non-forbidden nodes are trustworthy  Nodes cannot lie about smaller RTTs  Based on various signing schemes, returned packet will show all (trustworthy) nodes it traversed

Relay Guarantees s T f f r d F  Given path s -> r -> d with an RTT rtt_time  Calculate RTT through s, r, and d AND the closest possible f to be rtt_forbidden  If rtt_time is a factor of delta smaller than rtt_forbidden, initial path could not have possibly traversed f

Targeting the target region s T f f g d F  Alibi Routing consists of an overlay network of P2P nodes, each with coarse GPS coords  Target region contains Alibi node  Authors partition world into grid of points  For each point, consider it as g, calculate δ threshold  All calculations based on greater-circle distance

Target region based on δ

Alibi, where art thou? s T f f d F  Each node keeps an active peer list and a neighbor list  Occasionally sends out random nonces to get neighbors’ GPS coords  Ping responses come with correct RTT as nonce is random and thus response cannot be pre- constructed  Each hop from source tries to minimize distance to target region

Security Concerns  Time/distance calculations prevent underselling of RTT from malicious nodes  Eclipse attack: surround node with all malicious nodes  Requires attack nodes to be physically close to trustworthy nodes  Algorithm should route hops away from forbidden regions  Sending data copies to attackers  End to end encryption can solve this, otherwise, nothing would effectively prevent this  Laundering traffic: using relays to attack hosts  Similar approach as to other systems, whitelisting, solutions exist

Evaluation  Authors simulated deployment of 20,000 nodes and PlanetLab simulation of 245 hosts  “Enemies of the Internet” labeled as forbidden regions + countries with most Internet users (USA, India, Japan)  Most source-destination pairs successful

Evaluation  Protocol success using simulation and PlanetLab deployment showed almost 100% success in most δ value cases  Due to limited PlanetLab deployment, at most 2 hops were needed to find relay. Around 40 in simulation.

Conclusion and Comments  Alibi routing can be used as an intelligent P2P network that bypasses unwanted territories in an efficient manner  Current implementation has to be manually configured. Would be interesting to see how system works in a practical deployment with backoff techniques  Does not tackle various downsides of the algorithm, for example being surrounded by forbidden region or having several forbidden regions, or failure cases where alibis incur too much of a latency to be effective  Authors mention Alibi routing can be used in tandem with Tor, which should be very beneficial to both technologies  P2P design requires lots of nodes to be online/active

References     content/uploads/2014/11/firewall.lgo_.jpg content/uploads/2014/11/firewall.lgo_.jpg  freiburg.de/people/ruehrup/georouting.png freiburg.de/people/ruehrup/georouting.png

Discussion  Would you use Alibi routing for your Internet use? (show of hands)  What other cases has Alibi routing not considered?  How does this system handle Internet hubs? If hub for lots of the world’s internet traffic is relayed through a forbidden region, how will the system adapt?  Should this P2P network consider congestion of relay nodes as potential bottleneck?

Questions?