2023
DOI: 10.1109/jiot.2022.3222237
|View full text |Cite
|
Sign up to set email alerts
|

Pairing-Free Certificateless Aggregate Signcryption Scheme for Vehicular Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
20
1

Year Published

2023
2023
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(21 citation statements)
references
References 42 publications
0
20
1
Order By: Relevance
“…The computation cost of FN verification compared with other schemes is shown in Figure 4. We can see that neither [24,25] nor our scheme involves bilinear mapping operations, resulting in higher execution efficiency compared to [27,28]. With the increase in the number of charging and discharging EVs, the computation overhead of the FN becomes lower and lower compared with other schemes.…”
Section: Computation Costmentioning
confidence: 87%
See 2 more Smart Citations
“…The computation cost of FN verification compared with other schemes is shown in Figure 4. We can see that neither [24,25] nor our scheme involves bilinear mapping operations, resulting in higher execution efficiency compared to [27,28]. With the increase in the number of charging and discharging EVs, the computation overhead of the FN becomes lower and lower compared with other schemes.…”
Section: Computation Costmentioning
confidence: 87%
“…Table 5 compares the signcryption output length as the communication cost with other schemes. It can be seen that our scheme and [24] have the lowest communication overhead, both of which are 640 bits. Compared with [27], our scheme is reduced by (2208 − 640)/2208 = 71.01%; compared with [28], it is reduced by (4416 − 640)/4416 = 85.51%; compared with [25], it is reduced by (960 − 640)/960 = 33.33%.…”
Section: Communication Costmentioning
confidence: 95%
See 1 more Smart Citation
“…Computational efficiency analysis: in order to specifically analyze this scheme, a comparative analysis will be performed on ring signcryption with existing papers [3,23,27,28] and existing literature on aggregated signcryption papers [29][30][31][32], respectively. Suppose a ring has n members and m messages.…”
Section: Performance Analysismentioning
confidence: 99%
“…In this section, we will select typical excellent papers [3,23,[27][28][29][30][31][32] that are currently available and compare them. The main focus of attention is on the functionality of the programs and the problems they solve.…”
Section: Compare Algorithm Functionsmentioning
confidence: 99%