Preserving Caller Anonymity in Voice-over-IP Networks Mudhakar Srivatsa, Ling Liu and Arun Iyengar Presenter: Bo Wu.

Slides:



Advertisements
Similar presentations
VoIP PRESENTATION BY HÜSEYİN SAVRAN OUTLINE PSTN an brief history of telephone.
Advertisements

Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Quality-of-Service Routing in IP Networks Donna Ghosh, Venkatesh Sarangan, and Raj Acharya IEEE TRANSACTIONS ON MULTIMEDIA JUNE 2001.
BAI613 Module 2 - Voice over IP Technology. Module Objectives 1. Describe the benefits of IP Telephony/Packet Telephony/VoIP over traditional telephone.
Security in VoIP Networks Juan C Pelaez Florida Atlantic University Security in VoIP Networks Juan C Pelaez Florida Atlantic University.
Modelling and Analysing of Security Protocol: Lecture 10 Anonymity: Systems.
Rumor Riding, IEEE ICNP2006, Jinsong Han & Yunhao Liu, HKUST, Nov 12 1 Rumor Riding Anonymizing Unstructured Peer- to-Peer System Jinsong Han and Yunhao.
Mudhakar Srivatsa, Ling Liu and Arun Iyengar Presented by Mounica Atluri.
Packet Leashes: Defense Against Wormhole Attacks Authors: Yih-Chun Hu (CMU), Adrian Perrig (CMU), David Johnson (Rice)
A Flexible Model for Resource Management in Virtual Private Networks Presenter: Huang, Rigao Kang, Yuefang.
Security and Privacy Issues in Wireless Communication By: Michael Glus, MSEE EEL
LightFlood: An Optimal Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.
Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.
Application layer (continued) Week 4 – Lecture 2.
Voice Over Internet Protocol “VoIP” Muayyed Al Kadhem Abdulkhaleq Al Musaleem.
Trust Level Based Self-Organized Routing Protocol for Secure Ad Hoc Networks Li Xiaoqi, GiGi 12/3/2002.
IP Telephony (Article Presentation) by Samir Goswami Source: Rivier College, CS699 Professional Seminar.
Probability Grid: A Location Estimation Scheme for Wireless Sensor Networks Presented by cychen Date : 3/7 In Secon (Sensor and Ad Hoc Communications and.
CSE 461: Distance Vector Routing. Next Topic  Focus  How do we calculate routes for packets?  Routing is a network layer function  Routing Algorithms.
Voice over Internet Protocol (VoIP) Training and Development.
A Study on Quality of Service Issues in Internet Telephony  IP Telephony – Applications and Services  Advantages and benefits of Voice over IP  Technical.
A distributed Search Service for Peer-to-Peer File Sharing in Mobile Applications From U. of Dortmund, Germany.
Voice & Data Convergence Network Services January 11, 2001.
Timing-sync Protocol for Sensor Networks (TPSN) Presenter: Ke Gao Instructor: Yingshu Li.
On the Anonymity of Anonymity Systems Andrei Serjantov (anonymous)
Can You Infect Me Now? Malware Propagation in Mobile Phone Networks Authors: Presented by: Michael Annichiarico.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
VOIP (Voice Over Internet Protocol) CDA 4527 Fall 2006.
Introduction Widespread unstructured P2P network
Mobile IP Performance Issues in Practice. Introduction What is Mobile IP? –Mobile IP is a technology that allows a "mobile node" (MN) to change its point.
EQ-BGP: an efficient inter- domain QoS routing protocol Andrzej Bęben Institute of Telecommunications Warsaw University of Technology,
Privacy-Preserving P2P Data Sharing with OneSwarm -Piggy.
MOBILE AD-HOC NETWORK(MANET) SECURITY VAMSI KRISHNA KANURI NAGA SWETHA DASARI RESHMA ARAVAPALLI.
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,
Peer to Peer Research survey TingYang Chang. Intro. Of P2P Computers of the system was known as peers which sharing data files with each other. Build.
PRESENTED BY: PRIYANKA SINGH BRANCH:ETC REG NO
By Will Peeden.  Voice over Internet Protocol  A way to make phone calls over the internet.  A way to bypass the standard phone company and their charges.
Applied Communications Technology Voice Over IP (VOIP) nas1, April 2012 How does VOIP work? Why are we interested? What components does it have? What standards.
Establishing Connections Networking Modes: When you are evaluating a network, you concentrate on circuit switching versus packet switching. But it's also.
Anonymity on the Internet Presented by Randy Unger.
VOICE OVER INTERNET PROTOCOL. INTRODUCTION SCENARIOS IN INTERNET TELEPHONY VOIP GATEWAYS IMPORTANCE OF VOICE OVER IP BENEFITS & APPLICATIONS ADVANTAGES.
1 CHAPTER 8 TELECOMMUNICATIONSANDNETWORKS. 2 TELECOMMUNICATIONS Telecommunications: Communication of all types of information, including digital data,
Voice over IP by Rahul varikuti course instructor: Vicky Hsu.
A Novel Multicast Routing Protocol for Mobile Ad Hoc Networks Zeyad M. Alfawaer, GuiWei Hua, and Noraziah Ahmed American Journal of Applied Sciences 4:
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.
Security in Ad Hoc Networks. What is an Ad hoc network? “…a collection of wireless mobile hosts forming a temporary network without the aid of any established.
 Introduction – Consumer Market  Benefits – Operational Cost & Flexibility  Challenges – Quality of Service & Securing VOIP  Legal Issuers  Risk.
Wireless communications and mobile computing conference, p.p , July 2011.
Ad Hoc Network.
LightFlood: An Efficient Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.
Voice Over Internet Protocol (VoIP) Copyright © 2006 Heathkit Company, Inc. All Rights Reserved Presentation 1 – Introduction to VoIP.
UNIT 2 LESSON 8 CS PRINCIPLES. UNIT 2 LESSON 8 OBJECTIVES Students will be able to: Describe how routers develop routing tables to determine how to send.
Heterogeneous Wireless Access in Large Mesh Networks Haiping Liu, Xin Liu, Chen-Nee Chuah, Prasant Mohapatra University of California, Davis IEEE MASS.
Social Networks and Peer to Peer As Presented by Jeremy Robinson 3/22/2007.
Voice over Internet Protocol Presenter: Devesh Patidar Arunjay Singh August 2, 2009.
A Key Management Scheme for Distributed Sensor Networks Laurent Eschaenauer and Virgil D. Gligor.
Communication Methods
KAIS T Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks Harshavardhan Sabbineni and Krishnendu Chakrabarty.
LA-MAC: A Load Adaptive MAC Protocol for MANETs IEEE Global Telecommunications Conference(GLOBECOM )2009. Presented by Qiang YE Smart Grid Subgroup Meeting.
HoWL: An Efficient Route Discovery Scheme Using Routing History in Mobile Ad Hoc Networks Faculty of Environmental Information Mika Minematsu
1Security for Service Providers – Dave Gladwin – Newport Networks – SIP ’04 – 22-Jan-04 Security for Service Providers Protecting Service Infrastructure.
IP Telephony (VoIP).
Packet Leashes: Defense Against Wormhole Attacks
Introduction to Networking
Mobile ad hoc networking: imperatives and challenges
ANEEL ABBASI MUHAMMAD ADNAN MOIZ SHAH MUHAMMAD KHAYAM GROUP MEMBERS.
Timing Analysis of Keystrokes And Timing Attacks on SSH
Path key establishment using multiple secured paths in wireless sensor networks CoNEXT’05 Guanfeng Li  University of Pittsburgh, Pittsburgh, PA Hui Ling.
Dhruv Gupta EEC 273 class project Prof. Chen-Nee Chuah
Presentation transcript:

Preserving Caller Anonymity in Voice-over-IP Networks Mudhakar Srivatsa, Ling Liu and Arun Iyengar Presenter: Bo Wu

Agenda Voice-over-IP Caller Anonymity Threat Models Defending Methods Experimental Evaluation Conclusion

Phone. The history…

PSTN PSTN- stands for Public Switched Telephone Network PSTN- stands for Public Switched Telephone Network Circuit-based means reserving resources for each user Circuit-based means reserving resources for each user Kind of expensive Kind of expensive

Voice-over-IP: another choice Voice over Internet Protocol Voice over Internet Protocol “A method for taking analog audio signals, like the kind you hear when you talk on the phone, and turning them into digital data that can be transmitted over the Internet. “ “A method for taking analog audio signals, like the kind you hear when you talk on the phone, and turning them into digital data that can be transmitted over the Internet. “ Also known as: Also known as: Voice over Packet (VoP) Voice over Packet (VoP) IP Telephony (IPT) IP Telephony (IPT)

Benefits #1. SAVING MONEY! #1. SAVING MONEY! Routing phone calls over existing data networks to avoid the need for separate voice and data networks. VOIP offer features and services for free (or at little cost)

Benefits Increased Agility Increased Agility Tactical Advantages Tactical Advantages Integrate things like: s, phone, instant messages, etc. Integrate things like: s, phone, instant messages, etc.

VoIP is popular

Characteristics of VoIP network P2P topology Internet peer peer peer peer peer

Characteristics of VoIP network Additional QoS requirement ITU (International Telecommunication Union) recommends up to 250ms one-way latency for interactive voice communication. People go mad due to bad quality

Anonymity in VoIP networks What is anonymity? NO leakage of information about identity Why is it important? Human rights Sensitive applications

Where is the caller? Source privacy Hot topic in many kinds of networks: Ad hoc, Sensor networks, Mesh networks, …… Papers published in: Infocom, ICDCS, CCS, Securecomm, S&P…

What’s the difficulties? Strong ability of attackers Content analysis Timing analysis Fully distributed Link latency ……

How VoIP works? Establish routes: Unstable topology Routes across different ASPs Sending messages Comply to different application protocols Confidentiality Hop-by-hop encryption End-to-end encryption

Establishing routes InitSearch: Bo Zhenhua

How does it work? ProcessSearch Bo Zhenhua

How does it work? FinSearch Bo Zhenhua

What’s the problem? Bad guys are there… Bo Bad guy: Mr. X Bad guy: Mr. Y

Zhenhua What’s the problem? Bad guys are there… Bo Bad guy: Mr. X Bad guy: Mr. Y

Zhenhua What’s the problem? What if Zhenhua is surrounded by bad guys? Bo Bad guy: Mr. X Bad guy: Mr. Y Bad guy: Mr. W Bad guy: Mr. Z

Threat model Composed by assumptions and formulations Three threat models: Deterministic Triangulation Attack Statistical Triangulation Attack Differential Triangulation Attack

Deterministic Triangulation Attack “Deterministic” means fixed latency for each link Exploit two properties of the route set up protocol: 1. It establishes the shortest route between the two nodes src and dst. 2. Any node can estimate its distance from src => Each bad guy has the knowledge of its distance from any other node in the network

Deterministic Triangulation Attack BoMr. Y Mr. X

Deterministic Triangulation Attack

For each bad guy p i in network If Calculate the final score:

Statistical Triangulation Attack “Statistical” means link latency follows some probabilistic distribution, say Gaussian distribution Exploit one nice property of Gaussian distribution X, Y follow Gaussian distribution If Z = X + Y THEN E(Z) = E(X)+E(Y) When calculating scores, use mean value

Differential Triangulation Attack The mentioned two attacks relies on the time stamp in search packet to make the first estimation. What if the source remove time stamp? The attackers can still cooperate……

Differential Triangulation Attack Bo Mr. Y Zhenhua Dist(Bo, X)-Dist(Bo,Y) < Dist(Zhenhua, X)-Dist(Zhenhua, Y)

Topology discovery All of the three threat models require global information like topology and link latency Malicious nodes can collude to collect such information Send ping messages with small TTL Infer local topology and link latency through pong messages

Attack efficiency Deterministic Triangulation Statistical Triangulation

Attack efficiency Differential Triangulation

Defending algorithms General idea: break the tight correlation of timing and distance Random walk Search Algorithm Best anonymity, worst QOS Hybrid route set up Tradeoff between anonymity and QOS

Random walk search algorithm Basic idea: Randomly select a neighbor to forward search request instead of broadcasting (Random walk is used in tens of papers to defend against traffic analysis.) Why it works? According to random walk theory:

Hybrid Route set up protocol Controlled random walk Two phases Random walk search phase Search dest node by random walk Broadcast search phase Search dest node by broadcast One kind of probabilistic routing: Start at random walk search phase Remain in this phase with probability of p Transfer to Braodcast search phase with probability of 1-p

Hybrid Route set up protocol Multi-Agent Random Walk Send out w search messages instead of one Every search message performs random walk Route established when the first search message arrives at dest node Tradeoff when setting w Bigger w means smaller latency Bigger w also increases attacking efficiency

Simulation results Latency study:

Simulation results Anonymity study:

Comments Brilliant Threat models Capture key properties of broadcast A small percentage of nodes can attack very accurately Not quite novel defending methods Random walk has been used by tens of (if not hundreds of) papers No deep analysis of the performance

Conclusion VoIP is gaining more and more popularity Three threat models directly target at caller’s anonymity Introduce randomness to defend against timing attack Lesson: challenging problem to protect privacy as well as providing QoS

Questions?