Batch Verification of Short Signatures

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, a frequent requirement is that the communication overhead inflicted be small and that many messages be processable 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. Prior work focused almost exclusively on batching signatures from the same signer.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. 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 very efficient and still practical for some communication applications.

Efficient Multilevel Privacy Preserving Authentication Scheme for Emergency Message Communication in VANE

“…In this scheme the vehicles use pseudonyms to communicate with the RSU, which ensure privacy to the users. In [6] , Zhang et.al., addressed identity based batch signature verification [7] scheme. In this scheme RSU verifies multiple signatures at the same time so that it reduces the verification time.…”

“…In the recent years, various authors have proposed privacy preserving authentication schemes for secure message communication. The two most common privacy preserving authentication schemes are the pseudonyms based privacy preserving scheme [4][5][6][7][8][9][10][11][12]22, 24], the group signature based privacy preserving scheme [13][14][15][16][17]. Each scheme provides solution to the secure privacy preserving message communication problems in VANET but all of them have some drawbacks.…”

Verifiable Computation in Multiparty Protocols with Honest Majority

“…The real implementation of the transmission functionality is built on top of signatures. This makes the implementation very efficient, as hash trees allow several messages (sent in the same round) to be signed with almost the same computation effort as a single one [29], and signatures can be verified in batches [12]. An implementation of F tr is given in App.…”

Identity-Based Authenticated Asymmetric Group Key Agreement Protocol

“…To keep the whole protocol efficient, one may choose an identity-based signature scheme that supports batch verification [12] to generate i . The material used to generate the encryption/decryption key is described in Table 1, in which z i,i = z i,i is not published, but is kept secret by U i .…”