Journal of Computer Science and Technology
Quick Search in JCST
 Advanced Search 
      Home | PrePrint | SiteMap | Contact Us | FAQ
 
Indexed by   SCIE, EI ...
Bimonthly    Since 1986
Journal of Computer Science and Technology 2013, Vol. 28 Issue (1) :144-151    DOI: 10.1007/s11390-013-1318-4
Information Security Current Issue | Archive | Adv Search << Previous Articles | Next Articles >>
A New Batch Verifying Scheme for Identifying Illegal Signatures
Adrian Atanasiu
Faculty of Mathematics and Computer Science, Bucharest University, Str. Academiei 14, Bucharest 010014, Romania

Abstract
Reference
Related Articles
Download: [PDF 249KB]     Export: BibTeX or EndNote (RIS)  
Abstract The concept of batch verifying multiple digital signatures is to find a method by which multiple digital signatures can be verified simultaneously in a lower time complexity than separately verifying all the signatures. In this article, we analyze the complexity of the batch verifying schemes defined by Li, Hwang and Chen in 2010, and propose a new batch verifying multiple digital signature scheme, in two variants: one for RSA - by completing the Harn’s schema with an identifying illegal signatures algorithm, and the other adapted for a modified Elliptic Curve Digital Signature Algorithm protocol.
Articles by authors
Adrian Atanasiu
Keywordsdigital signature   batch verifying   multiple signature   RSA signature   elliptic curve digital signature algorithm standard     
Received 2012-03-12;
Cite this article:   
Adrian Atanasiu.A New Batch Verifying Scheme for Identifying Illegal Signatures[J]  Journal of Computer Science and Technology, 2013,V28(1): 144-151
URL:  
http://jcst.ict.ac.cn:8080/jcst/EN/10.1007/s11390-013-1318-4
Copyright 2010 by Journal of Computer Science and Technology