一种基于椭圆曲线的多重数字签名方案

对基本的椭圆曲线数字签名算法（ECDSA）进行了改进，提出了一种新的基于椭圆曲线的多重数字签名方案．该方案能够允许多个用户按顺序地对一份文件进行签名，最后形成一个群体签名．并提出一种新的签名验证方案，可以有效地防止成员的欺诈行为．签名者可以通过验证操作发现伪签名，同时签名中心可以及时通过签名者提供的失败信息查找原因并进行处理，签名中心还可验证签名者公钥的有效性以防止成员内部的欺诈行为．方案充分利用椭圆曲线密码体制密钥小、速度快等优点，降低了通信成本，因而更具有安全性和实用性．     

一种基于RSA的有序多重数字签名方案

提出了一种基于RSA的有序多重数字签名方案,该方案能够允许多个用户顺序地对一份文件进行签名,最后形成一个群体签名;并提出一种新的签名验证方案,可以有效地防止成员的欺诈行为,因而更具有安全性和实用性.     

基于ECC的移动自组网成员控制方案

基于Pederson分布式密钥产生方案,采用椭圆曲线密码体制提出一个分布式密钥产生协议,该方案高效且能抵制内外恶意节点的攻击,并采用门限数字签名方案给出一个安全的移动自组网的成员控制方案.通过方案的性能和安全性分析得出结论,该成员控制策略非常适合于资源受限的移动自组网.     

一种基于离散对数问题的存根代理盲签名方案

数字签名用来保证原始数据完整性和有效性,一个数字签名方案包括数字签名生成算法和数字签名验证算法.简短地介绍了盲签名、代理签名的基本思想和基本性质,并给出如何通过非对称密码算法的思想来实现这些签名方案,提出并详细介绍了一种基于离散对数问题的有存根的(免责声明)代理盲签名方案,讨论了基于离散对数问题的密码学算法的可能攻击方法,在此基础上给出了协议实现时的一些有益的建议.     

基于椭圆曲线含有效期的离线电子现金系统

为防止电子现金重复花费和数据库记录无限制的膨胀问题，改进了现有的利用椭圆曲线密码系统构造的离线电子现金系统．改进的系统利用了椭圆曲线良好的密码特性，并采用零知识证明方法．在取款协议中采用基于椭圆曲线的部分盲签名方案，使电子现金包含由银行颁布的有效期，超过有效期的电子现金历史记录将被清除，这样减少了通信量和计算量，提高了执行效率．在支付协议中采用并行的椭圆曲线零知识证明，提高了系统的安全性．     

一种高效的基于身份的代理盲签名方案

在代理签名中,原始签名人能将数字签名的权力委托给代理签名人;而在盲签名方案中,签名者不能看到被签消息的内容。签名被接受者得到后,签名者不能追踪签名,结合代理签名与盲签名的优点,利用基于椭圆曲线上的Weil配对（WeilPair—ing）的双线性映射,构造了一个高效的基于身份的代理盲签名方案．分析表明,该方案不仅满足代理盲签名所要求的所有性质,而且其效率也优于已有同类方案．     

广义椭圆曲线数字签名链口令认证方案

一次性口令是身份认证的重要技术。文章构造了一个基于椭圆曲线数字签名链的一次性口令认证和密钥协商方案。该方案使用了具有消息恢复功能、无须求逆的椭圆曲线数字签名算法,椭圆曲线认证密钥协商协议,密钥进化算法和椭圆曲线数字签名链等。方案有以下优点:服务器无需维护口令和验证列表;允许用户自主选择和更改口令,实现了双向认证;无需系统时钟同步和传输时延限制;能够抵抗重放攻击、离线字典攻击、中间人攻击和内部人攻击;具备口令错误敏感性和强安全修复性;生成的会话密钥具有新鲜性、机密性、已知密钥安全性和前向安全性。经对比,该方案具有更好的安全性能,适合强安全性需求的场合。     

基于椭圆曲线的可控代理签名方案的研究

提出了一种具有限制代理签名者行使代理签名权力的新型可控代理签名方案XECLPS，以解决目前的各种代理签名方案所存在的无法实现对代理签名者的代理签名权力进行全面、完整、可靠地控制的问题．同时对这一方案的复杂性和安全性进行了分析．新方案不仅推广和丰富了代理签名的研究成果和应用范围，而且也扩展了椭圆曲线密码体系的功能，为信息安全同题的解决提供了新的密码学方法．     

公开密钥密码算法和密钥共享问题的研究

论述了在RSA公开密钥密码算法下的多重公开密钥密码方案、密钥共享，多重密钥共享的技术，密钥的安全保密是密码系统安全的重要保证，存贮在系统中的所有密钥的安全性取决于主密钥的安全性，研究了分析了密钥的秘密共享的LaGrange插值多项式方案。     

基于椭圆曲线的具有消息恢复的数字签名方案

基于椭圆曲线离散对数问题(ECDLP)和平方剩余问题,本文提出了一种新的具备消息自动恢复特性的数字签名方案,同时对该方案进行了各种安全性分析,得出结论:该方案具有前向安全性,而且在第三方仲裁时无需泄露密钥(即具有零知识特性).     

DESIGN OF A DIGITAL SIGNATURE SCHEME BASED ON FACTORING AND DISCRETE LOGARITHMS

Objective Focusing on the security problem of authentication and confidentiality in the context of computer networks, a digital signature scheme was proposed based on the public key cryptosystem. Methods Firstly,the course of digital signature based on the public key cryptosystem was given. Then, RSA and ELGamal schemes were described respectively. They were the basis of the proposed scheme. Generalized ELGamal type signature schemes were listed. After comparing with each other, one scheme, whose Signature equation was (m r)x=j s modФ(p) , was adopted in the designing. Results Based on two well-known cryptographic assumptions, the factorization and the discrete logarithms, a digital signature scheme was presented. It must be required that s“ was not equal to p‘q“ in the signing procedure, because attackers could forge the signatures with high probabilities if the discrete logarithms modulo a large prime were solvable. The variable public key “e“ is used instead of the invariable parameter “3“ in Ham‘s signature scheme to enhance the security. One generalized ELGamal type scheme made the proposed scheme escape one multiplicative inverse operation in the signing procedure and one modular exponentiation in the verification procedure.Conclusion The presented scheme obtains the security that Harn‘s scheme was originally claimed. It is secure if the factorization and the discrete logarithms are simultaneously unsolvable.     

On constructing certificateless proxy signature from certificateless signature

In proxy signature schemes, an original signer A delegates its signing capability to a proxy signer B, in such a way that B can sign message on behalf of A.The recipient of the final message verifies at the same time that B computes the signature and that A has delegated its signing capability to B.Recently many identity-based(ID-based) proxy signature schemes have been proposed, however, the problem of key escrow is inherent in this setting.Certificateless cryptography can overcome the key escrow problem.In this paper, we present a general security model for certificateless proxy signature scheme.Then, we give a method to construct a secure certificateless proxy scheme from a secure certificateless signature scheme, and prove that the security of the construction can be reduced to the security of the original certificateless signature scheme.     

指纹图像在数字签名中的应用

为了减少证书管理的开销，基于身份的公钥密码体制在基于证书的公钥密码体制诞生后出现，并且越来越受到关注。针对椭圆曲线上的离散对数分离难问题，利用生物特征信息产生密钥数据，提出了一种基于生物特征身份的签名方案，确保信息传输的完整性和真实性，并对其安全性进行了分析。     

Provably Secure Short Proxy Signature Scheme from Bilinear Maps

An enhanced formal model of security for proxy signature schemes is presented and a provably secure short proxy signature scheme is proposed from bilinear maps. The proposed proxy signature scheme is based on two short secure signature schemes. One is used for delegating the signing rights and computing the standard signature; the other is used for computing proxy signature. Finally, a security proof of the proposed proxy signature scheme is showed by reducing tightly the security of the proposed proxy signature scheme to the security of the two basic signature schemes. The proposed proxy signature scheme has the shortest ordinary signatures and proxy signatures. Moreover, the proxy signature generation needs no pairing operation and verification needs just two pairing operation.     

Proofs of Security for Improved Rabin Signature Scheme

Introduction Digitalsignatureistheelectronicversionof handwrittensignaturefordigitaldocuments.A digitalsignatureschemeallowsasignertotrans-formanarbitrarymessageintoasignedmessage,suchthatanyonecancheckthevalidityofthe signedmessageusingthesigner'spublickey,but onlythesignerisabletoproducesignedmessages.RSAdigitalsignature[1]isaverypopulardigi-talsignaturescheme,whosesecurityisbasedon theRSAassumption:“foragiveny∈Z*n,itis hardtocomputethemodulare-throotxofysuch thatxe=ymodn”.However,howt…     

基于可控量子隐形传态的代理签名方案

提出了一种量子代理签名方案．基于可控量子隐形传态，采用3粒子纠缠态作为量子信道，不同于经典的基于计算复杂性的代理签名方案，本方案利用量子隐形传态的物理特性来实现签名及验证，具有无条件安全性．     

An Efficient Provable Secure ID-Based Proxy Signature Scheme Based on CDH Assumption

IntroductionMambo, et al.[1]first introduced the conceptof proxy signature. In their scheme, an originalsigner delegates his signing right to a proxy signerin such a way that the proxy signer can sign anymessage on behalf of the original signer and theverifier can verify and distinguish proxy signaturefrom original signature. Proxy signature is of greatuse in such a case that a manager needs to autho-rize his secretary to sign documents on behalf ofhimself before his leaving for a vacation. Du…     

Certificateless message recovery signatures providing girault’s level-3 security

A digital signature with message recovery is a signature that the message itself (or partial of the message) is not required to be transmitted together with the signature. It has the advantage of small data size of communication comparing with the traditional digital signatures. In this paper, combining both advantages of the message recovery signatures and the certificateless cryptography, we propose the first certificatelss signature scheme with message recovery. The remarkable feature of our scheme is that it can achieve Girault’s Level-3 security while the conventional certificateless signature scheme only achieves Level-2 security. The security of the scheme is rigorously proved in the random oracle model based on the hardness of the k bilinear Diffie-Hellman inverse (k-BDHI) problem.