Security Weaknesses in Bluetooth by Markus Jakobsson and Susanne Wetzel Lucent Technologies – Bell Labs presented by Boris Kurktchiev.

Slides:



Advertisements
Similar presentations
Gone in 360 Seconds: Hijacking with Hitag2
Advertisements

ECE454/CS594 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2011.
1 Security in Wireless Protocols Bluetooth, , ZigBee.
CS470, A.SelcukCryptographic Authentication1 Cryptographic Authentication Protocols CS 470 Introduction to Applied Cryptography Instructor: Ali Aydin Selcuk.
Trust relationships in sensor networks Ruben Torres October 2004.
Presented By: Hathal ALwageed 1.  R. Anderson, H. Chan and A. Perrig. Key Infection: Smart Trust for Smart Dust. In IEEE International Conference on.
1 Security Handshake Pitfalls. 2 Authentication Handshakes Secure communication almost always includes an initial authentication handshake: –Authenticate.
SSL CS772 Fall Secure Socket layer Design Goals: SSLv2) SSL should work well with the main web protocols such as HTTP. Confidentiality is the top.
Efficient Public Key Infrastructure Implementation in Wireless Sensor Networks Wireless Communication and Sensor Computing, ICWCSC International.
KAIS T Message-In-a-Bottle: User-Friendly and Secure Key Deployment for Sensor Nodes Cynthia Kuo, Mark Luk, Rohit Negi, Adrian Perrig(CMU), Sensys
Packet Leashes: Defense Against Wormhole Attacks Authors: Yih-Chun Hu (CMU), Adrian Perrig (CMU), David Johnson (Rice)
1 Digital Signatures & Authentication Protocols. 2 Digital Signatures have looked at message authentication –but does not address issues of lack of trust.
Mar 12, 2002Mårten Trolin1 This lecture Diffie-Hellman key agreement Authentication Certificates Certificate Authorities SSL/TLS.
Introduction to Cryptography and Security Mechanisms: Unit 5 Theoretical v Practical Security Dr Keith Martin McCrea
Wireless Security In wireless networks. Security and Assurance - Goals Integrity Modified only in acceptable ways Modified only by authorized people Modified.
Security in Wireless LAN Layla Pezeshkmehr CS 265 Fall 2003-SJSU Dr.Mark Stamp.
Security Internet Management & Security 06 Learning outcomes At the end of this session, you should be able to: –Describe the reasons for having system.
EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 7 Wenbing Zhao Department of Electrical and Computer Engineering.
CMSC 414 Computer and Network Security Lecture 22 Jonathan Katz.
Kemal AkkayaWireless & Network Security 1 Department of Computer Science Southern Illinois University Carbondale Wireless & Network Security Lecture 10:
Security Internet Management & Security 06 Learning outcomes At the end of this session, you should be able to: –Describe the reasons for having system.
CSE331: Introduction to Networks and Security Lecture 24 Fall 2002.
EEC 688/788 Secure and Dependable Computing Lecture 7 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University
J. Wang. Computer Network Security Theory and Practice. Springer 2008 Chapter 6 Wireless Network Security Part II.
CMSC 414 Computer and Network Security Lecture 17 Jonathan Katz.
NCHU AI LAB Implications of Unlicensed Mobile Access for GSM security From : Proceeding of the First International Conference on Security and Privacy for.
Network Security. Contents Security Requirements and Attacks Confidentiality with Conventional Encryption Message Authentication and Hash Functions Public-Key.
Chapter 8.  Cryptography is the science of keeping information secure in terms of confidentiality and integrity.  Cryptography is also referred to as.
Alexander Potapov.  Authentication definition  Protocol architectures  Cryptographic properties  Freshness  Types of attack on protocols  Two-way.
SYSTEM ADMINISTRATION Chapter 13 Security Protocols.
GSM Network Security ‘s Research Project By: Jamshid Rahimi Sisouvanh Vanthanavong 1 Friday, February 20, 2009.
Wireless and Security CSCI 5857: Encoding and Encryption.
“Security Weakness in Bluetooth” M.Jakobsson, S.Wetzel LNCS 2020, 2001 The introduction of new technology and functionality can provides its users with.
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.
University of Virginia 1 Gregory LammGerlando Falauto Jorge EstradaJag Gadiyaram November 29, 2000 Identifying and Assessing Security Issues related to.
IWD2243 Wireless & Mobile Security Chapter 4 : Security in Wireless Ad Hoc Network Prepared by : Zuraidy Adnan, FITM UNISEL1.
Lecture 11: Strong Passwords
Security Protocols and E-commerce University of Palestine Eng. Wisam Zaqoot April 2010 ITSS 4201 Internet Insurance and Information Hiding.
Lecture 14 ISAKMP / IKE Internet Security Association and Key Management Protocol / Internet Key Exchange CIS CIS 5357 Network Security.
CS526: Information Security Prof. Sam Wagstaff September 16, 2003 Cryptography Basics.
NSRI1 Security of Wireless LAN ’ Seongtaek Chee (NSRI)
Network Security David Lazăr.
PAWS: Security Considerations Yizhuang WU, Yang CUI PAWS WG
Lecture 16: Security CDK4: Chapter 7 CDK5: Chapter 11 TvS: Chapter 9.
Link-Layer Protection in i WLANs With Dummy Authentication Will Mooney, Robin Jha.
無線網路安全 WEP. Requirements of Network Security Information Security Confidentiality Integrity Availability Non-repudiation Attack defense Passive Attack.
발표자 : 현근수 Bluetooth. Overview wireless protocol short-range communications technology single digital wireless protocol connecting multiple devices mobile.
Kerberos By Robert Smithers. History of Kerberos Kerberos was created at MIT, and was named after the 3 headed guard dog of Hades in Greek mythology Cerberus.
Identification Authentication. 2 Authentication Allows an entity (a user or a system) to prove its identity to another entity Typically, the entity whose.
An Analysis of Bluetooth Security Team A: Padmaja Sriraman Padmapriya Gudipati Sreenivasulu Lekkala.
Focus On Bluetooth Security Presented by Kanij Fatema Sharme.
The School of Electrical Engineering and Computer Science (EECS) CS/ECE Network Security Dr. Attila Altay Yavuz Authentication Protocols (I): Secure Handshake.
Overview of the security weaknesses in Bluetooth Dave Singelée COSIC seminar 11/06/2003.
Lecture 5.1: Message Authentication Codes, and Key Distribution
Interleaving and Collusion Attacks on a Dynamic Group Key Agreement Scheme for Low-Power Mobile Devices * Junghyun Nam 1, Juryon Paik 2, Jeeyeon Kim 2,
Wireless Network Security CSIS 5857: Encoding and Encryption.
1 Authenticated Key Exchange Rocky K. C. Chang 20 March 2007.
Bluetooth Low Energy Security Manager CSOS 홍성화. content Security Manager Introduction Security Properties Cryptographic Functions Security Manager Protocol.
Cryptography CSS 329 Lecture 13:SSL.
1 Example security systems n Kerberos n Secure shell.
Department of Computer Science Chapter 5 Introduction to Cryptography Semester 1.
Dr. Nermin Hamza.  Attacks:  Traffic Analysis : traffic analysis occurs when an eavesdroppers observes message traffic on network. Not understand the.
Cryptographic Hash Function. A hash function H accepts a variable-length block of data as input and produces a fixed-size hash value h = H(M). The principal.
Fourth Edition by William Stallings Lecture slides by Lawrie Brown
Originally by Yu Yang and Lilly Wang Modified by T. A. Yang
“I don’t have to be careful, I’ve got a gun.”
Security Of Wireless Sensor Networks
The Secure Sockets Layer (SSL) Protocol
Security of Wireless Sensor Networks
Presentation transcript:

Security Weaknesses in Bluetooth by Markus Jakobsson and Susanne Wetzel Lucent Technologies – Bell Labs presented by Boris Kurktchiev

What are we talking about today? Bluetooth: what it is, why is it vulnerable and can we fix it?

Overview What is bluetooth? How does it work? What are the problems? How do we fix it? Conclusion Personal Remarks

What is bluetooth? Bluetooth - is a standard and communications protocol primarily designed for low power consumption, with a short range (1-50 meters) based on low-cost microchips in each device.

What is bluetooth? Bluetooth enables these devices to communicate with each other when they are in range. The devices use a radio communications system, so they do not have to be in line of sight of each other

What is bluetooth? Essentially it is a mini wireless network between communicating nodes called Piconet. Piconet - allows one master device to interconnect with up to seven active slave devices

What is bluetooth?

How does it work? There are two modes of operation:  Discoverable – nodes respond to queries made by unknown devices and begin negotiations  Non-discoverable – nodes only respond to devices that it has communicated with previously Cryptography in Bluetooth is based on the SAFER+ algorithm. It defines 4 different cryptography functions E1, E21, E22, E3

How does it work? When communication is initiated between nodes, which just discovered each other, they begin by negotiating a link key which is later used for purposes of encryption for this and later sessions.

How does it work? Generation of unit key Generation of initialization key Generation of link key Mutual authentication Generation of encryption key Generation of key stream Encryption of data

How does it work? XXX = public value XXX = secret value XXX = sent in clear XXX = sent encrypted

1. Generation unit key E21 RAND A ADDR A KAKA

2. Generation initialization key E22 PIN IN_RAND PIN Length IN_RAND K init Length

3. Generation link key (1)‏ K init K A = K link K K init K A = K link

3. Generation link key (2)‏ K AB = K link LK_RAND A LK_RAND B E21 ADDR A ADDR B LK_RAND A LK_RAND B K AB = K link ADDR B ADDR A LK_RAND B LK A LK B

4. Mutual authentication ADDR B E1 ADDR B AU_RAND K link AU_RAND SRES AU_RAND K link ADDR B SRES ACO

5. Generation encryption key EN_RAND E3 EN_RAND K link ACO KCKC KCKC

6. Generation key stream E0 ADDR A clock MASTER KCKC K CIPHER ADDR A clock MASTER KCKC

7. Encryption of data K CIPHER DATA

How does it work? If for some reason a device in the network is running out of resources bluetooth utilizes a simpler version of communication.

Unit key K A = K link AB

What are the problems? Limited battery power Computational power Small amount of memory Small range Ad-hoc network Not always I/O-interface

What are the problems? A lot of data is transmitted in the clear If an attacker can obtain an initialisation key he/she is able to compute the link key and thus mount Man-in-The Middle attacks.

What are the problems? Sniffing can be done as well to an extent. Devices that are being sniffed need to be in discoverable mode. With proper equipment distribution an attacker is able to pin point the location of a node.

What are the problems? Location, location, location – this is the hardest and most expensive (money wise) attack that can be mounted. If an attacker is able to spread a large number of “passively” sniffing nodes then he/she will be able to record multiple identities for later use, as well as be able to pin point the location of the node based on where it has most recently been seen.

What are the problems? There are several problems that I see with this attack:  Money - the authors estimate $10 which is not true even 7 years later. The smallest equipped PC that I am aware of are Gum-Stick PCs which start at $80 (that's without the bluetooth module)‏

What are the problems?  Quantity – even with today's devices the longest straight distance you can get is about 50m in practice. So if you want to cover a building for example you will have to deploy a very large number of devices.

What are the problems? Eavesdropping and Impersonation – since the entire communication is based around the initialisation key if an attacker is able to guess and create a hash database of these then he/she will be able to listen in or become any of the devices in the piconet.

What are the problems? Eavesdropping –  Method One: in order to achieve this an attacker does not need to do much more than initiate a brute-force attack on the PIN used to setup communication. He/She can start guessing PIN # with length up to 5-6 digits and verify their correctness by engaging the victim in verification stage of the protocol.

What are the problems?  Method Two: the attacker will attempt to setup communication with a node using a PIN he/she has chosen, at this point the initialisation protocol kicks in and the victim sends all the needed information for the attacker to be able to run a simulated communication until he is able to generate a valid PIN and initialisation key pair.

What are the problems? Finally, if an attacker is able to guess a correct PIN and initialisation key pair then he is able to perform a MitM attack on the network.  Since devices can be both masters and slaves and neither has a predefined role. An attacker can force the devices to both enter a master role or a slave one, which puts them out of sync, unless the attacker transmits messages to them.

What are the problems? Final attack on the protocol involves the ciphers used.  In a pre-computation phase, an attacker randomly selects N internal states of the cipher, and computes the corresponding output key stream. These N key streams are sorted and stored in a database. Then M bits of the actual key-stream are observed.

What are the problems?  If M ∗ N > 2^132 then one expects to see a collision between the actual key-stream and a key-stream in the database.  By choosing M = N = 2^66, this shows that the cipher can be broken with time and memory complexity 2^66

How do we fix it? PIN Length - In order to avoid a situation in which an attacker is able to obtain the secret keys of victim devices, it is important to use su ffi ciently long and su ffi ciently random PINs. The authors determine that 64 bit PINs should be sufficient enough. Application Layer Security – using something similar to Certificates can prevent MitM attacks from happening.

How do we fix it? Master/Slave Relations – making sure that certain devices are not able to change status will help with MitM attacks since an attacker will not be able to jam the devices.

How do we fix it? Physical Protection - Our attacks on the key exchange rely on the attacker being able to detect the signals transmitted by the victim devices. The use of a Faraday’s cage (with the form factor of a metal coated plastic bag) may be useful to obtain security against this attack.

How do we fix it? Cipher - the attacks against the cipher can be avoided by replacing the cipher, e.g., with AES, and not to use plaintext communication in order to setup the encryption of later plaintexts.

Conclusion This paper is based on now defunct bluetooth standard. Most of the problems described in this paper are now taken care of in the latest version of the protocol (currently at version 2.1 with version 3.0 being in the works).

Personal Remarks Enable Bluetooth only when you need it Keep the device in non-discoverable mode Use long and difficult to guess PIN key when pairing the device (key such as 1234 is unacceptable)‏ Reject all unexpected pairing requests Check list of paired devices from time to time to ensure there are no unknown devices on the list Enable encryption when establishing BT connection to your PC.

Personal Remarks There is an attack the authors did not explore at all and that is DoSing a device: during the PIN brute-force verification, an attacker can just flood a node with these requests and prevent legitimate uses of the device due to its inability to process them. Authors never discuss the fact that the bluetooth protocol allows modifications to certain devices without any prior pairing: phonebook sharing and contact sharing. No prevention of replay attacks

Questions?