4 research outputs found
An Efficient Secure Anonymous Proxy Signature Scheme
Proxy signature schemes can be used in many business applications such as
when the original signer is not present to sign important documents. Any proxy
signature scheme has to meet the identifiability, undeniability, verifiability and
unforgeability security requirements. In some conditions, it may be necessary to
protect the proxy signer’s privacy from outsiders or third parties. Recently, several
studies about proxy signature schemes have been conducted but only Yu et al.’
anonymous proxy signature scheme proposed in 2009 attempting to protect the proxy
signer’s privacy from outsiders. They claimed their scheme can make the proxy
signer anonymous. However, based on our research, we determined that this was not
the case and the proxy signer’s privacy was not anonymous. Hence, in this paper,
we propose a new anonymous proxy signature scheme that truly makes the proxy
signer anonymous while making it more secure and efficient when compared with Yu
et al.’s scheme in 2009. Our proxy signature scheme consists of two constructions.
First, we mainly use random numbers and bilinear pairings to attain the anonymous
property in our proxy. Secondly, we increase the security, integrity, and efficiency of
our proxy through modifications
Cryptanalysis and Performance Evaluation of Enhanced Threshold Proxy Signature Scheme Based on RSA for Known Signers
In these days there are plenty of signature schemes such as the threshold proxy signature scheme (Kumar and Verma 2010). The network is a shared medium so that the weakness security attacks such as eavesdropping, replay attack, and modification attack. Thus, we have to establish a common key for encrypting/decrypting our communications over an insecure network. In this scheme, a threshold proxy signature scheme based on RSA, any or more proxy signers can cooperatively generate a proxy signature while or fewer of them cannot do it. The threshold proxy signature scheme uses the RSA cryptosystem to generate the private and the public key of the signers (Rivest et al., 1978). Comparison is done on the basis of time complexity, space complexity, and communication overhead. We compare the performance of four schemes (Hwang et al. (2003), Kuo and Chen (2005), Yong-Jun et al. (2007), and Li et al. (2007), with the performance of a scheme that has been proposed earlier by the authors of this paper. In the proposed scheme, both the combiner and the secret share holder can verify the correctness of the information that they are receiving from each other. Therefore, the enhanced threshold proxy signature scheme is secure and efficient against notorious conspiracy attacks
On the efficiency of nonrepudiable threshold proxy signature scheme with known signers
In the (t, n) proxy signature scheme, the signature signed by the original signer can be signed by t or more proxy signers out of a proxy group of n proxy signers. Recently, Hsu et al. proposed a nonrepudiable threshold proxy signature scheme with known signers. In this article, we shall propose an improvement of Hsu et al.'s scheme that is more efficient in terms of computational complexity and Communication cost. (C) 2003 Elsevier Inc. All rights reserved
On the Efficiency of Nonrepudiable Threshold Proxy Signature Scheme with Known Signers
[[abstract]]In the (t,n) proxy signature scheme, the signature signed by the original signer can be signed by t or more proxy signers out of a proxy group of n proxy signers. Recently, Hsu et al. proposed a nonrepudiable threshold proxy signature scheme with known signers. In this article, we shall propose an improvement of Hsu et al.'s scheme that is more efficient in terms of computational complexity and communication cost