On the security of an identity based multi-proxy signature scheme (original) (raw)

Provable secure identity-based multi-proxy signature scheme

International Journal of Communication Systems, 2013

Multi-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.

A New Identity-based Proxy Signature Scheme from Bilinear Pairings

2006 2nd International Conference on Information & Communication Technologies, 2006

Proxy signature schemes allow a proxy signer to generate a proxy signature on behalf of an original signer. In this paper we propose an Identity-based proxy signature scheme from bilinear pairings. In comparison with the Xu et al's scheme, our scheme is more efficient in computation and requires fewer pairing operations especially in verification phase.

ID-based multi-proxy multi-signature scheme from bilinear pairing

Proceedings of the 2011 American conference on …, 2011

public key settings are very good alternatives for the certificate based public key settings. Proxy signatures are good tools to delegate the signing capability by original signer to any other parties. The concept of bilinear pairing is very useful in many signature protocols for the ease of computation. Here, we propose an ID-based multi-proxy multi-signature scheme using bilinear pairing and replacing the certificate generation of Li and Chen scheme [5], by delegation generation. Our scheme is more efficient than the multi-proxy multi-signature scheme given by Li and Chen . Moreover, our scheme satisfies all the security requirements of a proxy signature given in .

Identity-Based Proxy Signature from Pairings

A proxy signature scheme allows an entity to delegate its signing capability to another entity (proxy) in such a way that the proxy can sign messages on behalf of the delegator. Proxy signatures have found numerous practical applications such as distributed systems, mobile agent applications, etc. Recently, Xu, Zhang and Feng proposed the first formal models of identity based proxy signature. Unfortunately, their model does not capture the notion of adaptively chosen message and chosen identity attacker in identity based system. In this paper, we redefine the security models of identity based proxy signature to capture the most stringent attacks against adaptively chosen message and chosen identity attacker. We also propose a new provably secure identity basad proxy signature scheme whose security is based on the hardness of Computational Diffie-Hellman problem in the random oracle model.

Identity-based multi-proxy multi-signature scheme provably secure in random oracle model

Transactions on Emerging Telecommunications Technologies, 2013

A multi-proxy multi-signature scheme is a useful extension of the basic proxy signature scheme, which allows a group of original signers to delegate their signing rights to a group of proxy signers. At the best of our knowledge, no formal security model and proof has been formalised for the identity-based multi-proxy multi-signature (IBMPMS) scheme from bilinear pairings so far, whereas due to applications of the IBMPMS scheme in distributed systems, grid computing, mobile agent environment and so on, construction of an efficient and provably secure IBMPMS scheme is desired. In this paper, we propose an IBMPMS scheme from bilinear pairings. We also formalise a security model for the IBMPMS schemes from bilinear pairings, and prove that the proposed scheme is secure against existential forgery on adaptive chosen-message and adaptive chosen-identity attacks in the random oracle model, under the computational Diffie-Hellman assumption. Moreover, the proposed scheme is more efficient in the sense of computation and operation time, with a small signature size than the existing IBMPMS schemes.

An ID-based multi-proxy multi-signature scheme

Computer and Communication Technology ( …

The identity (ID) based public key cryptosystem simplifies the key management and provides moderate security with comparison to the certificate based public key cryptosystem. Many signature schemes have been proposed using the identity of user. Proxy signature scheme enables the original signer to delegate his/her signing capability to a proxy signer. Bilinear pairings are useful in signature protocols for the ease of computation. In this paper, we have proposed an ID-based multi-proxy multi-signature scheme from bilinear pairing, using the schemes of Cao and Cao [2, 3] and Li and Chen [7]. We have also discussed the security properties of our scheme.

Cryptanalysis and Improvement of an Identity-Based Proxy Multi-signature Scheme

2017

A Proxy multi-signature scheme allows an authorized proxy signer to sign on a message on behalf of a group of original signers. Recently Cao and Cao proposed an identity-based proxy signature scheme and claimed that the scheme is provably secure in random oracle model. In this paper we have reviewed the scheme and proven that the scheme is vulnerable to chosen message attack under the defined security model. To prevent this attack, we propose an improvement over existing identity-based signature scheme.

Cryptanalysis and Improvement of Identity-based Proxy Multi-signature scheme

IACR Cryptology ePrint Archive, 2015

Cao-Cao's recently proposed an identity-based proxy signature scheme and claim that the scheme is provably secure in random oracle model. In this paper we have reviewed the scheme and proven that the scheme is vulnerable to chosen message attack under the defined security model. To prevent this attack, we propose an improved version of the scheme. A Proxy multi-signature scheme allows an authorized proxy signer to sign on a message on behalf of a group of original signers.

Cryptanalysis and Improvement of a Certificateless Proxy Signature Scheme from Bilinear Pairings

2007

Multi-proxy signature allows an original signer authorizing a proxy group as his proxy agent and only the cooperation of all proxy signers in the group can create a proxy signature on behalf of the original signer. Recently, Jin and Wen defined a formal model of certificateless multi-proxy signature and proposed a concrete scheme. They claimed that their scheme is provably secure in their security model. Unfortunately, by giving concrete attacks, we show that Jin-Wen's certificateless multi-proxy signature scheme is not secure according to their security model. Possible improvements of their scheme are also suggested to prevent these attacks.

An Efficient Identity based Multi-Proxy Multi-Signcryption Scheme from Bilinear Pairings

International Journal of Computer Applications, 2016

Signcryption is a cryptography primitive that fulfills both the functions of digital signature and encryption and guarantees non-repudiation, confidentiality and integrity in a more efficient way. In this paper, we propose an efficient and secure identity based multi-proxy multi signcryption scheme from bilinear pairings. In this scheme a group of proxy signcrypters could authorize by a group of original signcrypters. Then multi proxy multi signcryption could generate by the cooperation of all signcrypters in the proxy group.