IACR News item: 16 October 2012
Sabyasachi Karati, Abhijit Das, Dipanwita Roychowdhury
ePrint Report
Randomizers are popularly used to prevent various types of attacks on batch-verification schemes. Recently, several algorithms based upon symbolic computation are proposed for the batch verification of ECDSA signatures. In this article, we demonstrate that the concept of randomizers can be easily embedded in these symbolic-computation algorithms. The performance degradation caused by randomizers is comparable with that associated with ECDSA*.
Additional news items may be found on the IACR news page.