论文部分内容阅读
可否认的群密钥协商协议是指两方或多方参与者在一个开放的公共信道上通过协商得到一个共享的会话密钥,并利用该会话密钥建立一个安全的保密信道.同时,协议的可否认性使得在协商过程中产生的通信副本不能证明任何协议的参与者曾经参与了协商.正是由于协议的一系列特性,使得可否认的群密钥协商协议在隐私保护等场合有着广泛的应用,如互联网中的金融谈判等.本文旨在研究如何构造一个安全的高效的可否认群密钥协商协议,其基本思想是将可否认认证引入到群密钥协商协议中.本文所采用的方法是在一个无认证的群密钥协商协议(DB-GKA协议)的基本上,利用零知识认证方案构建可否认的群密钥协商协议.在不改变原有协议安全性的前提下,通过成功地构造一个模拟者S来证明了我们的协议满足可否认性,同时,利用分叉引理显示我们的协议满足认证性.相比于以往的协议,我们的协议在计算效率虽无明显优势,但是我们协议只需要两个轮次即可完成,这在通信效率上有了很大的提高.
The denied group key agreement protocol means that two or more participants negotiate to obtain a shared session key through an open common channel and use the session key to establish a secure and confidential channel. Admissibility makes it impossible for a copy of the communication generated during the negotiation to prove that any participant in a protocol has been involved in the negotiation.It is due to a series of features of the protocol that denied the existence of a broad group of key agreement protocols for privacy protection Applications such as financial negotiations in the Internet, etc. The purpose of this paper is to study how to construct a secure and efficient denial of group key agreement protocol, the basic idea of which is to introduce denial authentication into the group key agreement protocol.In this paper, The method is based on a non-certified group key agreement protocol (DB-GKA protocol), the use of zero-knowledge authentication scheme to build a denial of the group key agreement protocol without changing the original protocol security under the premise of We successfully constructed a simulator S to prove that our protocol satisfies the denial, and at the same time, we use the bifurcation to show that our protocol satisfies the authenticity. In the previous agreement, our agreement in computational efficiency, although no obvious advantages, but the agreement we just need to complete two rounds, it has been greatly improved in the communication efficiency.