An efficient signcryption scheme with forward secrecy based on elliptic curve (original) (raw)
Related papers
Analysis of an Improved Signcryption Scheme Based on Elliptic Curves with Forward Secrecy
2011
An elliptic curve based signcryption scheme is presented in this paper. This scheme not only provides message confidentiality, nonrepudiation, integrity and un-forgebility but also provides forward secrecy and encrypted message authentication. A judge can verify the sender's signature on signcrypted message without decrypting message and take any help from sender. If the private key of the sender is divulged inattentively, it does not affect the confidentiality of the previous stored messages. Elliptic curves are used for their key size, security and bandwidth advantage .The proposed scheme can be applied to mobile communication environment due to low computational and communication cost.
Cryptanalysis of an efficient signcryption scheme with forward secrecy based on elliptic curve
2008 International Conference on Computer and Electrical Engineering, 2008
The signcryption is a relatively new cryptographic technique that is supposed to fulfill the functionalities of encryption and digital signature in a single logical step. Several signcryption schemes are proposed throughout the years, each of them having its own problems and limitations. In this paper, the security of a recent signcryption scheme, i.e. Hwang et al.'s scheme is analyzed, and it is proved that it involves several security flaws and shortcomings. Several devastating attacks are also introduced to the mentioned scheme whereby it fails all the desired and essential security attributes of a signcryption scheme.
Multimedia Tools and Applications, 2014
The need for Lightweight cryptography is on the rise as transition has been made from wired to wireless network. Wireless systems inherently are insecure and resource (power) constrained, to deal with these constraints, many techniques for symmetric and asymmetric cryptography are defined. One such important developement is Signcryption to achieve message confidentiality, integrity, sender and message authentication, non repudiation, forward secrecy as well as unforgeability,and public verifiability. Since Signcryption combines the signature and encryption therefore the cost is very less in comparison to those schemes based on the signature then encryption. Many signcryption schemes have been proposed based on El-Gamal, RSA and ECC till today. This paper highlights limitations of the existing ECC based schemes using signcryption. These limitations include some missing security aspects as well as high computation power requirement, more communication overhead incurred and large memory requirements. Further it proposes an efficient lightweight signcryption scheme based on HECC which fulfills all the security requirements. The scheme reduced significant amounts of computation, communication costs and Multimed Tools Appl message size as compared to existing signcryption schemes making it the good candidate for environments suffer from the resource limitation problems.
Elliptic Curve Signcryption with Encrypted Message Authentication and Forward Secrecy
2009
This paper presents a comprehensive signcryption scheme based on elliptic curves. In addition to the message confidentiality, nonrepudiation and unforgeability, the proposed scheme achieves forward secrecy and encrypted message authentication needed by firewalls. A judge can resolve disputes by directly verifying the sender's signature on signcrypted messages without help from the sender and without decrypting the message. Firewalls can securely filter signcrypted messages passing through them without having to do full unsigncryption to verify the sender's identity. If the sender's long-term key is compromised, the previous messages signcrypted with that key remain confidential. Elliptic curves are used for their security, key size and bandwidth advantages. The proposed scheme combines these security properties with savings in computational complexity and bandwidth overhead.
An Efficient and Authentication Signcryption Scheme Based on Elliptic Curves
MATEMATIKA, 2019
Signcryption schemes are compact and specially suited for efficiency-critical applications such as smart card dependent systems. Several researchers have performed a large number of significant applications of signcryption such as authenticated key recovery and key establishment in one mall data packet, secure ATM networks as well as light weight electronic transaction protocols and multi-casting over the internet. In this paper we have proposed an efficient and efficient scheme of signcryption symmetric key solutions, using elliptic curves by reducing senders computational cost. It needs two elliptic curve point multiplication for sender and comparative study of computational cost for sender and recipient as well as there is no any inverse computation for sender and recipient. This makes it more crucial than others.
Lightweight Certificate less Signcryption Scheme based on Elliptic Curve
VOLUME-8 ISSUE-10, AUGUST 2019, REGULAR ISSUE, 2019
As of late, many new signcryption techniques are executed on elliptic cryptosystem (ECC) to lessen the calculation loads for devices with low computation requirements. This essential requirement has motivated the authors to present an efficient Signcryption scheme based on elliptic curve cryptography. The proposed system encompasses all the primary security parameters viz., confidentiality, authentication, integrity, unforgeability, non-repudiation and forward secrecy making the method widely accepted in several resource constrained applications.
A Directly Public Verifiable Signcryption Scheme based on Elliptic Curves
2010
A directly public verifiable signcryption scheme is introduced in this paper that provides the security attributes of message confidentiality, authentication, integrity, non-repudiation, unforgeability, and forward secrecy of message confidentiality. It provides the attribute of direct public verifiability so anyone can verify the signcryption without any need for any secret information from the corresponding participants. The proposed scheme is based on
IACR Cryptol. ePrint Arch., 2015
Secure multicast communication has application in growing number of applications. Forward secrecy is of prime importance and insures message con dentiality even long-term private key compromised. We present an e¢ cient construction of multi message multi receiver signcryption with forward secrecy on elliptic curves. It provides con dentiality, integrity, authenticity, non-repudiation, public veri ability, unforgeability and forward secrecy of multi message multicast. It is e¢ cient in computation cost and communication overhead and suitable for resource constrained IP-based secure multi message multicast systems.
ELLIPTIC CURVE DIGITAL SIGNATURE WITH FORWARD SECRECY
In today's digital era data finds a vital place in communication. Most transactions are on the internet, thus giving rise to the need of data security. Safeguarding data is the key to a successful transaction in any application over the internet. Moreover, the sender also needs to authenticate the message content. With the growth and demand in various online transactions the field of cryptography faces many challenges. Digital signatures play a pivotal role in Authentication. It is widely used in all the applications today to verify the integrity of the data exchanged i.e. to prove the identity of the authorized sender. The paper presents an Efficient Elliptic curve Digital Signature Algorithm (EECDSA) and also proposes our method of using forward Secrecy with Elliptic curve Digital Signature Algorithm (ECDSA) which outperforms the existing Elliptic curve Digital Signature Algorithm (ECDSA).
The concept of forward secrecy is extended to wireless sensor networks where it is frequent that nodes run out of energy and new nodes join the network. However it should not be able to retrieve the previous session key or some crucial information. In 2011 Hagras et al. proposed a key management scheme for heterogeneous wireless sensor networks, which satisfies confidentiality, authentication, integrity and unforgeability but lacks forward secrecy. In this paper, the shortcomings of the victim scheme has been extricated and repaired with the help of Elliptic Curve Discrete logarithm problem (ECDLP). An elliptic curve based signcryption key management scheme has been proposed which includes forward secrecy.