extraction from wireless signal
play

Extraction from Wireless Signal Strength in Real Environments Suman - PowerPoint PPT Presentation

On the Effectiveness of Secret Key Extraction from Wireless Signal Strength in Real Environments Suman Jana, Sriram Nandha Premnath Mike Clark, Sneha K. Kasera, Neal Patwari University of Utah Srikanth V. Krishnamurthy University of


  1. On the Effectiveness of Secret Key Extraction from Wireless Signal Strength in Real Environments Suman Jana, Sriram Nandha Premnath Mike Clark, Sneha K. Kasera, Neal Patwari University of Utah Srikanth V. Krishnamurthy University of California, Riverside

  2. Problem Definition  wireless nodes, Alice & Bob, need to share secret key  concerns with public key cryptography  quantum cryptography – too expensive  less expensive solution - use inherent randomness in wireless channel to extract secret key bits 2

  3. Wireless Channel Characteristics  measured reciprocally at Alice, Bob  when away by more than few multiples of wavelength, Eve cannot measure same channel  channel varies with time 3

  4. Use of Received Signal Strength (RSS) RSS Variations Alice Bob Bob Alice Probe Exchange & Eve RSS Measurement  Alice, Bob expected to see “ identical” RSS variations RSS Variations [Stutzman „82]  realistically, they must deal with lack of perfect reciprocity Eve 4

  5. Related Work Mathur ‟08, Li ‟06, Aono ‟05  extract single bit per measurement  experimental results from limited indoor settings  Alice, Bob do not communicate to handle mismatches will result in key disagreement in large number of cases Azimi- Sadjadi ‟07  suggested using 2 stages from quantum cryptography - information reconciliation, privacy amplification  did not implement! 5

  6. Our Contributions • adaptive key extraction increases secret bit rate 4-fold • implement information reconciliation to handle bit mismatch • implement privacy amplification to reduce correlation between successive bits • through extensive real world measurements, identify settings (un)suitable for key extraction • expose new predictable channel attack in static settings 6

  7. Overview  adversary model  secret key extraction  real world measurements, results  summary 7

  8. Adversary Model  adversary Eve  listens to all communication between Alice, Bob  can measure channel between herself and Alice, Bob  separated from both parties by distance >> wavelength  Eve not interested in disrupting communication between Alice, Bob  Alice, Bob are not authenticated 8

  9. Secret Bit Extraction Quantization RSS Measurements Information Reconciliation Privacy Secret Key Amplification Bits 9

  10. Adaptive Quantization how to generate bits from RSS measurements? Extract “1” adapt threshold Upper Threshold Drop for small blocks of measurements Drop Extract Lower “0” Threshold Extracted Bits – 1 1 1 0 1 … 10

  11. Adaptive Quantization Extract “10” Interval 4 adapt # intervals depending on range “11” Interval 3 “01” Interval 2 “00” Interval 1 Extracted Bits - 11 10 11 10 10 11 01 00 01 …

  12. Adaptive Quantization Extract “111” Interval 8 “110” adapt #intervals Interval 7 “101” depending on range Interval 6 “100” Interval 5 “011” Interval 4 limit: N ≤ log [Range] “010” Interval 3 “001” Interval 2 “000” Interval 1 Extracted Bits - 101 110 101 110 110 100 010 … Adaptive Secret Bit Generation (ASBG)

  13. Information Reconciliation [Brassard ’06] differences in between bit streams of Alice, Bob arise due to  noise/interference, wireless hardware limitations  half-duplex nature of channel solution:  exchange parity information of small blocks of bits  locate, correct mismatches using binary search  permute, iterate until probability [success] > threshold 13

  14. Privacy Amplification [Impagliazzo ’89]  short-term correlation between subsequent bits when probing rate > (coherence time) -1  need to remove bits leaked during information reconciliation  solution:  apply 2- universal hash function h: {1…M}  {1…m}  for inputs x, y, probability [h(x) = h(y)] upper bounded by 1/m  decreases output length, but increases entropy 14

  15. Implementation laptops - Alice, Bob  equipped with Intel PRO/Wireless 3945 ABG cards  monitor mode for collecting RSS measurements  use ipwraw driver for raw packet injection probes – IEEE 802.11g beacon frames  management frames prioritized over data frames  allows better control over probing rate  probing rate ~20 packets per second 15

  16. Implementation privacy amplification  2-universal hash functions  use BigNumber OpenSSL routines 16

  17. Implementation 17

  18. RSS Measurement Protocol Responder Initiator  packet losses (Bob) (Alice) handled by initiator Record  20 ms timeout for RSS detecting packet loss Record RSS Record  responder discards RSS last RSS if duplicate Record RSS beacon sequence # time 18

  19. Measurement Goals • in what kind of settings, key extraction “works” ? • how does device heterogeneity affect key extraction? 19

  20. Experiments A. Underground concrete 1. Stationary Endpoints, tunnel Intermediate objects B. Ed Catmull Gallery C. Lawn D. Walk Indoors 2. Mobile Endpoints E. Walk Outdoors F. Bike Ride G. Crowded Cafeteria 3. Stationary Endpoints, Mobile Intermediate H. Across busy road objects 20

  21. Stationary Endpoints & Intermediate Objects  variations very small Underground Concrete Tunnel (range: ~2 dB), exhibit Experiment poor reciprocity -54  expect Alice‟s & Bob‟s -55 bit streams to have -56 RSS very high mismatch -57 -58  small scale variations -59 represent noise Probes Alice Bob snapshot of data collected for few seconds distance between Alice, Bob = 10 feet 21

  22. Stationary Endpoints & Intermediate Objects Gallery Experiment Lawn Experiment -45 -54 -56 -55 -58 RSS -65 RSS -60 -75 -62 -64 -85 Probes Alice Bob -66 Alice Bob Probes distance = 30 ft distance = 10 ft • even typical stationary settings are no different from underground concrete tunnel! 22

  23. Mobile Endpoints Walk Indoors Experiment  large variations -45  range ~25 dB -50  highly reciprocal -55 RSS  hints that Alice‟s & -60 Bob‟s bit streams will -65 have very low -70 mismatch -75 Probes Alice Bob normal walk speed distance = 10-15 ft 23

  24. Mobile Endpoints Walk Outdoors Experiment Bike Ride Experiment -30 -45 -40 -55 RSS -50 RSS -65 -60 -70 -75 -80 Probes Alice Bob -85 Alice Bob Probes slow bike ride normal walk speed 10 ft or more distance 20-25 ft distance more evidence - mobile devices likely to have very low • mismatch effects of noise diminished by l arge scale variations • 24

  25. Mobile Intermediate Objects & Stationary Endpoints Crowded Cafeteria Experiment Experiment Across Busy Road -46 -69 -71 -50 -73 RSS -54 RSS -75 -58 -77 -62 -79 -66 Probes Alice Bob Probes Alice Bob high speed mobility; distance = 25 ft low speed mobility; distance = 10 ft intermediate variation range (~8-16 dB), reciprocity  hints - Alice‟s, Bob‟s bit streams will have moderate  mismatch 25

  26. Predictable Channel Attack  novel attack  in „all stationary‟ settings Eve can cause predictable channel variations  by controlling movements of intermediate objects  break key extraction schemes without spending compute power 26

  27. Predictable Channel Attack  no precision machinery -43 required -48  Eve can produce zig- RSS -53 zag patterns, or any other pattern by -58 controlling movements -63 Probes  no post processing will ensure security of bits extracted: extracted key! 0000 1111 0000 1111 … 27

  28. Effect of Device Heterogeneity Walk Indoors Experiment  greater mismatch than -40 with homogeneous -45 -50 devices -55 RSS -60 -65  mismatch low enough -70 -75 to help establish -80 secret key -85 Probes Alice (Intel 3945 ABG) Bob (Atheros) 28

  29. Comparison of Key Extraction Approaches in Various Settings  performance metrics  entropy rate  mismatch rate  secret bit rate  single bit, multiple bit extraction 29

  30. Comparison of Key Extraction Approaches in various Settings 1.00 Entropy 0.75 0.50 0.25 0.00 stationary mobile intermediate Experiments Aono Mathur Tope Azimi-Sadjadi ASBG secret bit stream from • ASBG entropy close to 1  passes randomness tests  of NIST test suite we conduct 30

  31. Comparison of Key Extraction Approaches in various Settings 1.00 Entropy 0.75 0.50 0.25 0.00 stationary mobile intermediate Experiments Aono Mathur Tope Azimi-Sadjadi ASBG 1.00 Mismatch Rate mobile settings yield bits • 0.75 with low mismatch rates 0.50 0.25 0.00 stationary mobile intermediate Experiments Aono Mathur Tope Azimi-Sadjadi ASBG 31

  32. Comparison of Key Extraction Approaches in various Settings 1.00 1.00 Secret bit rate Entropy 0.75 0.75 0.50 0.50 0.25 0.25 0.00 0.00 stationary mobile mobile intermediate stationary intermediate Experiments Experiments Aono Mathur Tope Azimi-Sadjadi ASBG Aono Mathur Tope Azimi-Sadjadi ASBG 1.00 Mismatch Rate ASBG exhibits highest • 0.75 secret bit rate among those with entropy > 0.7 0.50 0.25 0.00 stationary mobile intermediate Experiments Aono Mathur Tope Azimi-Sadjadi ASBG 32

Recommend


More recommend