Formal Security Verification of Secured ECC Based Signcryption Scheme

Basu, Atanu; Sengupta, Indranil; Sing, Jamuna Kanta

doi:10.1007/978-3-642-30111-7_68

Cited by 6 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Table 4, is our proposed scheme shows the improvement over Basu et al [35] and its related proposed schemes on elliptic curve point multiplication (ECPM), Multiplication MUL and addition ADD.…”

Section: Phase 1: Setup Phasementioning

confidence: 85%

Effective Signcryption Approach for Secure Convention for Multilayer Consensus using ECC

Kumar¹,

Saini²

2016

IJSIA

View full text Add to dashboard Cite

show abstract

Section: Phase 1: Setup Phasementioning

confidence: 85%

Effective Signcryption Approach for Secure Convention for Multilayer Consensus using ECC

Kumar¹,

Saini²

2016

IJSIA

View full text Add to dashboard Cite

show abstract

“…Formal Security Analysis using AVISPA Tool. Recently, AVISPA tool [25] is widely used by many researchers [29,30,31] for the automated validation of Internet security protocols and applications. The AVISPA is a pushbutton tool designed by University of Geneva, Italy using the concept of Dolev and Yao intruder model [32], where the network is controlled by an intruder (Active and passive); however he is not allowed to crack the underlying cryptography.…”

Section: 2mentioning

confidence: 99%

An Efficient and Secure Strong Designated Verifier Signature Scheme Without Bilinear Pairings

Islam¹,

Biswas²

2013

Journal of applied mathematics & informatics

View full text Add to dashboard Cite

In literature, several strong designated verifier signature (SDVS) schemes have been devised using elliptic curve bilinear pairing and map-topoint (MTP) hash function. The bilinear pairing requires a super-singular elliptic curve group having large number of elements and the relative computation cost of it is approximately two to three times higher than that of elliptic curve point multiplication, which indicates that bilinear pairing is an expensive operation. Moreover, the MTP function, which maps a user identity into an elliptic curve point, is more expensive than an elliptic curve scalar point multiplication. Hence, the SDVS schemes from bilinear pairing and MTP hash function are not efficient in real environments. Thus, a cost-efficient SDVS scheme using elliptic curve cryptography with pairingfree operation is proposed in this paper that instead of MTP hash function uses a general cryptographic hash function. The security analysis shows that our scheme is secure in the random oracle model with the hardness assumption of CDH problem. In addition, the formal security validation of the proposed scheme is done using AVISPA tool (Automated Validation of Internet Security Protocols and Applications) that demonstrated that our scheme is unforgeable against passive and active attacks. Our scheme also satisfies the different properties of an SDVS scheme including strongness, source hiding, non-transferability and unforgeability. The comparison of our scheme with others are given, which shows that it outperforms in terms of security, computation cost and bandwidth requirement.

show abstract

Design of Two-Party Authenticated Key Agreement Protocol Based on ECC and Self-Certified Public Keys

Islam

Biswas

2015

Wireless Pers Commun

View full text Add to dashboard Cite

Formal Security Verification of Secured ECC Based Signcryption Scheme

Cited by 6 publications

References 11 publications

Effective Signcryption Approach for Secure Convention for Multilayer Consensus using ECC

Effective Signcryption Approach for Secure Convention for Multilayer Consensus using ECC

An Efficient and Secure Strong Designated Verifier Signature Scheme Without Bilinear Pairings

Design of Two-Party Authenticated Key Agreement Protocol Based on ECC and Self-Certified Public Keys

Contact Info

Product

Resources

About