Abstract
In this paper, we propose an efficient batch verification algorithm for ECDSA $$^*$$ (Elliptic Curve Digital Signature Algorithm) $$^*$$ signatures. Our scheme is efficient for both single and multiple signers. ECDSA $$^*$$ signature is a modified version of ECDSA, which accelerates the verification of ECDSA signature by more than 40%. However, the highlighting feature of our proposed scheme is its efficiency for varied batch sizes. The scheme is resistant to forgery attacks by either signer or intruder. The performance of our scheme remains consistent for higher batch sizes too ( $$\ge 8$$ ). Our paper also discusses the possible attacks on ECDSA signatures and also how our scheme is resistant to such attacks.
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 callDisclaimer: 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.
