Attacking and repairing batch verification schemes (2000)
| Venue: | IN ADVANCES IN CRYPTOLOGY— ASIACRYPT 00 |
| Citations: | 15 - 3 self |
BibTeX
@INPROCEEDINGS{Boyd00attackingand,
author = {Colin Boyd and Chris Pavlovski},
title = {Attacking and repairing batch verification schemes},
booktitle = {IN ADVANCES IN CRYPTOLOGY— ASIACRYPT 00},
year = {2000},
pages = {58--71},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Batch verification can provide large computational savings when several signatures, or other constructs, are verified together. Several batch verification algorithms have been published in recent years, in particular for both DSA-type and RSA signatures. We describe new attacks on several of these published schemes. A general weakness is explained which applies to almost all known batch verifiers for discrete logarithm based signature schemes. It is shown how this weakness can be eliminated given extra properties about the underlying group structure. A new general batch verifier for exponentiation in any cyclic group is also described as well as a batch verifier for modified RSA signatures.
