An Improved ID-based Proxy Signature Scheme Based on Elliptic Curve Cryptography (original) (raw)
Related papers
2018
Digital signature is one of the most important cryptographic primitive and has many practical applications in the real world. In many signature schemes, messages are to be transmitted together with signature and thus these schemes requires a large communicational cost for which they may be cannot efficiently used in some resource constrained devices such as WSNs, Mobile phones etc., where the less computation and low band width for communication are of great concern. In this paper, we design and analyze a new signature scheme with message recovery in the Identity based setting using bilinear pairings over elliptic curves. We discuss the proof of correctness and the security of the proposed scheme. Finally, we compare our scheme with the related schemes in terms of computational and communicational point of view.
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 .
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.
Improved Proxy Signature Scheme without Bilinear Pairings
Proxy signature is an active research area in cryptography. In order to save the running time and the size of the signature, recently a provable secure proxy signature scheme without bilinear pairings has been proposed which is based on elliptic curve discrete log problem (ECDLP). In this paper, we point out some forgery attacks and security issues on this scheme. Furthermore, we also improve the scheme to make it secure against these forgeries. Our scheme is as efficient as previous proposed scheme.
Secure and efficient identity-based proxy signature scheme with message recovery
2020
Digital signature with proxy delegation, which is a secure ownership enforcement tool, allows an original signer to delegate signature rights to a third party called proxy, so that the proxy can sign messages on behalf of the original signer. In today’s modern society, many applications use this mechanism. Several types of delegations are quite prevalent and the delegation of signing authority is one of them. In a traditional digital signature scheme, signer transmits signature along with message for verification, which leads to additional communication, computation cost and requires extra bandwidth. To resolve these issues, in this paper, we present an efficient ID-based proxy signature scheme with message recovery using bilinear pairings. Because of the message recovery feature, the proxy signer need not send the message to the verifier, so that the proposed scheme reduces the bandwidth requirement and communication cost. Our proposed scheme is proven secure against existential fo...
Efficient ID-Based Multi-proxy Signature Scheme from Bilinear Pairing Based on k-plus Problem
Integrated Computing …, 2011
Proxy signatures are efficient alternatives to delegate the signing rights. In a proxy signature scheme, the original signer can delegate its signing rights to any other party, to make signature on its behalf. In a multi-proxy signature scheme, the original signer delegates its signing rights to a group of persons called proxy groups. With the exploit of bilinear pairing over elliptic curves, several ID-based multi-proxy signature schemes have been developed till now . In this paper, we have proposed an ID-based multi-proxy signature, based on 'k-plus problem'. The proposed scheme is secure under the INV-CDHP assumption. Moreover, our scheme is computationally more efficient than the schemes and assure all the security requirements of a proxy signature, given in .
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.
Proxy-Protected Proxy Multi-Signature Based on Elliptic Curve
International Journal of Informatics and Communication Technology (IJ-ICT)
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, wh...
Certificate less public key cryptography is a design that is secure against key escrow issue and remove loopholes of ID based cryptography. Lots of work has been done on CL –DS yet they depend on bilinear pairing that required more time to perform pairing operations. Bilinear pairing is executed with super-singular EC group which is tedious. In this paper we propose a pairing free ID based Certificate Less Digital Signature (CL-DS) scheme utilizing elliptic curve cryptography, which maintain a strategic distance from tedious operations required in bilinear matching. We improve the security of the previously proposed scheme with less computation time with time stamp.
A secure ID-based signcryption scheme based on elliptic curve cryptography
International Journal of Computational Intelligence Studies, 2017
Signcryption is a cryptographic primitive which at the same time give both the capacity of digital signature and public key encryption in a single logical step. Identity based cryptography is a distinct option for the traditional certificate based cryptosystem. Its principal thought is that every client utilises his identity information as his public key. Elliptic curve cryptosystem (ECC) have new received consistent attention because of their higher security per bit as compare to other cryptosystem. This paper presents a new identity based signcryption based on elliptic curve cryptography. Its security is dependent on elliptic curve discrete logarithm problem (ECDLP) and elliptic curve Diffie-Hellman problem (ECDHP). The proposed scheme can be very useful in low-end resource devices such as mobile communication, mobile banking, personal digital assistant (PDA) and internet of things (IoT).