改进的Neuman-Stubblebine协议及其PCL证明  

Improved Neuman-Strubblebine protocol and PCL proof

作　　者：李学峰[1] LI Xuefeng(Qinghai Radio & Television University, Xining 810008, China)

机构地区：[1]青海广播电视大学,青海西宁810008

出　　处：《青海大学学报（自然科学版）》2018年第6期46-51,共6页Journal of Qinghai University(Natural Science)

基　　金：青海省社会科学规划项目(16034)

摘　　要：针对THNS协议属性不满足PCL认证性缺陷问题,提出RNS协议。该协议将发起者产生的随机数、身份和预期接收者的身份用相关密钥进行加密。在PCL证明体系中,该协议满足机密性和认证性。通过消息数、加解密次数等安全性能分析表明:RNS协议比THNS和NS协议更具安全性,同时能够抵御平行攻击和悖论攻击。In view of the problem that the THNS protocol attribute does not satisfy the PCL authenti-cation flaw,The RNS protocol was put forward.The agreement would be the initiator of the random number generated,the identity and the identity of the receiver was expected to be encrypted with the related key.In the PCL system,the protocol could satisfy the secrecy and authentication.Though the analysis of the security performance of the number of message and the number of encryption and de-cryption,the results show that the RNS protocol is more secure than the other protocol and it can re-sist parallel attacks and paradoxical attacks.

关 键 词：协议组合逻辑 Neuman - Stubblebine协议 机密性 认证性 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]