An improved fast signature scheme without online multiplication

Authors:
Takeshi Okamoto;Mitsuru Tada;Atsuko Miyaji
Affiliations:
School of Information Science, Japan Advanced Institute of Science and Technology;Institute of Media and Information Technology, Chiba University;School of Information Science, Japan Advanced Institute of Science and Technology
Venue:
FC'02 Proceedings of the 6th international conference on Financial cryptography
Year:
2002

Citing 10
Cited 1

How to prove yourself: practical solutions to identification and signature problems

Proceedings on Advances in cryptology---CRYPTO '86
Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor

Proceedings on Advances in cryptology---CRYPTO '86
Zero-knowledge proofs of identity

Journal of Cryptology
Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
On the fly signatures based on factoring

CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
A "Paradoxical" Indentity-Based Signature Scheme Resulting from Zero-Knowledge

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
On Concrete Security Treatment of Signatures Derived from Identification

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
The Composite Discrete Logarithm and Secure Authentication

PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography

A new baby-step giant-step algorithm and some applications to cryptanalysis

CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a fast signature scheme which is derived from three-pass identification scheme. Our signature scheme would require a modular exponentiation as preprocessing. However, no multiplication is used in the actual (i.e. on-line) signature generation. This means that the phase involves only a hashing operation, addition and a modular reduction. So far, some fast signature schemes called on the fly signatures were proposed. In those schemes the modular reduction is eliminated in the on-line phase. Therefore, our approach to obtain the fast on-line signature is different from theirs. This paper is the first approach for the fast signature scheme without on-line modular multiplication.