Anonymous Authentication Scheme Based on Smart Card and Biometrics in the Electronic Medical Environment

With the existing anonymous authentication schemes based on biometrics, the user and the server can create the same session key after mutual authentication. If the anonymous authentication scheme is applied in the electronic medical environment, it is also necessary to consider that the patient may access multiple hospital servers. Based on three factors of smart card, random number and biometrics, an anonymous authentication scheme in the electronic medical environment is proposed. In order to reduce the burden of the medical registration and certification center(HC), in the proposed anonymous authentication scheme, the patient only needs to register with HC once, then he/she can apply for visiting each hospital that has joined the medical servers. Security analysis shows that the proposed scheme has anonymity and dual authentication, and can resist various types of attacks, such as insider attack, modification attack, replay attack and smart card loss attack. Efficiency analysis shows that the calculation cost of the proposed scheme in the registration and login phase is lower, and it is slightly higher than Lei's scheme and Khan et al's scheme in the authentication phase. The proposed scheme can not only resist various types of attacks, but also support dual authentication and multi-server environment. With a little modification, the proposed scheme can also be used to other application scenarios requiring anonymous authentication.     

Attack on an Efficient Certificateless Aggregate Signature without Pairing

A Certificateless Aggregate Signature(CLAS) scheme was proposed by Qu and Mu recently, which was published in "Int J. Electronic Security and Digital Forensics, 2018, 10(2)". They used discrete logarithm to ensure the scheme's security. However,we show by formulating an attack that their CLAS scheme cannot defend against Type I adversary. Furthermore, we point out an error that exists in the signature simulation of their security proof.After that we give a correct signature simulation for the security proof. Finally, to resist the Type I attack, we present two methods for improving Qu et al's CLAS scheme. Moreover, the second improving method can elevate the trust level of Qu et al's CLAS scheme to the highest trust level: Level 3.     

两类无证书聚合签名方案的分析与改进

基于双线性对提出的无证书聚合签名方案存在安全缺陷和计算效率低的问题。通过对现有两个无证书聚合签名方案的安全性进行分析,指出了第一个方案的聚合签名验证等式存在错误,并且证明了两个方案无法抵抗TypeⅡ的伪造性攻击。最后,给出了一个基于RSA的无证书聚合签名方案,通过RSA问题和DL问题证明了该方案的不可伪造性,与同类方案相比,该方案的效率和安全性更高,实用性更强。     

Cryptanalysis of a Completely Anonymous Multi-recipient Signcryption Scheme with Public Verification

Anonymity is a very important security objective in network communications.Recently,Pang et al.proposed a novel multirecipient signcryption scheme with complete anonymity and claimed that the new concrete scheme was strong existential unforgeability under selective multi-ID,chosen message attack.Unfortunately,by giving concrete attacks,named " inside attack" and " outside attack" respectively,we indicate that Pang et al.’s scheme is not secure in their security model.     

两种无证书聚合签名方案的安全性分析及改进

大部分的聚合签名方案存在安全性缺陷和计算效率偏低的问题。通过对两种无证书聚合签名方案进行安全性分析,发现两种方案分别无法抵抗Type I和TypeⅡ的伪造性攻击。针对此类问题,提出了一个改进方案。该方案在签名过程中改变了参数的组合方式,在聚合签名验证中加强了对主密钥和公钥的约束。在计算性Diffie-Hellman困难问题假设下,证明了方案在适应性选择消息攻击下具有不可伪造性。效率分析表明,方案在签名与验证过程中只需要4个双线性对运算,签名的长度是固定的,与同类安全的无证书聚合签名方案相比,改进的方案效率更高。     

基于圆特性的身份认证与密钥协商

有的几何认证方案采用"欧氏空间直线"等简单几何结构,使方案的安全性较低;有的虽然采用了复杂的"n维空间圆"结构,但由于登录消息太简单,也降低了安全性.本文设计了一个几何认证与密钥协商方案,它基于"n维空间圆上(n＋1)个点可以唯一重构该圆"的n维空间圆构造原理,还采用了多变量的单向散列函数来计算登录消息,加强了用户登录消息的安全性,使方案能抵抗口令猜测、重放、窃听与离线消息分析攻击;并且采用基于计算观点的正确认证协议形式化证明方法—Bellare-Rogaway模型,证明了本文身份认证与密钥协商协议是安全的.     

Improvement of Identity-Based Threshold Proxy Signature Scheme with Known Signers

0 IntroductionIdentity-based (ID-based) cryptography[1]is rapidly emer-gingin recent years .The concept of the proxy signature scheme was first in-troduced by Mamboet al[2]in 1996 .The concept of thresholdproxy signature was proposed[3 ,4]. Apractical and secure (t,n) threshold proxy signature scheme should satisfy the secre-cy,the proxy protected,the unforgeability,the non-repudia-tion,the ti me constraint ,andthe known signers[5].In 2006 , Baoet al[6]proposed an ID-based thresholdproxy si…     

对无证书部分盲签名方案的分析与改进

目的 研究了几个无证书的部分盲签名方案,对其中的一个签名方案分析发现其存在严重的安全缺陷,并对出现伪造攻击的原因进行分析.方法 在签名阶段加入公共信息,并在签名时改变签名的形式.结果与结论 分析表明,改进方案不仅满足部分盲性,而且可以防止对公共信息的更改,并在随机预言模型下证明新方案是不可伪造的.     

基于椭圆曲线的代理签名方案的分析和改进

目的提高基于椭圆曲线的代理签名方案的效率和安全性。方法通过对Hwang等人的代理签名方案及其改进方案的分析和研究,针对其在代理证书绑定及秘密共享传输中存在的问题进行了改进。结果提出一个新的基于椭圆曲线的代理签名方案。结论克服了原方案的不足,实现了普通信道传输秘密,提高了其安全性。     

Secure Order-Specified Multisignature Scheme Based on DSA

0 IntroductionAmultisignature scheme is useful in the case thatplural signers generate a signaturefor a single mes-sage. Many multisignature schemes have been pro-posed[1-7]upto date.These schemes can be classifiedintotwo types by the basicintractable problemassumption aswell as single signature schemes ,i .e.discrete logarithmproblem(DLP) based schemes and RSA problem basedschemes .In an order-specified scheme the message and sig-ning order must be guaranteed. Mitomi and Miyaji[6]proposed…     

对一个无证书部分盲签名方案的分析与改进

对汤鹏志等提出的一种无证书部分盲签名方案进行了密码分析,指出方案中签名请求者可以非法修改协商信息.为了有效抵抗篡改协商信息攻击,提出了一种改进的无证书部分盲签名方案.在随机预言机模型下证明了改进方案对无证书密码体制的两类敌手的自适应选择消息和身份攻击是存在性不可伪造的,其安全性可以归约为k-CAA问题和ICDH问题.     

Comment Fail-Stop Blind Signature Scheme Design Based on Pairings

Fail-stop signature schemes provide security for a signer against forgeries of an enemy with unlimited computational power by enabling the signer to provide a proof of forgery when a forgery happens. Chang et al proposed a robust fail-stop blind signature scheme based on bilinear pairings. However, in this paper, it will be found that there are several mistakes in Chang et al＇s fail-stop blind signature scheme. Moreover, it will be pointed out that this scheme doesn＇t meet the property of a fail-stop signature： unconditionally secure for a signer. In Chang et al＇s scheme, a forger can forge a valid signature that can＇t be proved by a signer using the ＂proof of forgery＂. The scheme also doesn＇t possess the unlinkability property of a blind signature.     

一个具有完备前向安全性的基于口令认证密钥协商方案

在基于网络的分布式环境中,基于口令的认证密钥协商方案是一项基本的安全防护机制.对一个已有的基于口令的认证密钥协商方案[Chen T H,Hsiang H C,Shih W K.Securityenhancement on an improvement on two remote user authentication schemes using smart cards.Future Generation Computer Systems,2011,27(4):337-380]做了安全分析,指出其易受离线口令猜测攻击,并且不具备完备的前向安全性.在此基础上,提出了一个安全性增强的远程口令认证密钥协商方案.所提出的方案继承了已有方案的优良性质,能够抵抗离线口令猜测攻击,并且具有完备的前向安全性.经过安全分析,论证了所提出的方案具有强安全性,适合于在分布式环境中对用户和服务器提供双向认证和密钥协商.     

改进的随机化部分盲签名方案

对张建中等提出的基于双线性对的随机化部分盲签名方案进行了安全性分析,发现方案不能抵抗篡改公共信息攻击.为此,提出了一个改进方案.分析结果表明,改进方案在满足不可伪造性、不可追踪性的同时,能够有效防止恶意的签名请求者非法修改事先协商的公共信息,保护签名者的合法权益.     

改进的具有PFS特性的口令认证密钥协商方案

讨论了具有完备前向安全性(perfect forward secrecy, PFS)的基于智能卡的远程用户口令认证密钥协商方案,指出该方案无法实现所声称的在非抗窜扰智能卡假设下抗离线口令猜测攻击,对密钥泄露仿冒攻击是脆弱的,并且存在时钟同步问题,不适于分布式网络应用。给出了一个改进方案,用随机数代替时间戳来实现消息的新鲜性,对其进行了安全性和效率分析。分析结果表明,改进方案弥补了原方案的安全缺陷,保持了较高的效率,适于分布式网络应用环境。     

一种扩展应用边界安全设备认证能力的方法

为了保护内部网络的安全,必须设置应用边界安全设备.本文采取双服务器认证的方式,提出了一种扩展应用边界安全设备的认证方法,解决了一般的应用边界安全设备(如Socksv5服务器)使用用户名/口令字认证易受被动攻击等问题.新提出的用户名/口令字认证方式在安全性上比原有的方式具有更高的抗攻击的能力,而且用户还能自由地更改应用边界安全设备上自己的口令字.实验结果表明,效率上与原有的用户名/口令字认证方式基本保持一致.     

高效的和可证明安全的无证书部分盲签名方案

为了提高盲签名的签名效率和安全性,学者们提出了多种部分盲签名方案。对其中的两种签名方案分析发现,都存在严重的安全缺陷,其中一种方案存在公钥替换攻击,而另一种方案中不诚实的签名请求者可任意篡改公共协商信息。针对这些安全缺陷,提出了一种新的无证书部分盲签名方案,改进存在的安全缺陷。分析表明,新方案不仅改进了已有方案的安全缺陷,且计算性能更优。     

代理可转换认证加密方案的改进

基于代理签名与可转换认证加密方案,任等(2005)提出了一种代理可转换认证加密和门限代理签名方案.在此指出了他们的方案是不安全的,原始签名人能够对任意的消息伪造有效的代理可转换认证加密签名.进一步,给出了改进方案以弥补他们方案的安全性缺陷.     

混沌加密系统的保密性能

从混沌同步对参数失配敏感性的特点出发,探讨了基于自然混沌系统同步分解的混沌保密通信系统的保密性能,指出基于低维混沌系统的通信系统不具有高保密性,容易受自适应同步控制的攻击,针对这一缺陷,对一类基于离散时间混沌噪声发生器的混沌加密方法进行了研究,其加密器与解密器之间对参数匹配误差敏感性的特点能防止自适应同步控制的攻击,且实现简单,加密性能易于控制,均优于基于低维混沌系统同步分解的加密方法。     

一个无证书部分盲签名方案的分析与改进

通过对何俊杰等提出的一个无证书部分盲签名方案进行安全性分析,发现方案存在公共信息被用户非法篡改的问题.为了保证公共信息的不被篡改,提出了一种基于k-CAA问题和ICDH问题改进的无证书部分盲签名方案.随后对协议的正确性、部分盲性、安全性进行分析,且在随机预言机模型下证明了新方案对两类攻击者的适应性选择消息攻击是存在性不可伪造的.