Batch Verification of Short Signatures

Abstract

Abstract. With computer networks spreading into a variety of new environments, the need to authenticate and secure communication grows. Many of these new environments have particular requirements on the applicable cryptographic primitives. For instance, several applications require that communication overhead be small and that many messages be processed at the same time. In this paper we consider the suitability of public key signatures in the latter scenario. That is, we consider signatures that are 1) short and 2) where many signatures from (possibly) different signers on (possibly) different messages can be verified quickly.We propose the first batch verifier for messages from many (certified) signers without random oracles and with a verification time where the dominant operation is independent of the number of signatures to verify. We further propose a new signature scheme with very short signatures, for which batch verification for many signers is also highly efficient. Prior work focused almost exclusively on batching signatures from the same signer. Combining our new signatures with the best known techniques for batching certificates from the same authority, we get a fast batch verifier for certificates and messages combined. Although our new signature scheme has some restrictions, it is the only solution, to our knowledge, that is a candidate for some pervasive communication applications.

On batch verification with group testing for vehicular communications

“…For instance, 3 pairing operations are required to verify a single signature. With the batch verification scheme of [30], verifying n signatures also takes 3 pairing operations instead of 3n pairing operations. In other words, the verification time of the dominant operation (i.e., paring) is independent of the number of signatures to verify.…”

“…Therefore, the batch verification can dramatically decrease the time spent on verifying a large number of signatures, which can achieve much better scalability. In this paper, we propose an efficient identity-based batch verification scheme based on the improved CL signature scheme in [30].…”

“…Some other batch signature schemes were proposed later [25][26][27][28][29]. The latest batch verification scheme proposed in [30] is based on the CL signature scheme [31], and is the first solution on batch verification without using random oracles, in which the computation efficiency can be significantly improved. For instance, 3 pairing operations are required to verify a single signature.…”

Provably secure one-round identity-based authenticated asymmetric group key agreement protocol

“…i is the identity-based signature on r i . To keep the whole protocol efficient, one may choose an identity-based signature scheme that supports batch verification [11,28] to generate . i .…”

An Improved Binary Authentication Tree Algorithm for Vehicular Networks

“…The delay caused by verifying a bulk of signatures may radically impede the transmission throughput and impair the system scalability. A possible promising approach to improve the verification efficiency is to employ batch verification [6][7][8][9][10][11], which permits verifying a large number of signatures simultaneously instead of sequentially. This decreases the number of time-consuming operations, especially when authenticating a large number of signatures.…”