计算机应用

• 网络与信息安全 • 上一篇    下一篇

有门限可认证的多重秘密密钥协商方案

张艳硕 刘卓军   

  1. 北京电子科技学院 基础部;中国科学院 数学机械化重点实验室 中国科学院 数学机械化重点实验室
  • 收稿日期:2007-05-22 修回日期:1900-01-01 发布日期:2007-10-01 出版日期:2007-10-01
  • 通讯作者: 张艳硕

Multi-secret key agreement scheme with threshold and authority

Yanshuo Zhang Zhuojun Liu   

  • Received:2007-05-22 Revised:1900-01-01 Online:2007-10-01 Published:2007-10-01
  • Contact: Yanshuo Zhang

摘要: 密钥管理是信息安全中的一个重要领域,密钥协商是密钥管理中的一个重要方面。基于线性码理论给出了一个计算安全的有门限可认证的多重秘密密钥协商方案。该方案使得参与者可以协商秘密密钥,而不用基于离散对数假设。参与秘密密钥协商的参与者组成的集合必须满足门限要求才能进行秘密密钥协商;同时协商的秘密密钥具有多重性,即进行一次秘密协商,可产生出多个秘密密钥。该方案基于线性码理论,可以进行验证,具有认证功能,能够防止第三方攻击。

关键词: 线性码, 第三方攻击, 密钥协商, 门限, 多重秘密, 认证

Abstract: Key management is an important field in information security. Key agreement is one of the core problems in the key management.A new computationally secure threshold multi-secret key agreement scheme with authority based on the theory of linear codes was introduced.The scheme makes the users share the secret key, and does not need to be based on discrete logarithm. The set of participants to perform key agreement should satisfy threshold. In the scheme, multi-secret key can be initiated in one key agreement session. The scheme based on linear codes has the property of authority by checking the equality to prevent the third party attack.

Key words: linear codes, third party attack, key agreement, threshold, multi-secret, authority