Secret key for wireless communication in cyber-physical automotive systems

Patent metadata

Field	Value
Publication number	US-10129022-B1
Application number	US-201715439102-A
Country	US
Kind code	B1
Filing date	Feb 22, 2017
Priority date	Feb 22, 2016
Publication date	Nov 13, 2018
Grant date	Nov 13, 2018

Abstract

A key generation technique exploiting the randomness of a wireless channel to generate secret keys to secure automotive wireless communication using symmetric cryptography is presented. Moreover, the algorithm of the present technique solves the challenging key exchange problem in automotive wireless communication with low costs in terms of performance and code size. As demonstrated, the proposed algorithm can generate secret keys with 67% average min-entropy. Furthermore, the proposed technique can achieve up to 10× performance and 20× code size reduction in comparison to the state-of-the-art hybrid cryptographic algorithms.

First claim

What is claimed is:

1. A method of generating a key to effectively secure wireless communications between a first communication node and a second communication node, wherein a first cyber-physical system is disposed within the first communication node and a second cyber-physical system is disposed within the second communication node, wherein each cyber-physical system performs an encryption and decryption of said wireless communications, wherein the method comprises:
a. sending and receiving a predefined group of probe signals, of predefined size (“G size ”), between the first communication node and the second communication node via a wireless channel, wherein the group of probe signals are sent for evaluating randomness of a channel gain of the wireless channel;
b. collecting a plurality of received signal strength (“RSS”) values from the wireless channel;
c. obtaining a plurality of filtered RSS values by filtering the plurality of RSS values with a high-pass filter defined by an impulse frequency response of the wireless channel, wherein the plurality of filtered RSS values contain information needed to generate the key of required length, K length ;
d. generating a set of bits, comprising:
i. calculating an upper threshold, Th up , and a lower threshold, Th lo , based on a mean and a variation of the plurality of filtered RSS values; and
ii. assigning each filtered RSS value greater than Th up to 1 and assigning each filtered RSS value less than Th lo to 0, wherein each filtered RSS value between Th up and Th lo is discarded;

e. generating the key having a length L, by collecting the set of bits; and
f. verifying a length, L, of the key ( 104 ), wherein if L is less than K length , then steps a-f are repeated until L is greater than or equal to K length ,

wherein the key is used by the first and second cyber-physical systems to encrypt and decrypt the wireless communications between the first and second communication nodes.

2. The method of claim 1 , wherein each probe signal is exchanged within a time period less than a coherence time (“T c ”) of the wireless channel between the first communication node and the second communication node.

3. The method of claim 2 , wherein a time interval (“τ step ”) between exchanging each probe signal is not less than T c .

4. The method of claim 3 , wherein the plurality of RSS values are collected within time period defined by G size ×τ step .

5. The method of claim 1 further comprising performing a mismatch check to remove one or more mismatch bits from the set of bits.

6. The method of claim 1 further comprising determining an energy and performance-aware optimization, wherein said optimization is formulated as a linear optimization problem to be minimized:
W 1 *(KeyGenOHR p +CryptOHR p )+ W 2 *(KeyGenOHR e +CryptOHR e ),

wherein W 1 is a pre-defined weight performance, W 2 is a predefined energy overhead, KeyGenO H R p is a key generation performance overhead, KeyGenO H R e is a key generation energy overhead, CryptO H R p is a cryptographic algorithm performance overhead and CryptO H R e is a cryptographic algorithm energy overhead, wherein solving the linear optimization problem provides an optimized solution for the cryptographic algorithm, the K length , and a time interval for which the cryptographic algorithm or the key is effective.

7. The method of claim 1 , wherein the first communication node is a vehicle or infrastructure.

8. The method of claim 1 , wherein the second communication node is a vehicle or infrastructure.

9. A system ( 200 ) for generating a key to effectively secure wireless communications between a first communication node ( 215 ) and a second communication node ( 217 ), wherein a first cyber-physical system ( 201 ) is disposed at the first communication node ( 215 ) and a second cyber-physical system ( 221 ) is disposed at the second communication node ( 217 ), wherein each cyber-physical system performs an encryption and decryption of said wireless communications, wherein the system ( 200 ) comprises:
a. a first transceiver ( 203 ) disposed at the first communication node ( 215 );
b. a second transceiver ( 219 ) disposed at the second communication node ( 217 ), wherein the second transceiver ( 219 ) is linked to the first transceiver ( 203 ) by a wireless channel;
c. a processor, operatively coupled to the first transceiver ( 203 ); and
d. a memory operatively coupled to the processor, configured to store digitally-encoded instructions that, when executed by the processor, cause the processor to perform operations comprising:
i. sending and receiving a predefined group of probe signals of predefined size (“G size ”), between the first transceiver ( 203 ) and the second transceiver ( 219 ) via the wireless channel, wherein the group of probe signals are sent for evaluating randomness of a channel gain of the wireless channel;
ii. collecting a plurality of received signal strength (“RSS”) values from the wireless channel;
iii. obtaining a plurality of filtered RSS values by filtering the plurality of RSS values with a high-pass filter defined by an impulse frequency response of the wireless channel, wherein the plurality of filtered RSS values contain information needed to generate the key of required length, K length ;
iv. generating a set of bits, comprising:
A. calculating an upper threshold, Th up , and a lower threshold, Th lo , based on a mean and a variation of the plurality of filtered RSS values; and
B. assigning each filtered RSS value greater than Th up to 1 and assigning each filtered RSS value less than Th lo to 0, wherein each filtered RSS value between Th up and Th lo is discarded;

v. generating the key having a length L, by collecting the set of bits;
vi. performing a mismatch check to remove one or more mismatch bits from the set of bits of the key;
vii. determining and applying an energy and performance-aware optimization, wherein said optimization is formulated as a linear optimization problem to be minimized, wherein solving the linear optimization problem provides an optimized solution for the K length and a time interval for which the key is effective; and
viii. verifying a length, L, of the key, wherein if L is less than K length , then steps i-viii are repeated until L is greater than or equal to K length ,

wherein the key is used by the first and second cyber-physical systems ( 201 , 221 ) to encrypt and decrypt the wireless communications between the first and second communication nodes ( 215 , 217 ).

10. The system of claim 9 , wherein each probe signal is exchanged within a time period less than a coherence time (“T c ”) of the wireless channel between the first communication node and the second communication node, wherein a time interval (“τ step ”) between exchanging each probe signal is not less than T c .

11. The system of claim 10 , wherein the plurality of RSS values are collected within time period defined by G size ×τ step .

12. The system of claim 9 , wherein said linear optimization problem to be minimized is:
W 1 *(KeyGenOHR p +CryptOHR p )+ W 2 *(KeyGenOHR e +CryptOHR e ),

wherein W 1 is a pre-defined weight performance, W 2 is a predefined energy overhead, KeyGenO H R p is a key generation performance overhead, KeyGenO H R e is a key generation energy overhead, CryptO H R p is a cryptographic algorithm performance overhead and CryptO H R e is a cryptographic algorithm energy overhead, wherein solving the linear optimization problem provides an optimized solution for the cryptographic algorithm, the K length , and a time interval for which the cryptographic algorithm or the key

Assignees

• Univ California

Inventors

• Al Faruque Mohammad Abdullah
• Wan Jiang
• Lopez Anthony

Classifications

• H04L63/0428 Primary

  wherein the data content is protected, e.g. by encrypting or encapsulating the payload · CPC title

• H04L9/0869 Primary

  involving random numbers or seeds · CPC title

• H04W12/08

  Access security · CPC title

• H04W12/041 Primary

  Key generation or derivation · CPC title

• H04W12/047

  without using a trusted network node as an anchor · CPC title