{"id":589,"date":"2009-01-21T12:59:54","date_gmt":"2009-01-21T11:59:54","guid":{"rendered":"http:\/\/www.bytopia.dk\/blog\/?p=589"},"modified":"2009-01-21T12:59:54","modified_gmt":"2009-01-21T11:59:54","slug":"practical-short-signature-batch-verification","status":"publish","type":"post","link":"https:\/\/www.bytopia.dk\/blog\/2009\/01\/21\/practical-short-signature-batch-verification\/","title":{"rendered":"Practical Short Signature Batch Verification"},"content":{"rendered":"

I g\u00e5r sendte jeg den endelige version af vores artikel Practical Short Signature Batch Verification<\/em> ind til CT-RSA 2009<\/a>. Der var dog en gr\u00e6nse p\u00e5 16 sider alt inkl., s\u00e5 vi har ogs\u00e5 lagt den fulde version online p\u00e5 ePrint<\/a>, samt under publikationer<\/em> linket ovenfor. Hvis du er i tvivl om det kunne v\u00e6re interessant at l\u00e6se artiklen, s\u00e5 kan du da tage et kig p\u00e5 f\u00f8lgende abstract \ud83d\ude42<\/p>\n

In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures satisfy the latter condition, but are generally thousands of bits in length. Recent developments in pairing-based cryptography produced a number of short signatures which provide equivalent security in a fraction of the space. Unfortunately, verifying these signatures is computationally intensive due to the expensive pairing operation. In an attempt to simultaneously achieve “short and fast” signatures, Camenisch, Hohenberger and Pedersen (Eurocrypt 2007) showed how to batch verify two pairing-based schemes so that the total number of pairings was independent of the number of signatures to verify. <\/em><\/p>\n

In this work, we present both theoretical and practical contributions. On the theoretical side, we introduce new batch verifiers for a wide variety of regular, identity-based, group, ring and aggregate signature schemes. These are the first constructions for batching group signatures, which answers an open problem of Camenisch et al. On the practical side, we implement each of these algorithms and compare each batching algorithm to doing individual verifications. Our goal is to test whether batching is practical; that is, whether the benefits of removing pairings significantly outweigh the cost of the additional operations required for batching, such as group membership testing, randomness generation, and additional modular exponentiations and multiplications. We experimentally verify that the theoretical results of Camenisch et al. and this work, indeed, provide an efficient, effective approach to verifying multiple signatures from (possibly) different signers.<\/em><\/p>\n

Den forrige artikel af Camenisch et al. vi refererer til, er ogs\u00e5 en jeg har v\u00e6ret medforfatter p\u00e5, s\u00e5 egentlig er den nye artikel bare en forts\u00e6ttelse af det arbejde, vi pr\u00e6senterede p\u00e5 Eurocrypt konferencen i 2007.<\/p>\n","protected":false},"excerpt":{"rendered":"

I g\u00e5r sendte jeg den endelige version af vores artikel Practical Short Signature Batch Verification ind til CT-RSA 2009. Der var dog en gr\u00e6nse p\u00e5 16 sider alt inkl., s\u00e5 vi har ogs\u00e5 lagt den fulde version online p\u00e5 ePrint, samt under publikationer linket ovenfor. Hvis du er i tvivl om det kunne v\u00e6re interessant […]<\/p>\n","protected":false},"author":3,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"ngg_post_thumbnail":0,"footnotes":""},"categories":[3],"tags":[],"class_list":["post-589","post","type-post","status-publish","format-standard","hentry","category-personlig"],"_links":{"self":[{"href":"https:\/\/www.bytopia.dk\/blog\/wp-json\/wp\/v2\/posts\/589","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.bytopia.dk\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.bytopia.dk\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.bytopia.dk\/blog\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/www.bytopia.dk\/blog\/wp-json\/wp\/v2\/comments?post=589"}],"version-history":[{"count":1,"href":"https:\/\/www.bytopia.dk\/blog\/wp-json\/wp\/v2\/posts\/589\/revisions"}],"predecessor-version":[{"id":590,"href":"https:\/\/www.bytopia.dk\/blog\/wp-json\/wp\/v2\/posts\/589\/revisions\/590"}],"wp:attachment":[{"href":"https:\/\/www.bytopia.dk\/blog\/wp-json\/wp\/v2\/media?parent=589"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.bytopia.dk\/blog\/wp-json\/wp\/v2\/categories?post=589"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.bytopia.dk\/blog\/wp-json\/wp\/v2\/tags?post=589"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}