通信学报 ›› 2017, Vol. 38 ›› Issue (1): 1-8.doi: 10.11959/j.issn.1000-436x.2017001

• 学术论文 •    下一篇

适于双冗余系统的信任链生成和更新算法

王雷1,2,3,杨明华3,刘增良2,郑建群3   

  1. 1 清华大学精密仪器系,北京 100084
    2 国防大学信息指挥与作战教研部,北京 100091
    3 火箭军装备研究院,北京 100094
  • 修回日期:2016-12-18 出版日期:2017-01-01 发布日期:2017-01-23
  • 作者简介:王雷(1967-),男,江苏扬州人,火箭军装备研究院研究员,主要研究方向为指挥通信、信息安全。|杨明华(1977-),男,黑龙江哈尔滨人,博士,火箭军装备研究院高级工程师,主要研究方向为可信计算技术、无线传感器网络技术。|刘增良(1958-),男,河北深泽人,国防大学教授、博士生导师,主要研究方向为信息对抗、C3I。|郑建群(1973-),男,江苏建湖人,火箭军装备研究院高级工程师,主要研究方向为信息化应用、网络安全。
  • 基金资助:
    国家核高基重大专项基金资助项目(2014ZX01040501-002)

Trust chain generating and updating algorithm for dual redundancy system

Lei WANG1,2,3,Ming-hua YANG3,Zeng-liang LIU2,Jian-qun ZHENG3   

  1. 1 Department of Precision Instrument,Tsinghua University,Beijing 100084,China
    2 Institute of Information Operation,National Defence University of PLA,Beijing 100091,China
    3 Rocket Force Equipment Research Institute,Beijing 100094,China
  • Revised:2016-12-18 Online:2017-01-01 Published:2017-01-23
  • Supported by:
    Nucleus High Base Significant Special Project(2014ZX01040501-002)

摘要:

可信计算技术中传统的信任链构建方式只适用于单一系统,对于工业控制领域广泛采用的双冗余系统会造成信任传递的断裂,为此提出一种适于双冗余系统的信任链模型,通过双信任链设计以及IMC/IMV交互机制,实现信任链从一个计算单元到另一个计算单元的扩展。在此基础上,提出了双冗余系统信任链生成和更新算法。最后基于可信理论和实验分析,对所提出模型的有效性进行证明。

关键词: 可信计算, 工控计算机, 双冗余系统, 信任链, IMC/IMV

Abstract:

In trusted computing field,the traditional construction mode of trust chain is only applicable to a single system.For the dual redundancy system,it causes break of transitive trust.A trust model suitable for dual redundancy system was proposed.Through double trust chain design and IMC/IMV interaction mechanism,the trust chain extension of trust from a computing unit to another unit was realized.On this basis,a trust chain generating and update algorithm for dual redundancy system was proposed.Finally,the validity of the proposed model was proved based on the trusting theory.

Key words: trusted computing, industrial control computer, dual redundancy system, trust chain, IMC/IMV

中图分类号: 

No Suggested Reading articles found!