The Martini Synch: Device Pairing via Joint Quantization

Device pairing is a significant problem for a large class of increasingly popular resource-constrained wireless protocols such as Bluetooth. The objective of pairing is to establish a secure wireless communication channel between two specific devices without a public-key infrastructure, a secure near-field communication channel, or electrical contact. In this paper, we use a surprising user-device interaction as a solution to this problem. By adding a 3-axis accelerometer, a device can sense its motion in local Cartesian space relative to the inertial space. The idea is to have two devices in a fixed, relative position to each other. The joint object is then moved randomly in 3D for several seconds. The unique and difficult to reproduce motion generates approximately the same distinct signal at each accelerometer. The difference between the signals in the two inertially conjoined sensors should be relatively small under normal motion induced manually except for a fixed attitude offset. The objective is to derive a deterministic key at both sides with maximized entropy that will be used as a private key for symmetric encryption. Currently, our prototype produces 9-20 bits of entropy per second of usual manual motion using off-the-shelf components.

[1]  Mahmoud Naghshineh,et al.  Bluetooth: vision, goals, and architecture , 1998, MOCO.

[2]  Moni Naor,et al.  Certificate revocation and certificate update , 1998, IEEE Journal on Selected Areas in Communications.

[3]  Jolyon Clulow,et al.  Repairing the Bluetooth Pairing Protocol , 2005, Security Protocols Workshop.

[4]  Yiannis Aloimonos,et al.  Polydioptric camera design and 3D motion estimation , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[5]  Avishai Wool,et al.  Cracking the Bluetooth PIN , 2005, MobiSys '05.

[6]  Jeffrey Scott Vitter,et al.  Design and Analysis of Fast Text Compression Based on Quasi-Arithmetic Coding , 1994, Inf. Process. Manag..

[7]  Rafail Ostrovsky,et al.  Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data , 2004, SIAM J. Comput..

[8]  Jaap A. Haitsma,et al.  Robust Audio Hashing for Content Identification , 2001 .

[9]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[10]  Stefan Lucks,et al.  Analysis of the E0 Encryption System , 2001, Selected Areas in Cryptography.

[11]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[12]  Xiaoyun Wang,et al.  Finding Collisions in the Full SHA-1 , 2005, CRYPTO.

[13]  Xiaoyun Wang,et al.  How to Break MD5 and Other Hash Functions , 2005, EUROCRYPT.

[14]  Vishal Monga,et al.  A clustering based approach to perceptual image hashing , 2006, IEEE Transactions on Information Forensics and Security.