2017
DOI: 10.1007/s11277-017-4560-1
|View full text |Cite
|
Sign up to set email alerts
|

PF-IBS: Pairing-Free Identity Based Digital Signature Algorithm for Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(28 citation statements)
references
References 12 publications
0
28
0
Order By: Relevance
“…Here, the minor operation like addition, division, subtraction, encryption, decryption, and hash that require less time during computation being ignored. We showed the required major operation in Table 3 for Sharma et al [51], James et al [52], Sharma and Sharma [34], Krishna et al [53], Yaduvanshi and Mishra [35], and for our proposed scheme, respectively. Additionally, in Table 4, we provide a comparison by utilizing these major operations with respect to milliseconds (ms).…”
Section: ) Computation Costmentioning
confidence: 88%
See 3 more Smart Citations
“…Here, the minor operation like addition, division, subtraction, encryption, decryption, and hash that require less time during computation being ignored. We showed the required major operation in Table 3 for Sharma et al [51], James et al [52], Sharma and Sharma [34], Krishna et al [53], Yaduvanshi and Mishra [35], and for our proposed scheme, respectively. Additionally, in Table 4, we provide a comparison by utilizing these major operations with respect to milliseconds (ms).…”
Section: ) Computation Costmentioning
confidence: 88%
“…In 2016, Z. Qin et al [50] proved the security of some schemes and point out that these schemes suffer from forgery attack and security can be easily be compromised. In 2017, Sharma et al [51], proposed a pairing-free IBS scheme in the random oracle model. The aim of this scheme is to reduce signature computation cost and safety from forging signature attacks.…”
Section: B Identity-based Signature Schemesmentioning
confidence: 99%
See 2 more Smart Citations
“…We optimize the PF-IBS algorithm proposed by Sharma et al [19] The public key of each node in our optimized PF-IBS algorithm is related to ID i , which is more conducive to identity authentication. Its security depends on the intractability of the discrete logarithm on the elliptic curve.…”
Section: Pf-ibs Algorithmmentioning
confidence: 99%