Abstract
We propose a now method for verifying bad signature in a batch instance of DSA-type digital signatures when there is one bad signature in the batch. The proposed method can verify and identify a bad signature using two modular exponentiations and n+3-√n/2 modular multiplications where n is the number of signatures in the batch instance. Simulation results show our method reduces considerably the number of modular multiplications compared with the existing methods. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Lee, S., Cho, S., Choi, J., & Cho, Y. (2005). Batch verification with DSA-type digital signatures for ubiquitous computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3802 LNAI, pp. 125–130). Springer Verlag. https://doi.org/10.1007/11596981_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
