Efficient Identification of Bad Signatures in RSA-Type Batch Signature

Seungwon LEE; Seongje CHO; Jongmoo CHOI; Yookun CHO

doi:10.1093/ietfec/e89-a.1.74

Efficient Identification of Bad Signatures in RSA-Type Batch Signature

Seungwon LEE, Seongje CHO, Jongmoo CHOI, Yookun CHO

Full Text Views

0

Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E89-A No.1 pp.74-80

Publication Date: 2006/01/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1093/ietfec/e89-a.1.74

Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)

Category: Digital Signature

Cite this

Copy

Seungwon LEE, Seongje CHO, Jongmoo CHOI, Yookun CHO, "Efficient Identification of Bad Signatures in RSA-Type Batch Signature" in IEICE TRANSACTIONS on Fundamentals, vol. E89-A, no. 1, pp. 74-80, January 2006, doi: 10.1093/ietfec/e89-a.1.74.
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.1.74/_p

Copy

@ARTICLE{e89-a_1_74,
author={Seungwon LEE, Seongje CHO, Jongmoo CHOI, Yookun CHO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient Identification of Bad Signatures in RSA-Type Batch Signature},
year={2006},
volume={E89-A},
number={1},
pages={74-80},
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.},
keywords={},
doi={10.1093/ietfec/e89-a.1.74},
ISSN={1745-1337},
month={January},}

Copy

TY - JOUR
TI - Efficient Identification of Bad Signatures in RSA-Type Batch Signature
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 74
EP - 80
AU - Seungwon LEE
AU - Seongje CHO
AU - Jongmoo CHOI
AU - Yookun CHO
PY - 2006
DO - 10.1093/ietfec/e89-a.1.74
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2006
AB - 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.
ER -