Verification of a batch of bad signatures by using the Matrix-Detection Algorithm??

Tunghai University Institutional Repository > 工學院 > 資訊工程學系所 > 會議論文 > Item 310901/21798

Please use this identifier to cite or link to this item: http://140.128.103.80:8080/handle/310901/21798

Title:	Verification of a batch of bad signatures by using the Matrix-Detection Algorithm??
Authors:	Huang, Y.-L., Lin, C.-H., Leu, F.-Y.
Contributors:	Department of Computer Science, Tunghai University
Keywords:	Batch verification is a method devised to verify multiple signatures as a whole simultaneously. In literatures, we can see that some conventional batch verification schemes cannot effectively and efficiently identity bad signatures. Small Exponent test, a popular batch verification method, has its own problems, e.g., after a test, bad signatures still exist with some escape probabilities. In this paper, we propose a batch verification approach, called Matrix-Detection Algorithm (MDA for short), with which when a batch of signatures has less than four bad signatures or odd number of bad signatures, all bad signatures can be identified. Given 1024 signatures with 4 bad signatures, the maximum escape probability pmax of the MDA is 5.3?10-5, and p max decreases as digital signatures or bad signatures increase. Analytic results show that the MDA is more secure and efficient than the SET. ? 2011 IEEE.
Date:	2011-06-21
Issue Date:	2013-05-15T09:05:58Z (UTC)
Abstract:	Batch verification is a method devised to verify multiple signatures as a whole simultaneously. In literatures, we can see that some conventional batch verification schemes cannot effectively and efficiently identity bad signatures. Small Exponent test, a popular batch verification method, has its own problems, e.g., after a test, bad signatures still exist with some escape probabilities. In this paper, we propose a batch verification approach, called Matrix-Detection Algorithm (MDA for short), with which when a batch of signatures has less than four bad signatures or odd number of bad signatures, all bad signatures can be identified. Given 1024 signatures with 4 bad signatures, the maximum escape probability pmax of the MDA is 5.3?10-5, and p max decreases as digital signatures or bad signatures increase. Analytic results show that the MDA is more secure and efficient than the SET. ? 2011 IEEE.
Relation:	Proceedings - 1st International Conference on Data Compression, Communication, and Processing, CCP 2011 , art. no. 6061038 , pp. 299-306
Appears in Collections:	[資訊工程學系所] 會議論文

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	169	View/Open

Loading...