Provable Secure and Efficient Proxy Signature Scheme without Bilinear Pairings

2013 
There are two major problems in the existing proxy signature schemes.Firstly,the existing proxy signature schemes are not proved for their security in the intact provable security model for proxy signature.Secondly,some proxy signature schemes which have security reduction to CDHP or other problems are based on bilinear pairing operation,but bilinear pairing operation needs much time,so the schemes have low computational efficiency.In this paper,we show a new proxy signature scheme based on the EDL signature scheme—Proxy-EDL signature scheme.The new scheme is an extension of the EDL signature scheme,which is not based on bilinear pairing operation,so the new scheme has high computational efficiency.And the new scheme is proved to have the existential proxy signature unforgerability under an adaptive chosen message attack in the provable security model for proxy signature,which has a security reduction to CDHP.Comparing with other existing proxy signature schemes,the new scheme is more efficient and secure.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    0
    Citations
    NaN
    KQI
    []