ID-based proxy signature scheme with message recovery

Singh, Harendra; Verma, Girraj Kumar

doi:10.1016/j.jss.2011.08.018

Cited by 33 publications

(61 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Padhey and Tiwari [13], claim that they proposed the first certificateless proxy signature with message recovery, whose security is based on ECDLP. They also claim that their signature scheme is secure against existential forgery under adaptive chosen message, ID attacks, and furthermore, it is more efficient than Singh and Verma [19], scheme for practical applications.…”

Section: Introductionmentioning

confidence: 97%

“…In the year 2012, Xie [22], shows that Wu et al's scheme is not secure against proxy warrant revision attack. In the same year, the first identity-based proxy signature scheme with message recovery using bilinear pairing is proposed by Singh and Verma [19]. Tian, Huang and Yang [20], via two concrete attacks showed that Singh's scheme is not secure.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Cryptanalysis and Improvement of a Proxy Signature With Message Recovery Using Self-Certified Public Key

Chande¹,

Lee²

2016

Bulletin of the Korean Mathematical Society

View full text Add to dashboard Cite

Abstract. Combining the concept of self-certified public key and message recovery, Li-Zhang-Zhu (LZZ) gives the proxy signature scheme with message recovery using self-certified public key. The security of the proposed scheme is based on the discrete logarithm problem (DLP) and one-way hash function (OWHF). Their scheme accomplishes the tasks of public key verification, proxy signature verification, and message recovery in a logically single step. In addition, their scheme satisfies all properties of strong proxy signature and does not use secure channel in the communication between the original signer and the proxy signer. In this paper, it is shown that in their signature scheme a malicious signer can cheat the system authority (SA), by obtaining a proxy signature key without the permission of the original signer. At the same time malicious original signer can also cheat the SA, he can also obtain a proxy signature key without the permission of the proxy signer. An improved signature scheme is being proposed, which involves the remedial measures to get rid of security flaws of the LZZ et al.'s. The security and performance analysis shows that the proposed signature scheme is maintaining higher level of security, with little bit of computational complexity.

show abstract

Section: Introductionmentioning

confidence: 97%

Section: Introductionmentioning

confidence: 99%

Cryptanalysis and Improvement of a Proxy Signature With Message Recovery Using Self-Certified Public Key

Chande¹,

Lee²

2016

Bulletin of the Korean Mathematical Society

View full text Add to dashboard Cite

show abstract

“…Accordingly schemes without pairing would be more appropriate to be implemented in power-constrained devices, such as wireless sensor networks, etc. [16]. The proxy signature scheme with message recovery is a digital signature scheme in which the original message of the signature does not need to be transmitted in addition to the proxy signature since it has been appended to the signature and can be recovered according to the verification/message recovery process.…”

Section: Introductionmentioning

confidence: 99%

“…This type of signature is different from a signcryption scheme or authenticated encryption schemes, because in proxy signature with message recovery scheme, the embedded message can be recovered by everyone without the secret information. The purpose of proxy signature scheme with message recovery is to degrade the total length of the original message and the appended signature [16]. Therefore, these are useful in any application where bandwidth is one of the main concerns or small message should be signed.…”

Section: Introductionmentioning

confidence: 99%

“…Therefore, these are useful in any application where bandwidth is one of the main concerns or small message should be signed. Recently, Singh and Verma [16] proposed the first pairing based proxy signature scheme with message recovery and proved that their scheme is provable secure but Tian et.al [17] showed that Singh's scheme isn't secure. Afterwards, Padhay et.al [4] proposed a certificateless proxy signature with message recovery and they could show that their scheme is secure against existential forgery under adaptive chosen message and ID attacks.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A certificate‐based proxy signature with message recovery without bilinear pairing

Mahmoodi

Mohajery

Salmasizadeh

2016

Security Comm Networks

View full text Add to dashboard Cite

Abstract.In this paper, we propose the first provable secure certificate-based proxy signature with message recovery without bilinear pairing. The notion of certificate-based cryptography was initially introduced by Gentry in 2003, in order to simplify certificate management in traditional public key cryptography (PKC) and to solve the key escrow problem in identity-based cryptosystems. To date, a number of certificate-based proxy signature (CBPS) schemes from bilinear pairing have been proposed. Nonetheless, the total computation cost of a pairing is higher than that of scalar multiplication (e.g., over elliptic curve group). Consequently, schemes without pairings would be more appealing in terms of efficiency. According to the available research in this regard, our scheme is the first provable secure CBPS scheme with message recovery which is based on the elliptic curve discrete logarithm problem. We prove the security of the presented scheme against existential forgery under adaptive chosen message and ID attacks in the random oracle model. Moreover, the paper will also show how it would be possible to convert this scheme to the CBPS scheme without message recovery. This scheme has more applications in situations with limited bandwidth and power-constrained devices.

show abstract

Provable secure identity‐based multi‐proxy signature scheme

Sahu

Padhye

2013

Int J Communication

View full text Add to dashboard Cite

SUMMARYMulti-proxy signature is one of the useful primitives of the proxy signature. Till now, only a few schemes of identity-based multi-proxy signature (IBMPS) have been proposed using bilinear pairings, but most of the schemes are insecure or lack a formal security proof. Because of the important application of IBMPS scheme in distributed systems, grid computing, and so on , construction of an efficient and provable-secure IBMPS scheme is desired. In 2005, Li & Chen proposed an IBMPS scheme from bilinear pairings, but their paper lacks a formal model and proof of the security. Further, in 2009, Cao & Cao presented an IBMPS scheme with the first formal security model for it. Unfortunately, their scheme is not secure against the Xiong et al's attack. In this paper, first, we present an IBMPS scheme, then we formalize a security model for the IBMPS schemes and prove that the presented scheme is existential unforgeable against adaptive chosen message and identity attack in the random oracle model under the computational Diffie-Hellman assumption. Also, our scheme is not vulnerable for the Xiong et al's attack. The presented scheme is more efficient in the sense of computation and operation time than the existing IBMPS schemes.

show abstract

ID-based proxy signature scheme with message recovery

Cited by 33 publications

References 3 publications

Cryptanalysis and Improvement of a Proxy Signature With Message Recovery Using Self-Certified Public Key

Cryptanalysis and Improvement of a Proxy Signature With Message Recovery Using Self-Certified Public Key

A certificate‐based proxy signature with message recovery without bilinear pairing

Provable secure identity‐based multi‐proxy signature scheme

Contact Info

Product

Resources

About