Efficient Identification of Bad Signatures in RSA-Type Batch Signature

  • Authors:
  • Seungwon Lee;Seongje Cho;Jongmoo Choi;Yookun Cho

  • Affiliations:
  • The authors are with the School of Computer Science and Engineering, Seoul National University, Seoul, 151-742 Korea. E-mail: leesw@ssrnet.snu.ac.kr, E-mail: ykcho@snu.ac.kr,;The authors are with the Division of Information and Computer Science, Dankook University, Seoul, 140-714 Korea. E-mail: sjcho@dku.edu, E-mail: choijm@dku.edu;The authors are with the Division of Information and Computer Science, Dankook University, Seoul, 140-714 Korea. E-mail: sjcho@dku.edu, E-mail: choijm@dku.edu;The authors are with the School of Computer Science and Engineering, Seoul National University, Seoul, 151-742 Korea. E-mail: leesw@ssrnet.snu.ac.kr, E-mail: ykcho@snu.ac.kr,

  • Venue:
  • IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

As the use of electronic voting systems and e-commerce systems increases, the efficient batch verification of digital signatures becomes more and more important. In this paper, we first propose a new method to identify bad signatures in batches efficiently for the case when the batch contains one bad signature. The method can find out the bad signature using smaller number of modular multiplications than the existing method. We also propose an extension to the proposed method to find out two or more bad signatures in a batch instance. Experimental results show that our method yields better performance than the existing method in terms of the number of modular multiplications.