Wireless bluetooth communications combine with secure data transmission using ECDH and conference key agreements

Authors:
Hua-Yi Lin;Tzu-Chiang Chiang
Affiliations:
Department of Information Management, China University of Technology, Taiwan, R.O.C.;Department of Information Management, Tunghai University, Taiwan, R.O.C.
Venue:
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Year:
2010

Citing 4
Cited 0

A key-management scheme for distributed sensor networks

Proceedings of the 9th ACM conference on Computer and communications security
BlueCube: constructing a hypercube parallel computing and communication environment over bluetooth radio systems

Journal of Parallel and Distributed Computing
TinyECC: A Configurable Library for Elliptic Curve Cryptography in Wireless Sensor Networks

IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
NanoECC: testing the limits of elliptic curve cryptography in sensor networks

EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

As the fast development of Bluetooth networks and wireless communications, the mobile devices share information with each other easier than ever before However, the handy communication technology accompanies privacy and security issues Nowadays, a Bluetooth adopts peer-to-peer and Frequency Hopping Spread Spectrum (FHSS) mechanisms to avoid data reveal, but the malicious attacks collect the transmission data of the relay station for a long period of time and then can break into the system In this study, we take a Piconet as a cube, and transform a Scatternet into a cluster (N-cube) structure Subsequently, this study exploits the Elliptic Curve Diffie-Hellman (ECDH) [1] and the Conference Key (CK) schemes to perform session key agreements and secure data transmissions The proposed scheme only needs a small key length 160-bit to achieve compatible security levels on 1024-bit Diffee-Hellman (DH) [2], and each node uses few CPU, memory and bandwidth to complete security operations As a result, the proposed fault-tolerant routing algorithm with secure data transmissions can perform rapidly and efficiently, and is quite suited for Bluetooth networks with limited resources.