Research Of Batch Verification In Bilinear Pairing-based Signature Schemes

With the fast development of informationization and science technology in our country, information security becomes more and more important. Information security can guarantee the integrity, availability, confidentiality and non-repudiation of the information. The non-repudiation can be achieved by digital signatures, it guarantees that the information cannot be modified during the process of transmission, and the sender cannot deny what they have sent. As digital signature widely used, people’s requirements become more and more complicated. Sometimes we need to verify a large amount of signatures in a short period. Therefore, the ways to efficiently verify the digital signatures become a hot research topic in the digital signature field. Using batch verification technology, we can effectively improve the verification speed.Based on the study and understanding of two basic types of bilinear pairing-based digital signature schemes,for example BLS and Hess, we study three kinds of batch verification technology which are Naccache,Qinxin, Cheon,Yi, and apply them to the two basic types of digital signature schemes. We analyze the efficiency influence of applied batch verification technology on bilinear pairing-based digital signature scheme from theory and practice aspects. The contents of the analysis include a variety of situations, for example, the same batch verification technology is applied to different digital signature schemes, the same batch verification technology is applied to the same digital signature scheme generated by different elliptic curves and the impact of verification efficiency when using different number of signatures.