一种远程证明协议转换模型及通用安全协议研究*

在对现有的远程证明技术进行分析研究的基础上,提出了一种远程证明证据传输的通用方法,该方法利用协议转换代理模块将不同的证明信息通过对偶的方式转换为通用的证明信息,并且利用所设计的通信协议进行安全传输。该方法解决了远程证明中不同证明信息传输的通用性问题,并且保障了远程证明信息在传输过程中的机密性和完整性。     

可信网络匿名连接方案

在开放式网络连接环境中,可信网络终端在进行身份证明时不希望暴露自己的身份,本文提出了一种基于环签名的可信网络连接客户端匿名认证方案,引入环管理员机制以保证环成员都是合法的可信网络连接客户端,本方案的安全性基于CDH假设和强单向函数,且参数较短,易于实现.     

可信网络中基于预测控制的行为度量模型

In order to construct the trusted network and realize the trust of network behavior, a new multi-dimensional behavior measurement model based on prediction and control is presented. By using behavior predictive equation, individual similarity function, group similarity function, direct trust assessment function, and generalized predictive control, this model can guarantee the trust of an end user and users in its network. Compared with traditional measurement model, the model considers different characteristics of various networks. The trusted measurement policies established according to different network environments have better adaptability. By constructing trusted group, the threats to trusted group will be reduced greatly. Utilizing trusted group to restrict individuals in network can ensure the fault tolerance of trustworthiness of trusted individuals and group. The simulation shows that this scheme can support behavior measurement more efficiently than traditional ones and the model resists viruses and Trojans more efficiently than older ones.     

基于椭圆曲线的签密方案

签密方案既能够满足数字签名又可以满足公钥加密,且成本远低于“先签名后加密”。针对求解椭圆曲线离散对数问题的困难性,提出基于椭圆曲线的签密方案,并证明了其前向安全性和可公开验证性。相比现有的方案,该方案主要用到了模乘运算,且模指数与模逆运算均为0次。与文献[8]方案相比较,该方案模乘运算少了一次,签密长度少|n|,计算量明显较少,在理论上达到了复杂度的最小值。     

具有强前向安全性的动态门限签名方案

传统密码体制的系统安全性建立在私钥安全的前提下,但是一旦私钥泄露系统将会存在较大的安全隐患。针对这一问题,提出了一种强前向安全的动态门限签名方案,方案基于中国剩余定理,无需可信中心,通过成员之间相互协作产生签名,有效地避免了因引入可信中心所导致的权威欺诈等问题。该方案定期更新成员私钥,解决了私钥泄露带来的安全隐患,同时该方案允许成员加入和退出。安全性分析表明,当前密钥泄露不会对已有签名和未来签名造成影响,因此方案具有前向和后向安全性,满足强前向安全性的要求。效率分析表明,与已有方案相比,该方案具有较高的执行效率。     

一种基于可信平台模块的门限环签名

The conventional ring signature schemes cannot address the scenario where the rank of members of the ring needs to be distinguished, for example, in electronically commerce application. To solve this problem, we presented a Trusted Platform Module (TPM)-based threshold ring signature scheme. Employing a reliable secret Share Distribution Center (SDC), the proposed approach can authenticate the TPM-based identity rank of members of the ring but not track a specific member's identity. A subset including t members with the same identity rank is built. With the signing cooperation of t members of the subset, the ring signature based on Chinese remainder theorem is generated. We proved the anonymity and unforgeability of the proposed scheme and compared it with the threshold ring signature based on Lagrange interpolation polynomial. Our scheme is relatively simpler to calculate.     

一种适用于可信网络客户端的可信度量方案（英文）

The trusted network connection is a hot spot in trusted computing field and the trust measurement and access control technology are used to deal with network security threats in trusted network.But the trusted network connection lacks fine-grained states and real-time measurement support for the client and the authentication mechanism is difficult to apply in the trusted network connection,it is easy to cause the loss of identity privacy.In order to solve the abovedescribed problems,this paper presents a trust measurement scheme suitable for clients in the trusted network,the scheme integrates the following attributes such as authentication mechanism,state measurement,and real-time state measurement and so on,and based on the authentication mechanism and the initial state measurement,the scheme uses the realtime state measurement as the core method to complete the trust measurement for the client.This scheme presented in this paper supports both static and dynamic measurements.Overall,the characteristics of this scheme such as fine granularity,dynamic,real-time state measurement make it possible to make more fine-grained security policy and therefore it overcomes inadequacies existing in the current trusted network connection.     

基于中国剩余定理的区块链投票场景签名方案

电子投票协议的底层密码学技术主要基于盲签名、环签名、代理签名进行实现,然而传统的上述签名算法在应用到区块链时可能会出现依赖中心节点、效率低下等问题。基于中国孙子定理提出了一种适用于区块链投票场景的门限签名方案,通过成员之间协作,生成份额签名并合成签名。签名方法支持节点加入和退出,签名过程无须中心节点参与,提升了方案的可用性;加入了对通信数据的验证功能,同时在通信过程中不暴露密钥信息,保证了数据在区块链不安全通信信道传输时的安全性;算法优化了通信效率,不仅节省了网络带宽资源,同时提升了系统吞吐率。安全性分析表明,攻击难度等价于求解离散对数问题,能够有效抵抗冒名攻击。计算复杂度分析表明,算法计算量较低,能够有效适配到区块链应用场景。     

基于集合覆盖的Wp方法测试集约简方法

为了提高测试效率,提出一种基于集合覆盖的测试集约简方法.该方法对有限状态机(finite state machine,FSM)模型中经典的测试生成算法Wp方法(部分W方法)所生成的测试集进行冗余约简.通过分析Wp方法的特点,找出测试序列之间包含关系的规律,删除冗余的测试用例.理论分析和实验结果表明:该方法能够有效约简测试集,并且不改变故障检测能力.