CONTROLLING P2P APPLICATIONS VIA ADDRESS HARVESTING: THE SKYPE STORY Anat Bremler-Barr Omer Dekel Ran Goldschmidt Hanoch Levy Interdisciplinary Center.

Slides:



Advertisements
Similar presentations
PPPoE Last Update Copyright Kenneth M. Chipps Ph.D. 1.
Advertisements

Understanding KaZaA Jian Liang Rakesh Kumar Keith Ross Polytechnic University Brooklyn, N.Y.
Modelling and Analysing of Security Protocol: Lecture 10 Anonymity: Systems.
NAT/Firewall Traversal April NAT revisited – “port-translating NAT”
Skype & Network Management Taken from class reference : An Analysis of the Skype Peer-to-Peer Internet Telephony Protocol Salman A. Baset and Henning Schulzrinne.
Voice over IP Skype.
Review of a research paper on Skype
5-Network Defenses Dr. John P. Abraham Professor UTPA.
Authored by: Rachit Rastogi Computer Science & Engineering Deptt., College of Technology, G.B.P.U.A. & T., Pantnagar.
Measurement, Modeling, and Analysis of a Peer-2-Peer File-Sharing Workload Presented For Cs294-4 Fall 2003 By Jon Hess.
Small-world Overlay P2P Network
CMPT 401 Summer 2007 Dr. Alexandra Fedorova Lecture XV: Real P2P Systems.
1 Internet Networking Spring 2004 Tutorial 13 LSNAT - Load Sharing NAT (RFC 2391)
What's inside a router? We have yet to consider the switching function of a router - the actual transfer of datagrams from a router's incoming links to.
Wide-scale Botnet Detection and Characterization Anestis Karasaridis, Brian Rexroad, David Hoeflin.
Peer-Assisted Content Distribution Networks: Techniques and Challenges Pei Cao Stanford University.
Spotlighting Decentralized P2P File Sharing Archie Kuo and Ethan Le Department of Computer Science San Jose State University.
More about Skype. Overview Any node with a public IP address having sufficient CPU, memory and network bandwidth is a candidate to become a super node.
The Case for Network-Layer, Peer-to-Peer Anonymization Michael J. Freedman Emil Sit, Josh Cates, Robert Morris MIT Lab for Computer Science IPTPS’02March.
Intrusion Detection using Honeypots Patrick Brannan Honeyd with virtual machines.
Passive traffic measurement Capturing actual Internet packets in order to measure: –Packet sizes –Traffic volumes –Application utilisation –Resource utilisation.
FIREWALL TECHNOLOGIES Tahani al jehani. Firewall benefits  A firewall functions as a choke point – all traffic in and out must pass through this single.
KaZaA: Behind the Scenes Shreeram Sahasrabudhe Lehigh University
P2P File Sharing Systems
1 The Good, The Bad and the Ugly: Network Performance in Malicious Environment Udi Ben-Porat ETH Zurich, Switzerland Anat Bremler-Barr IDC Herzliya, Israel.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Troubleshooting Your Network Networking for Home and Small Businesses.
ON THE STABILITY OF SKYPE SUPER NODES Anat Bremler-Barr Ran Goldschmidt Interdisciplinary Center Herzliya Haifa University
Dynamic Network Emulation Security Analysis for Application Layer Protocols.
9/11/2015Home Networking1 Bob.test Have Road Runner Unhappy about reports of constant probes of machines Policy decision –I want to prevent unauthorized.
1 NAT Network Address Translation Motivation for NAT To solve the insufficient problem of IP addresses IPv6 –All software and hardware need to be updated.
Skype P2P Kedar Kulkarni 04/02/09.
Chapter 2: Application layer
2: Application Layer1 Chapter 2: Application layer r 2.1 Principles of network applications r 2.2 Web and HTTP r 2.3 FTP r 2.4 Electronic Mail  SMTP,
Do incentives build robustness in BitTorrent? Michael Piatek, Tomas Isdal, Thomas Anderson, Arvind Krishnamurthy, Arun Venkataramani.
2012 4th International Conference on Cyber Conflict C. Czosseck, R. Ottis, K. Ziolkowski (Eds.) 2012 © NATO CCD COE Publications, Tallinn 朱祐呈.
2: Application Layer1 Chapter 2 outline r 2.1 Principles of app layer protocols r 2.2 Web and HTTP r 2.3 FTP r 2.4 Electronic Mail r 2.5 DNS r 2.6 Socket.
Firewalls Nathan Long Computer Science 481. What is a firewall? A firewall is a system or group of systems that enforces an access control policy between.
DNS based IP NetLocation Service China Telecom Guangzhou Institute
CCAN: Cache-based CAN Using the Small World Model Shanghai Jiaotong University Internet Computing R&D Center.
1 An Advanced Hybrid Peer-to-Peer Botnet Ping Wang, Sherri Sparks, Cliff C. Zou School of Electrical Engineering & Computer Science University of Central.
Appear in IEEE TDSC 2008 Presented by Wei-Cheng Xiao.
TOMA: A Viable Solution for Large- Scale Multicast Service Support Li Lao, Jun-Hong Cui, and Mario Gerla UCLA and University of Connecticut Networking.
2: Application Layer1 Chapter 2: Application layer r 2.1 Principles of network applications  app architectures  app requirements r 2.2 Web and HTTP r.
Mapping Internet Sensors with Probe Response Attacks Authors: John Bethencourt, Jason Franklin, Mary Vernon Published At: Usenix Security Symposium, 2005.
Peer Pressure: Distributed Recovery in Gnutella Pedram Keyani Brian Larson Muthukumar Senthil Computer Science Department Stanford University.
TASHKENT UNIVERSITY OF INFORMATION TECHNOLOGIES Lesson №18 Telecommunication software design for analyzing and control packets on the networks by using.
Directed SIP Peer-to-Peer Telephony Creating a New Carrier-Class Model Joel Maloff, Ph.D. – EVP and CTO Fusion Telecommunications International
An analysis of Skype protocol Presented by: Abdul Haleem.
5 Firewalls in VoIP Selected Topics in Information Security – Bazara Barry.
1 Network Firewalls CSCI Web Security Spring 2003 Presented By Yasir Zahur.
How a major ISP built a new anti-abuse platform Mike O’Reirdan Comcast Distinguished Engineer Internet Systems Engineering Comcast National Engineering.
By Naeem Amjad 1.  Challenges  Introduction  Motivation  First Order Radio Model  Proposed Scheme  Simulations And Results  Conclusion 2.
ADVANCED COMPUTER NETWORKS Peer-Peer (P2P) Networks 1.
Mapping Internet Sensor With Probe Response Attacks Authors: John Bethencourt, Jason Franklin, and Mary Vernon. University of Wisconsin, Madison. Usenix.
Chapter 6 Discovering the Scope of the Incident Spring Incident Response & Computer Forensics.
Role Of Network IDS in Network Perimeter Defense.
Multimedia Retrieval Architecture Electrical Communication Engineering, Indian Institute of Science, Bangalore – , India Multimedia Retrieval Architecture.
Accelerating Multi-Pattern Matching on Compressed HTTP Traffic Dr. Anat Bremler-Barr (IDC) Joint work with Yaron Koral (IDC), Infocom[2009]
Instant Messaging. Magnitude of the Problem Radicati reports that 85% of enterprises today use IM. Furthermore, Radicati predicts IM usage increases will.
Skype.
Lecture XV: Real P2P Systems
An example of peer-to-peer application
CS590B/690B Detecting Network Interference (Fall 2016)
3 | Analyzing Server, Network, and Client Health
Firewalls.
SPEAKER: Yu-Shan Chou ADVISOR: DR. Kai-Wei Ke
Mapping Internet Sensors With Probe Response Attacks
Transport Layer Identification of P2P Traffic
Lu Tang , Qun Huang, Patrick P. C. Lee
Presentation transcript:

CONTROLLING P2P APPLICATIONS VIA ADDRESS HARVESTING: THE SKYPE STORY Anat Bremler-Barr Omer Dekel Ran Goldschmidt Hanoch Levy Interdisciplinary Center Herzliya Haifa University Tel-Aviv University

Main Contribution Common belief: P2P applications are harder to control and block Distributed, propriety protocol, no special port This paper shows: Skype is vulnerable to a technique of blocking by harvesting the servers that form the control layer Proof by model and experiments Reveals new facts about Skype network 2/29

Motivation: Battle of Power - Who controls the traffic ? P2P application : Skype - Proprietary (encrypted!) protocol - Distributed - Port 80  hard to control War between: Network Provider Application ISP or Enterprise: Enterprise: worries from data leakage ISP: - control bandwidth - sale VoIP services 3/29

Background: Controlling of P2P – current solutions Application control – you can NOT download Skype in the Enterprise\ISP Problem : Bypass downloading client while outside the enterprise Mobile phones and devices. Signatures on the encrypted traffic – an heuristic approach Problem : False positive, very sensitive to small changes or randomization in the protocol, heavy processing on the payload of the traffic. Our solution: Block Skype by mapping the Super Nodes network Advantages: light processing - filtering according to header fields, zero false positive

Background: Skype Architecture Based on partially centralized P2P networks Two types of peer nodes: Regular Clients and Super Nodes Super Nodes (SNs): Control level – heart of Skype Super Nodes = Skype Clients with good Bandwidth, CPU usage...

Background: The Role of a Super Node (SN) Maintains control information: the IPs of the Skype users Each client maintains an SN list  subset of SNs SN list is constantly updated There are also hard-coded SNs which are Skype servers Client that wishes to use Skype (to call) picks one SN from the SN list Querying the IP of the callee SN is defined by (IP,Port) Call Bob

Background: The Role of a Super Node (SN) Maintains control information: the IPs of the Skype users Each client maintains an SN list  subset of SNs SN list is constantly updated There are also hard-coded SNs which are Skype servers Client that wishes to use Skype (to call) picks one SN from the SN list Querying the IP of the callee SN is defined by (IP,Port) Call Bob IP= , Port=3

Background: The Role of a Super Node (SN) Maintains control information: the IPs of the Skype users Each client maintains an SN list  subset of SNs SN list is constantly updated There are also hard-coded SNs which are Skype servers Client that wishes to use Skype (to call) picks one SN from the SN list Querying the IP of the callee SN is defined by (IP,Port) Call Bob

Harvesting technique: Harvesting the Entire Super Nodes Layer Create an SN “black list” by harvesting the whole SNs using small number of clients FW will block access to the SNs in the “black-list” Light process with no false positive since SNs are exact IPs and Ports Client cannot connect to P2P if the system filters all 200 SNs in the SN list X

Harvesting techniques: Using Skype client as a black box. Without any sophisticated reverse engineering. Two basic techniques: 1. Extracting the SN list: Using the information from the SN list Applicable to Skype versions were the SN list is not encrypted. 2. Monitoring the Skype connection: Manipulate the client to connect to many SNs Applicable for all Skype versions 10/29

Harvesting technique: Extracting the SN list SN list: Version SN list is not encrypted. Contains 200 SNs Each SN: The SN list is constantly updated Manipulate client so the list will be updated in high rate: 1. Extracting the SN addresses 2. Flushing almost the entire SN list, leaving only one SN 3. Restarting the Skype Client and waiting until the list is refreshed with 200 SN addresses. Experiment result: Each such round 2 minutes, harvesting up to 200 new SNs

Harvesting technique: Monitoring the Skype connection Monitor outbound connections of skype client using netstat command Locate the SN which the client connects to Block the SN with a local or external firewall and repeat the process Result: 30 new SNs per minute 12/29

Harvesting technique: Experiment – Extracting the SN list We concentrate on the first technique : Extracting the SN list  higher rate of harvesting Experiment setup: 71 harvesters (harvester=Skype client) located at Israel and Zurich It is enough to run 3-4 real physical machines. Each one runs around 20 clients by using virtual machine and multi users functionality. Collected over 40 Million SN addresses 107,000 unique SNs Run for 80 hours 13/29

Harvesting technique: Experiment Process converge The order of the harvesters was picked randomly, and the result was stable for any order. Majority of the SNs, were discovered by the first 30 harvesters  the process converge.

Harvesting technique: Experiment This is on going process – the population of the SNs is constantly changing Explanation: Dynamic nature of P2P clients and SNs (join and leave the network) 46% of the SNs have dynamic IP addresses  an SN that changes its IP is as a new SN to the system On going process 15/29

Harvesting technique: Measure the blocking probability Tester – Skype client that simulates the attempts of a regular user to connect to Skype During the experiment, 12 testers (Israel, Swiss and USA) each performs 240 tests in a period of 4 days The test Step 1: Tester preforms login to Skype and retrieves a new SN list Step 2: Test the capability to connect to Skype = Check if all SNs in the SN list are known to the system Check 0,10,30 minutes after retrieving the SN list Step 3: Tester preforms shout down and waits in order to receive a new SN list in order to preform the next test

Harvesting technique: blocking probability Client is disconnected from Skype if all the SNs in its SN list are known to the system The average blocking probability is very high: even a fresh list has 94.5% probability Low dependency on the time that elapsed from retrieving the list until the attempt to connect to Skype

SN population characteristics Popular SNs 10% of the most frequent SNs covers roughly 80% of the total collected records. No frequent port Skype port at the client is chosen randomly No dominant AS. SNs are distributed over the world (but more at USA)

Static model Let M - # SNs in the population – assumption fixed Let N ~ # SNs in SN list Randomly select N distinct objects from the set of M objects. Return the N objects and again select N distinct objects. Repeat this process K times. Question: what is the probability that each of the objects selected at the K + 1 st time was selected earlier. Version of Coupon Collector problem

Analysis of Static Model Exact solution by recursion Luckily, approximate solution is a good estimation N - list M - population K - iteration q = Pr[x is not selected in experiments 1,...,K ] =(1 – N/M) K 20/29

Dynamic model An IP address remains valid for a period of time ~ ”the life of the address” In the end of the duration, the address changes and a new address will be valid The harvesters have time to capture the SN proportional to the age of the address. Age  hard to retrieve. Residual life ~ age : the two density functions are similar We measure the residual life density function (and use it). 21/29

Dynamic Nature of SN: Estimation of the residual life density function Harvesting of SNs: Using the SN listUDP packet of Skype login Stage 1: Collecting 5,000 SNs in 15 minutes Stage 2: Ping each SN every 15 minutes for 3 months 22/29

Residual life density function 1 st Day: 18% of the SNs died 2 nd Day: 8% 3 rd Day: 5% 4 th Day: 3% The harvesting process is an on going process mainly due to dynamic affect of IPs

Estimating the population of active SNs Our goal: estimate the number of SNs in specific time As far as we know we give here the first estimation Assumption: fixed population size - M M × Death rate = new discovered SNs Result: M × = 9  M~45,000 # of dead SNs in the first iteration of our test # new SNs in each harvesting iteration after the process converge

Model Result Harvesters = 71 Static: 100% after 50 iterations 25/29

Model Result Harvesters = 71 Dynamic: 92% (~ 95% experiment) 26/29

Skype countermeasures are limited Possible techniques: Reducing the updating rate of the SN list Changing the SN list size Increasing the population, M The Harvesting technique can overcome the above countermeasures by increasing the number of harvesters linearly 27/29

Conclusion In this paper we use measurements and modeling and show that it is feasible to harvest the vast majority of the active SNs of Skype. This makes Skype vulnerable We suspect that this vulnerability may be a fundamental problem of P2P networks, despite their distributed nature. 28/29