Fast Batch Verification of Multiple Signatures

Cheon, Jung Hee; Yi, Jeong Hyun

doi:10.1007/978-3-540-71677-8_29

Cited by 34 publications

(16 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that the ambiguities arising out of h > 1 and/or q > n can be practically solved by appending only a few extra bits to standard ECDSA signatures [1,4]. Consequently, our assumptions are neither too restrictive nor too impractical.…”

Section: Assumptionsmentioning

confidence: 96%

“…ECDSA*, a modification of ECDSA introduced by Antipa et al [1], permits an easy adaptation of Naccache et al's batch-verification protocol for DSA. Cheon and Yi [4] study batch verification of ECDSA* signatures, and report speedup factors of up to 7 for same signer and 4 for different signers. However, ECDSA* is not a standard, and is thus unacceptable, particularly in applications where interoperability is of important concern.…”

Section: Introductionmentioning

confidence: 97%

See 1 more Smart Citation

New algorithms for batch verification of standard ECDSA signatures

et al. 2014

View full text Add to dashboard Cite

In this paper, several algorithms for batch verification of ECDSA signatures are studied. The first of these algorithms is based upon the naive idea of taking square roots in the underlying field. In order to improve the efficiency beyond what can be achieved by the naive algorithm, two new algorithms are proposed which replace square-root computations by symbolic manipulations. Experiments carried out on NIST prime curves demonstrate a maximum speedup of above six over individual verification if all the signatures in the batch belong to the same signer, and a maximum speedup of about two if the signatures in the batch belong to different signers, both achieved by a fast variant of the second symbolic-manipulation algorithm. In terms of security, all the studied algorithms are equivalent to standard ECDSA* batch verification. These algorithms are practical only for small (≤8) batch sizes. The algorithms are also ported to the NIST Koblitz curves defined over fields of characteristic

show abstract

Section: Assumptionsmentioning

confidence: 96%

Section: Introductionmentioning

confidence: 97%

New algorithms for batch verification of standard ECDSA signatures

et al. 2014

View full text Add to dashboard Cite

show abstract

“…Cheon and Yi [4] reported that in addition to requiring less computation time, a batch-verification technique generally performs approximately 4.8 times faster than individual verifications. Assuming that a vehicle needs to verify a safety message set consisting of n safety messages simultaneously, SCPP's batch-verification procedure uses the following two steps.…”

Section: Batch Verificationmentioning

confidence: 98%

Self-certified Privacy-Preserving Scheme for Vehicle-to-Vehicle Communications

Cho

Lee

2015

Computer Science and Its Applications

View full text Add to dashboard Cite

Abstract. In vehicular ad hoc networks (VANETs), vehicles should exchange safety-related messages with each other while processing them within short time in their embedded on-board units. Most previous authentication schemes unfortunately are not ready to be deployed for vehicle-to-vehicle communications owing to serious practical shortcomings, such as the enormous expense of building additional facilities (e.g., roadside units), computation and communication bottlenecks, a huge certificate revocation list, and low processing capacity. To alleviate these problems, we propose an efficient privacy-preserving scheme with which each vehicle (specifically, its embedded on-board unit) can produce valid one-time certificates without help from any third party. The scheme is cost-effective because additional facilities are not needed and it can also prevent bottlenecks on a certain trusted entity because certificates are self-produced.

show abstract

“…As remarked in [36], fast validation of vehicular messages is crucial for a wide deployment of VANETs in practice. To meet this requirement, we use a batch-verification technique similar to the one shown in [36] and [37]. When a vehicle receives safety messages from other vehicles in the group maintained by R i whose public key is w i , it runs the following VBVerify algorithm to check the validity of these safety messages.…”

Section: ) Batch Verificationmentioning

confidence: 99%

“…Using the batch-verification technique requires only two (rather than 2n) bilinear map operations. In addition to saving in bilinear map computation, the above batch verification performs approximately 4.8 times faster than the individual verifications [37]. 6) Tracing: Malicious entities (vehicles) may exist in VANETs.…”

Section: ) Batch Verificationmentioning

confidence: 99%

A Scalable Robust Authentication Protocol for Secure Vehicular Communications

Zhang

Solanas

et al. 2010

IEEE Trans. Veh. Technol.

281

153

View full text Add to dashboard Cite

Existing authentication protocols to secure vehicular ad hoc networks (VANETs) raise challenges such as certificate distribution and revocation, avoidance of computation and communication bottlenecks, and reduction of the strong reliance on tamper-proof devices. This paper efficiently copes with these challenges with a decentralized group-authentication protocol in the sense that the group is maintained by each roadside unit (RSU) rather than by a centralized authority, as in most existing protocols that are employing group signatures. In our proposal, we employ each RSU to maintain and manage an on-the-fly group within its communication range. Vehicles entering the group can anonymously broadcast vehicle-to-vehicle (V2V) messages, which can be instantly verified by the vehicles in the same group (and neighboring groups). Later, if the message is found to be false, a third party can be invoked to disclose the identity of the message originator. Our protocol efficiently exploits the specific features of vehicular mobility, physical road limitations, and properly distributed RSUs. Our design leads to a robust VANET since, if some RSUs occasionally collapse, only the vehicles that are driving in those collapsed areas will be affected. Due to the numerous RSUs sharing the load to maintain the system, performance does not significantly degrade when more vehicles join the VANET; hence, the system is scalable. Disciplines Physical Sciences and Mathematics Publication DetailsZhang, L., Wu, Q., Solanas, A. & Domingo-Ferrer, J. (2010) Abstract-Existing authentication protocols to secure vehicular ad hoc networks (VANETs) raise challenges such as certificate distribution and revocation, avoidance of computation and communication bottlenecks, and reduction of the strong reliance on tamper-proof devices. This paper efficiently copes with these challenges with a decentralized group-authentication protocol in the sense that the group is maintained by each roadside unit (RSU) rather than by a centralized authority, as in most existing protocols that are employing group signatures. In our proposal, we employ each RSU to maintain and manage an on-the-fly group within its communication range. Vehicles entering the group can anonymously broadcast vehicle-to-vehicle (V2V) messages, which can be instantly verified by the vehicles in the same group (and neighboring groups). Later, if the message is found to be false, a third party can be invoked to disclose the identity of the message originator. Our protocol efficiently exploits the specific features of vehicular mobility, physical road limitations, and properly distributed RSUs. Our design leads to a robust VANET since, if some RSUs occasionally collapse, only the vehicles that are driving in those collapsed areas will be affected. Due to the numerous RSUs sharing the load to maintain the system, performance does not significantly degrade when more vehicles join the VANET; hence, the system is scalable.Index Terms-Conditional privacy, information security, protocol design, v...

show abstract

Fast Batch Verification of Multiple Signatures

Cited by 34 publications

References 18 publications

New algorithms for batch verification of standard ECDSA signatures

New algorithms for batch verification of standard ECDSA signatures

Self-certified Privacy-Preserving Scheme for Vehicle-to-Vehicle Communications

A Scalable Robust Authentication Protocol for Secure Vehicular Communications

Contact Info

Product

Resources

About