Multi-proxy Signature Scheme Research Articles

Multi-proxy Signature Scheme Using Five-qubit Entangled State Based on Controlled Quantum Teleportation

With the upgrading of communication technology and the rapid development of quantum computing, the classical digital signature schemes are faced with unprecedented challenges, so the research on quantum digital signature is imperative. In this paper, we propose a multi-proxy signature scheme based on controlled quantum teleportation of five-qubit entangled state. In this scheme, quantum fourier transform is used as an encryption method to encrypt message, which improves the quantum efficiency compared with the quantum one-time pad. The five-qubit maximally entangled state which is qubit threshold quantum error correction required is used as the quantum channel to ensure the stability of the scheme. Security analysis shows that our scheme is unforgeable and undeniable, and it can resist the intercept-resend attack.

Forward secure certificateless proxy multi-signature scheme

In order to deal with key exposure problem, we introduce forward secure technique into certificateless proxy multi-signature scheme, and give the formal definition and security model of forward secure certificateless proxy multi-signature. Furthermore, we present a construction of forward secure certificateless proxy multi-signature scheme. Based on the difficulty of computational Diffie-Hellman problem, the proposed scheme is existentially unforgeable against adaptively chosen-message attacks and chosen-warrant attacks in the random oracle model. The proposed scheme does not use bilinear pairs in the key update and generation proxy signature phases, and updated proxy key is easy, thus it is more suitable for mobile environments. Our scheme has effectively dealt with the key exposure problem and certificate management problem.

Forward secure certificateless proxy multi-signature scheme

In order to deal with key exposure problem, we introduce forward secure technique into certificateless proxy multi-signature scheme, and give the formal definition and security model of forward secure certificateless proxy multi-signature. Furthermore, we present a construction of forward secure certificateless proxy multi-signature scheme. Based on the difficulty of computational Diffie-Hellman problem, the proposed scheme is existentially unforgeable against adaptively chosen-message attacks and chosen-warrant attacks in the random oracle model. The proposed scheme does not use bilinear pairs in the key update and generation proxy signature phases, and updated proxy key is easy, thus it is more suitable for mobile environments. Our scheme has effectively dealt with the key exposure problem and certificate management problem.

Comments on the “Efficient quantum multi-proxy signature”

Recently, a novel quantum multi-proxy signature scheme was proposed by Qin et al. It has flexible proxy delegation and high efficiency. Unfortunately, it is not secure against proxy attacks and forgery attack. In this paper, first, the proxy attacks for the quantum proxy signature scheme are introduced. We demonstrate that every proxy signer can delegate the proxy signing power to a malicious arbitrator, who can sign any message on behalf of all the proxy signers. At the same time, the original signer can also impersonate the proxy signer to generate a quantum proxy signature without being detected. The forgery attacks may also cause some other serious security drawbacks for the quantum proxy signature. Second, the forgery under chosen-signature attack is introduced. We demonstrate that Qin et al.’s quantum multi-proxy signature cannot resist against the signature receiver’s forgery under chosen-signature attack. The proposed proxy attacks and the forgery under chosen-signature attack can be used as the security analysis tools, which are useful for analyzing and improving the security of the quantum proxy signatures. At last, an improved quantum multi-proxy signature scheme was proposed. The improved scheme is secure against the original signer’s proxy attack and the forgery under chosen-signature attack. Its security against the proxy signer’s proxy attack depends on the credibility of the arbitrator.

Analysis of efficient quantum multi-proxy signature

An efficient quantum multi-proxy signature scheme was proposed recently, in which the original signatory Alice distributed her authority to several proxy signatories, and then each proxy signatory can sign the message for her alone. In this work, we give a cryptanalysis on this scheme and then point out an unnoticed problem that the proxy signatory must send the signed message to the verifier when he signs it, which is in conflict with the requirement of digital signatures. Furthermore, this problem will give a good chance for an unreliable proxy signatory to deny his signature on the message. Finally, an improved version is presented, which is more economical and practical with current technology compared with the original scheme.

An efficient self-certified multi-proxy signature scheme based on elliptic curve discrete logarithm problem

Multi-proxy signature schemes (MPSS) allow n proxy signers to generate a valid signature on behalf of the original signer. A new efficient self-certified MPSS with message recovery based on the Elliptic Curve Discrete Logarithm Problem (i.e., ECDLP) is proposed in this paper. A rationale for proposing a new scheme is to improve the verification process performance by combining the verification process with message recovery in one single stage (i.e., simultaneously). The security and performance analysis shows, the new scheme has many advantages over the traditional MPS schemes. These benefits include decreasing costs (i.e., certificate sizes, consumption time, and bandwidth requirements) and increasing speed.

Efficient quantum multi-proxy signature

An efficient quantum multi-proxy signature scheme is proposed, in which the original signatory Alice distributes her authority to several proxy signatories, and then each proxy signatory can sign the message for Alice alone. To sign multiple messages, Alice only needs to perform the initializing phase once, and the proxy signatories can use their particles repeatedly. Compared to the existing schemes, our scheme is more efficient in practice.

Batch quantum multi-proxy signature

A batch quantum multi-proxy signature scheme is proposed, in which the original signatory distributes his signing right to multiple proxy signatories, and these proxy signatories can sign multiple messages. The proxy signatories generate some single particles, and the original signatory uses the quantum-controlled-not to transmit the signing information to these single particles. Then the proxy signatories measure these single particles to generate the signature, and the arbitrator uses the comparison of quantum states to verify the signature. Compared to the existing schemes, the main merit of our scheme is that multiple quantum messages can be signed. So the signing efficiency will be increased greatly.

A formal construction of certificateless proxy multi-signature scheme

Proxy multi-signature is a scheme that allows a proxy signer to sign messages on behalf of a group of original signers. To our best knowledge, most of the existing proxy multi-signature schemes are proposed in public key infrastructure or identity-based setting. However, owing to avoiding the inherent escrow problem of identity-based cryptography and yet not requiring certificates to guarantee the authenticity of public keys, certificateless public key cryptography has become an attractive paradigm on which many cryptographical primitives are based. In this paper, a generic construction and a formal security model of certificateless proxy multi-signature CLPMS is defined. A concrete CLPMS scheme is also proposed, which is proven to be existentially unforgeable against adaptively chosen warrant attacks and chosen message and identity attacks in the random oracle model under the computational Diffie-Hellman assumption.

Secure and Efficient Multi‐proxy Signature Scheme in the Standard Model

Multi-proxy signature is a variant of proxy signature, which allows that a delegator may delegate his signing rights to many proxy signers. Compared with proxy signature, multi-proxy signature can effectively prevent that some of proxy signers abuse signing rights. In this paper, we propose an efficient multi-proxy signature scheme in the standard model, which is based on the Waters’ signature scheme. Compared with other multi-proxy signature schemes in the standard model, the proposed scheme further reduces the amount of computations and communications.

Secure and Efficient Identity-based Proxy Multi-signature Using Cubic Residues

The term ＂proxy multi-signature＂ refers to the situation in which a proxy signer is authorized to sign a message on behalf of a group of original signers. Combined with identity-based cryptography, we proposed an efficient identity-based proxy multi-signature scheme using cubic residues without bilinear pairing. Our scheme is secure against existential forgery on adaptive chosen-message and identity attacks under the hardness of integer factorization assumption. Compared with elliptic curve or bilinear pairing, the integer factorization assumption is more reliable and easier to use because it has been developed 2500 years ago. Furthermore, our scheme is more efficient than previous schemes based on bilinear pairing.

An efficient certificateless multi-proxy signature scheme without pairing

In this paper, we propose the first certificateless multi-proxy signature scheme without pairing. We show our scheme is particularly suitable for practical applications with severely constrained resources due to significant reduction in costs of computation and storage and our scheme is secure against both of the Type I and the Type II adversaries.

Provable Secure Multi-Proxy Signature Scheme without Bilinear Maps

Multi-proxy signature (MPS) allows an original signer to authorize a group of proxy signers as his proxy agent to sign co-operatively a message. As per the literature, the relative computation cost of a pairing is approximately more than ten times of the scalar multiplication over elliptic curve group which indicates that pairing is a very expensive operation. Moreover the map-to-point function is also very expensive. Therefore, we propose a new MPS scheme without pairings having general crypto-graphic hash function after formalizing a security model.Our proposal is provable secure and much efficient than previously proposed schemes in practice.

A New Quantum Proxy Multi-signature Scheme Using Maximally Entangled Seven-Qubit States

In this paper, we propose a new secure quantum proxy multi-signature scheme using seven-qubit entangled quantum state as quantum channels, which may have applications in e-payment system, e-government, e-business, etc. This scheme is based on controlled quantum teleportation. The scheme uses the physical characteristics of quantum mechanics to guarantee its anonymity, verifiability, traceability, unforgetability and undeniability.

Notes on Proxy Signcryption and Multi-proxy Signature Schemes

Proxy signcrytipn scheme allows an original signer to dele- gate his signing power to a proxy such that the latter can signcrypt a message on behalf of the former. Recently, Lin et al. [10, 11] proposed a proxy signcryption with CCA and CMA security. Jin and Wen et al. [8, 12, 13] proposed a multi-proxy signature scheme in certificate-less setting. In this work, we indicate that the Lin et al.'s proxy signcryption scheme does not hold the security of indistinguishability against adaptive chosen-ciphertext attacks and existential unforgeability against adaptive chosen-message attacks. Also, we show that the Jin-Wen's certificateless multi-proxy signature scheme does not hold the security of existential unforgeability against adaptive chosen-message attacks.

Cryptanalysis and Improvement of a Certificateless Multi-proxy Signature Scheme

Certificateless cryptography is a new type of public key cryptography, which removes the certificate management problem in traditional public key cryptography and the key escrow problem in identity...

Provably Secure Proxy Multi-Signature Scheme Based on ECC

The elliptic curve cryptosystem (ECC) achieves the security level equivalent to that of digital signature algorithm (DSA), but has a lower computational cost and a smaller key size than the DSA. Till now so many proxy multi-signature schemes based on ECC without pairings have been proposed. To the best of our knowledge, none of them are provable secure. Having motivated, we first define a formal security model and then propose a provable secure proxy multi-signature scheme based on ECC without pairings. Our proposed scheme can play a crucial role in application to distributed systems, grid computing, mobile agent environment etc. DOI: http://dx.doi.org/10.5755/j01.itc.43.2.5377

Proxy-Protected Proxy Multi-Signature Based on Elliptic Curve

In this work, we propose a proxy-protected proxy multi-signature scheme based on EllipticCurve Digital Signature Algorithm (ECDSA), which aims at providing data authenticity,integrity, and non-repudiation to satisfy the basic properties of partial delegation proxy signaturedescribed by Mambo et al. as well as strong proxy signature properties defined byLee et. al. The proposed signing/verifying scheme combines the advantages of proxyprotectedsignature and multi-signature scheme. The security of the proposed schemes isbased on the difficulty of breaking the elliptic curve discrete logarithm problem (ECDLP).The scheme proposed is faster and secure than the multi-signature based on factoring ordiscrete logarithm problem (DLP). The final multi-signature of a message can be verifiedindividually for each signer or collectively for a subgroup or entire group as well. Finally,the proposed proxy-protected proxy multi-signature schemes can be used in E-commerceand E-government application, which can be implemented using low power and small processingdevices.

Security Analysis and Implementation of an Improved Cch2 Proxy Multi-Signature Scheme

Many of the signature schemes are proposed in which the t out of n threshold schemes are deployed; but they still lack the property of security. In this paper, we have discussed implementation of improved CCH1 and improved CCH2 proxy multi-signature scheme based on elliptic curve cryptosystem. We have represented time complexity, space complexity and computational overhead of improved CCH1 and CCH2 proxy multi-signature schemes. We have presented cryptanalysis of improved CCH2 proxy multi-signature scheme and showed that improved CCH2 scheme is suffered from various attacks i.e. forgery attack and framing attack.

Independent verification of proxy multi-signature scheme

Privacy has become one of the most important human rights of the modern age. To our knowledge, in order to verify the validity of the proxy multi-signature, the verifier needs to get all the original signers' public keys together. Obviously, the verification would leak the relationships between the proxy signer and the original signers. In this paper, we propose a special secure proxy multi-signature scheme which can be used in the scene: the proxy signer hopes to make the verifier verify the signature with only the special original signers' public keys while keeping other delegations secret. After the proxy signer finished a proxy multi-signature, others can verify it using the public keys of the special original signers, rather than collecting all the original signers' public keys. We call the scheme the independent verification of proxy multi-signature IVPMS scheme.