Cryptology ePrint Archive: Report 2007/172

Batch Verification of Short Signatures

Jan Camenisch and Susan Hohenberger and Michael {\O}stergaard Pedersen

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. 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.

Category / Keywords: signatures, batch verification, screening, vehicular networks

Publication Info: Full version of the Eurocrypt 2007 paper

Date: received 9 May 2007, last revised 3 Sep 2009

Contact author: michael at daimi au dk

Available format(s): PDF | BibTeX Citation

Version: 20090903:072019 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]