Based On Discrete Logarithm Without Certificate Digital Signature

Digital signature is the hotspot in recent years. In Asiacrypt 2003, AL-Riyami and Paterson introduced a new paradigm for public cryptography named Certificateless Public Key Cryptography (CL-PKC). CL-PKC received a great attention after proposed In Certificateless Public Key Cryptography, it removes the necessary of certificate to ensure the authentication of the user's public key in tradition Certificate-Based Public Key Cryptography, and cut down the storage. In addition, the use's private key does not singly generated by the KGC(Key Generation Center) in the Certificateless Public Key Cryptography, but jointly generated by the KGC and the user. That make that only the user know its' private key. It overcomes the inherent key escrow problem in the Identity-Based public key cryptography but inherent the merits. It decreases the expenses in the systems which become more flexible in the low frequencies. In all the available certificateless signature schemes, there are many bilinear paring computations that the efficiency is low.In this paper, we propose a signature schemes base on discrete logarithm problem (DLP) which is provable secure under the random oracle model. We do not use the bilinear pairing, and the efficiency is improved too. Based on the merits of the Certificateless Public Key Cryptography and combine the proxy signature, we give a proxy signature schemes and its' secure is also based on the DLP. And our proxy secrete key use the schnorr short signature, that the efficiency and security will have a great improve.