Simplified small exponent test for batch verification

Hwang, Jung Yeon; Song, Boyeon; Choi, Daeseon; Jin, Seunghun; Cho, Hyun Sook; Lee, Mun-Kyu

doi:10.1016/j.tcs.2016.12.017

Cited by 9 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It improves the efficiency a little. Later, Hwang et al [16] simplified the approach. Both are inefficient when we care about the exact invalid signatures.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Invalid Signatures Searching Bitwise Divisions-Based Algorithm for Vehicular Ad-Hoc Networks

Cheng

et al. 2021

Journal of Advanced Transportation

View full text Add to dashboard Cite

Vehicular ad-hoc networks (VANETs) are the crucial part of intelligent transportation systems (ITS), which are brought to enhance the security, efficiency, and comfort of transportation. VANETs have aroused extensive attention in the world recently. One of the challenges in practice is real time and low delay, which strongly requires VANETs to be efficient. Existing schemes have properly solved the problem which is how to aggregate the signatures and verify the aggregated signature. However, few solutions are proposed to pinpoint all invalid signatures if existing. The algorithms that can find all invalid signatures are not efficient enough. Following consideration of the above deficiencies of existing approaches, this paper proposes a factorial bitwise divisions (FBD) algorithm and its optimized version and early-stopping factorial bitwise divisions (EFBD) algorithm. Both algorithms are parallel-friendly. Compared with the binary-based batch verification algorithm, the experimental results demonstrate that the proposed algorithms achieve better performance in both theory and practice at low invalid signatures’ rate. Especially, in the parallel condition, when the number of invalid signatures is 1, the proposed algorithms cost only one aggregation-verification delay, while the comparison is more than log 2 n times.

show abstract

“…It improves the efficiency a little. Later, Hwang et al [16] simplified the approach. Both are inefficient when we care about the exact invalid signatures.…”

Section: Related Workmentioning

confidence: 99%

“…if F • size � 1 then (13) return F (14) end if (15) if F � ∅ then (16) return ∅ (17) end if (18) if F • size <� 2 log 2 n then (19) return SingleVerify (F) (20) end if (21) if F • size � A • size then (22) choose two groups…”

Section: Conflicts Of Interestmentioning

confidence: 99%