Fail-stop Designated Recipient Signature Scheme Based on Elliptic Curve Discrete Logarithm Problem
نویسنده
چکیده
This paper describes a new digital signature called fail-stop designated recipient signature scheme based on elliptic curve discrete logarithm (ECDLP). The scheme allows a signer and an intended recipient to co-operatively provide a proof of forgery if an attacker can successfully forge a signature on a message m. The scheme also provides that the intended recipient is the only entity to verify the resulting signature and capable to prove the validity of signature to any third party. With this property, we show that our new signature scheme is the best alternative to solve certain problems concerning the protection of confidential documents especially those which are personally sensitive (to the owner) and is also applicable for group of recipients to verify a signature jointly (shared verification) in a group oriented environment. The scheme utilizes the inherent advantage of elliptic curve cryptosystem in terms of smaller key size and lower computational overhead to its counterpart public cryptosystems such as RSA and AlGamal. Compared with the Ismail and Yahya scheme [1], we show that our scheme is more efficient in terms of both computation and communication complexity.
منابع مشابه
The new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملAn efficient blind signature scheme based on the elliptic curve discrete logarithm problem
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme ...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملA Stamped Blind Signature Scheme based on Elliptic Curve Discrete Logarithm Problem
Here we present a stamped blind digital signature scheme which is based on elliptic curve discrete logarithm problem and collision-resistant cryptographic hash functions.
متن کاملA New Proxy Blind Signature Scheme based on ECDLP
A proxy blind signature scheme is a special form of blind signature which allows a designated person called proxy signer to sign on behalf of two or more original signers without knowing the content of the message or document. It combines the advantages of proxy signature, blind signature and multi-signature scheme and satisfies the security properties of both proxy and blind signature scheme. ...
متن کامل