An Efficient Signcryption Scheme based on The Elliptic Curve Discrete Logarithm Problem

Amounas, Fatima; Kinani, El Hassan El

doi:10.11591/ijins.v2i3.2420

Cited by 7 publications

(7 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…B a l a, S h a r m a and V e r m a [85] designed an ECC based signcryption scheme, which solves the problem of key exchange in WSN. A signcryption scheme based on elliptic curve discrete logarithmic problem has been given by A m o u n a s, S a d k i and K i n a n i [89], which satisfies all major security attributes and takes less computational cost as compared to other schemes. However, this scheme has no constraint on the selection of curve parameters.…”

Section: Using Signcryption For Lcpdsmentioning

confidence: 99%

See 1 more Smart Citation

Security of Low Computing Power Devices: A Survey of Requirements, Challenges & Possible Solutions

Singh

Patro²

2019

Cybernetics and Information Technologies

View full text Add to dashboard Cite

Security has been a primary concern in almost all areas of computing and for the devices that are low on computing power it becomes more important. In this paper, a new class of computing device termed as Low Computing Power Device (LCPD) has been defined conceptually. The paper brings out common attributes, security requirements and security challenges of all kinds of low computing power devices in one place so that common security solutions for these can be designed and implemented rather than doing this for each individual device type. A survey of existing recent security solutions for different LCPDs hasve been presented here. This paper has also provided possible security solutions for LCPDs which include identification of countermeasures against different threats and attacks on these devices, and choosing appropriate cryptographic mechanism for implementing the countermeasures efficiently.

show abstract

Section: Using Signcryption For Lcpdsmentioning

confidence: 99%

“…A m o u n a s, S a d k i and K i n a n i [89]        2 1 1 0 0 1 1 1 0 0 0 1 7.503 C h a u d h r y et al [86]       × 1 1 0 1 0 0 2 1 0 0 0 0 7.503…”

Section: Using Signcryption For Lcpdsmentioning

confidence: 99%

Security of Low Computing Power Devices: A Survey of Requirements, Challenges & Possible Solutions

Singh

Patro²

2019

Cybernetics and Information Technologies

View full text Add to dashboard Cite

show abstract

“…The scheme was based on ECC but takes more computational cost in terms of number of computations (Table II), as compared to existing schemes. F.Amounas [11] designed an improvedsigncryption scheme based on elliptic curve cryptography providing all the required security properties with less cost. The scheme was found suitable for resource constrained devices.…”

Section: Overview Of Signcryption Schemesmentioning

confidence: 99%

Performance Comparison of Signcryption Schemes – A Step towards Designing Lightweight Cryptographic Mechanism

Singh¹,

B.D.K²

2017

IJET

View full text Add to dashboard Cite

Abstract-With the advancement of technology and use of heterogeneous devices in today's communication, computing has become ubiquitous involving devices that are low on computing power and therefore securing communication is necessary in this type of environment. The fundamental security attributes which any system must have includes confidentiality, integrity, authentication and nonrepudiation. Signcryption is a new way to achieve confidentiality and authentication simultaneously. Before the advent of signcryption the approach was to first encrypt and then to sign the message, but this scheme had more computational cost and communication overhead. Many signcryption schemes have been developed and implemented so far, but differ in security attributes they provide and computational cost they incur. The strength of these schemes depend upon the difficulty of solving any one problem namely IFP (Integer Factorization Problem), (DLP) Discrete Logarithmic Problem, ECDLP (Elliptic Curve Discrete Logarithmic Problem) or Bilinear Diffie Hellman Problem. This paper analyzes and compares the performance of various signcryption schemes in terms of security attributes and computational cost they take. This analysis provides a way to design Lightweight Cryptographic Mechanism suitable for low computing environments. The last section of the paper provides a generic approach for designing lightweight cryptographic mechanism. Keyword-Performance, Signcryption, Lightweight Cryptography I. INTRODUCTIONThe technique of Signcryption was coined by YuliangZheng [1] in 1997. Signcryption is relatively a new cryptographic system which combines encryption and authentication in only one logical step. Zheng claimed that signcryption incurs 58% less computational cost and 85% less overhead in comparision to the conventional signature-then-encryption approach. Since the inception of signcryption many signcryption schemes have been given by the authors throughout the years offering different security attributes while having certain advantages and limitations. Also these signcryption schemes are based on DLP (Discrete Logarithmic Problem), ECDLP (Elliptic Curve Discrete Logarithmic Problem) or BDHP (Bilinear Diffie Hellman Problem) [25]. The mechanism of signcryption has been explained in the upcoming section of the paper.

show abstract

“…Sumanjit Das [18] proposed an elliptic curve based signcryption scheme which is implemented in java and provides all the security goals including forward secrecy and public verification. F.Amounas [19] presented an improved signcryption scheme based on elliptic curve discrete logarithmic problem (ECDLP). The scheme provides all the security properties these security properties with a saving in computation cost compared to the traditional signature-then-encryption scheme, which makes the new scheme more appropriate for environments with limited computing power.…”

Section: Emohamed and Helkamchouchimentioning

confidence: 99%

“…. F.Amounas [19] Designing low cost elliptic curve based signcryption schemes Less expensive than other schemes as number of elliptic curve point multiplications are less.…”

mentioning

confidence: 99%

A Review of Elliptic Curve based Signcryption Schemes

Singh¹

2014

IJCA

View full text Add to dashboard Cite

Signcryption is a new cryptographic approach which provides authentication and encryption simultaneously in a single logical step. The aim is to reduce the cost of signature-thenencryption approach. This cost includes computational cost and communication cost. Furthermore some signcryption schemes are based on RSA while some are based on elliptic curve. This paper provides a critical review of the signcryption schemes based on elliptic curves, since signcryption schemes based on elliptic curve cryptography saves more computational time and communication cost. Also, the elliptic curve based signcryption schemes are suitable for resource constrained applications. This work explores the advantages and limitations of the different signcryption schemes based on elliptic curves. General TermsSecurity, Cryptography.

show abstract

An Efficient Signcryption Scheme based on The Elliptic Curve Discrete Logarithm Problem

Cited by 7 publications

References 12 publications

Security of Low Computing Power Devices: A Survey of Requirements, Challenges & Possible Solutions

Security of Low Computing Power Devices: A Survey of Requirements, Challenges & Possible Solutions

Performance Comparison of Signcryption Schemes – A Step towards Designing Lightweight Cryptographic Mechanism

A Review of Elliptic Curve based Signcryption Schemes

Contact Info

Product

Resources

About