Efficient Identification of Bad Signatures in RSA-Type Batch Signature(Digital Signature, <Special Section>Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 社団法人電子情報通信学会の論文
- 2006-01-01
著者
-
Lee Seungwon
School Of Computer Science And Engineering Seoul National University
-
CHO Seongje
Division of Information and Computer Science, Dankook University
-
CHOI Jongmoo
Division of Information and Computer Science, Dankook University
-
CHO Yookun
School of Computer Science and Engineering, Seoul National University
-
Cho Yookun
School Of Computer Science And Engineering Seoul National University
-
Cho Seongje
Division Of Information And Computer Science Dankook University
-
Choi Jongmoo
Division Of Information And Computer Science Dankook University
関連論文
- Efficient Identification of Bad Signatures in RSA-Type Batch Signature(Digital Signature, Cryptography and Information Security)
- Ensuring Latest-Bound Currency of Read-Only Transactions in Mobile Broadcasting Environments
- Finish Time Predictability of Earliest Deadline Zero Laxity Algorithm for Multiprocessor Real-Time Systems(System Programs)
- Comparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor(System Programs)
- An Efficient Mobile Code Authentication Scheme that Permits Overlapping of Execution and Downloading(Networks)
- Cost Analysis of Optimistic Recovery Model for Forked Checkpointing(Special Issue on Parallel and Distributed Computing, Applications and technologies)