Abstract

In many bandwidth-critical environments, including vehicle-to-vehicle and vehicle-to-infrastructure communications, implicit certificates such as elliptic curve Qu-Vanstone (ECQV) are frequently employed as a means to reduce the bandwidth requirement of digital signatures. In these environments, however, certain recipients such as roadside units need to verify signatures for multiple messages within considerably short time periods. In this paper, we propose two efficient methods of reducing the computational costs of signature verification when multiple digital signatures are provided together with the ECQV implicit certificates. The first method achieves this by sharing the intermediate results that are computed when public keys are extracted from ECQV certificates. The second guarantees a further speed improvement by merging the public key extraction processes into a batch signature verification process. We also present an algorithm that adaptively chooses the best verification method for the given signatures in real time. Our experimental results show that the proposed methods allow for a signature verification that is five times faster than existing methods.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.