CryptoDB
Fast Batch Verification for Modular Exponentiation and Digital Signatures
Authors: |
- Mihir Bellare
- Juan A. Garay
- Tal Rabin
|
Download: |
- URL: http://eprint.iacr.org/1998/007
- Search ePrint
- Search Google
|
Abstract: |
Many tasks in cryptography (e.g., digital signature
verification) call for verification of a basic operation like modular
exponentiation in some group: given (g,x,y) check that g<sup>x</sup>=y.
This is typically done by re-computing g<sup>x</sup> and checking we get y.
We would like to do it differently, and faster.
The approach we use is batching. Focusing first on the basic modular
exponentiation operation, we provide some probabilistic batch verifiers, or
tests, that verify a sequence of modular exponentiations significantly faster
than the naive re-computation method. This yields speedups for several
verification tasks that involve modular exponentiations.
Focusing specifically on digital signatures, we then suggest a weaker notion of
(batch) verification which we call ``screening.'' It seems useful for many
usages of signatures, and has the advantage that it can be done very fast;
in particular, we show how to screen a sequence of RSA signatures at the
cost of one RSA verification plus hashing.
|
BibTeX
@misc{eprint-1998-11304,
title={Fast Batch Verification for Modular Exponentiation and Digital Signatures},
booktitle={IACR Eprint archive},
keywords={Modular exponentiation, digital signatures, verification, RSA, DSS, batching, program checking.},
url={http://eprint.iacr.org/1998/007},
note={Appeared in the THEORY OF CRYPTOGRAPHY LIBRARY and has been included in the ePrint Archive. mihir@cs.ucsd.edu 10500 Received March 8, 1998. Revised June 16th, 1998.},
author={Mihir Bellare and Juan A. Garay and Tal Rabin},
year=1998
}