首页> 外文会议>IEEE International Conference on Communications >Security Analysis of Key Extraction from Physical Measurements with Multiple Adversaries
【24h】

Security Analysis of Key Extraction from Physical Measurements with Multiple Adversaries

机译:用多个对手的物理测量键提取的安全分析

获取原文

摘要

In this paper, security of secret key extraction scheme is evaluated for private communication between legitimate wireless devices. Multiple adversaries that distribute around these legitimate wireless devices eavesdrop on the data transmitted between them, and deduce the secret key. Conditional min-entropy given the view of those adversaries is utilized as security evaluation metric in this paper. Besides, the wiretap channel model and hidden Markov model (HMM) are regarded as the channel model and a dynamic programming approach is used to approximate conditional min-entropy. Two algorithms are proposed to mathematically calculate the conditional min-entropy by combining the Viterbi algorithm with the Forward algorithm. Optimal method with multiple adversaries (OME) algorithm is proposed firstly, which has superior performance but exponential computation complexity. To reduce this complexity, suboptimal method with multiple adversaries (SOME) algorithm is proposed, using performance degradation for the computation complexity reduction. In addition to the theoretical analysis, simulation results further show that the OME algorithm indeed has superior performance as well as the SOME algorithm has more efficient computation.
机译:在本文中,评估了秘密密钥提取方案的安全性,用于合法无线设备之间的私人通信。在这些合法的无线设备周围分发的多个对手窃听在它们之间传输的数据上窃听,并推断秘密密钥。条件最小熵鉴于这些对手的视图被用作本文的安全评估度量。此外,窃听通道模型和隐藏的Markov模型(HMM)被视为信道模型,并且动态编程方法用于近似条件最小熵。提出了通过将维特比算法与前向算法组合来数学地计算条件最小熵的两种算法。首先提出了具有多个对手(OME)算法的最优方法,其具有优异的性能但指数计算复杂性。为了降低这种复杂性,提出了具有多个对手(某些)算法的次优方法,使用性能下降进行计算复杂性降低。除了理论分析之外,仿真结果还表明,OME算法确实具有卓越的性能以及一些算法具有更有效的计算。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号