A Fast Signature Scheme Based on New On-line Computation

Abstract

AbstractIn this paper, we propose a fast signature scheme which realizes short transmissions and minimal on-line computation. Our scheme would require a modular exponentiation as preprocessing (i.e., off-line computation). However, there exist the following remarkable properties: neither multiplication and modular reduction is used in the actual signature generation (i.e., on-line computation). This means that in the on-line phase, our scheme requires only two operations: hashing and addition. So far, some fast signature schemes with small on-line computation are proposed. However, those schemes require multiplication or modular reduction in the on-line phase. This leads to a large amount of work compared to that of addition. As far as we know, this is the first approach to obtain the fast signature without those two calculus methods.KeywordsHash FunctionSignature SchemeRandom OracleRandom Oracle ModelModular ReductionThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.