Low-Computation Partially Blind Signatures for Electronic Cash

Chun-I FAN; Chin-Laung LEI

Low-Computation Partially Blind Signatures for Electronic Cash

Chun-I FAN, Chin-Laung LEI

Full Text Views

0

Cite this

Summary :

In a secure partially blind signature scheme, the signer assures that the blind signatures issued by him contains the information he desires. The techniques make it possible to minimize the unlimited growth of the bank's database which storing all spent electronic cash in an anonymous electronic cash system. In this paper we propose an efficient partially blind signature scheme for electronic cash. In our scheme, only several modular additions and modular multiplications are required for a signature requester to obtain and verify a signature. It turns out that the proposed scheme is suitable for mobile clients and smart-card applications because no time-consuming computations are required, such as modular exponentiation and inverse computations. Comparing with the existing blind signature schemes proposed in the literatures, our method reduces the amount of computations for signature requesters by almost 98%.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.5 pp.818-824

Publication Date: 1998/05/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)

Category

Cite this

Copy

Chun-I FAN, Chin-Laung LEI, "Low-Computation Partially Blind Signatures for Electronic Cash" in IEICE TRANSACTIONS on Fundamentals, vol. E81-A, no. 5, pp. 818-824, May 1998, doi: .
Abstract: In a secure partially blind signature scheme, the signer assures that the blind signatures issued by him contains the information he desires. The techniques make it possible to minimize the unlimited growth of the bank's database which storing all spent electronic cash in an anonymous electronic cash system. In this paper we propose an efficient partially blind signature scheme for electronic cash. In our scheme, only several modular additions and modular multiplications are required for a signature requester to obtain and verify a signature. It turns out that the proposed scheme is suitable for mobile clients and smart-card applications because no time-consuming computations are required, such as modular exponentiation and inverse computations. Comparing with the existing blind signature schemes proposed in the literatures, our method reduces the amount of computations for signature requesters by almost 98%.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e81-a_5_818/_p

Copy

@ARTICLE{e81-a_5_818,
author={Chun-I FAN, Chin-Laung LEI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Low-Computation Partially Blind Signatures for Electronic Cash},
year={1998},
volume={E81-A},
number={5},
pages={818-824},
abstract={In a secure partially blind signature scheme, the signer assures that the blind signatures issued by him contains the information he desires. The techniques make it possible to minimize the unlimited growth of the bank's database which storing all spent electronic cash in an anonymous electronic cash system. In this paper we propose an efficient partially blind signature scheme for electronic cash. In our scheme, only several modular additions and modular multiplications are required for a signature requester to obtain and verify a signature. It turns out that the proposed scheme is suitable for mobile clients and smart-card applications because no time-consuming computations are required, such as modular exponentiation and inverse computations. Comparing with the existing blind signature schemes proposed in the literatures, our method reduces the amount of computations for signature requesters by almost 98%.},
keywords={},
doi={},
ISSN={},
month={May},}

Copy

TY - JOUR
TI - Low-Computation Partially Blind Signatures for Electronic Cash
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 818
EP - 824
AU - Chun-I FAN
AU - Chin-Laung LEI
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 1998
AB - In a secure partially blind signature scheme, the signer assures that the blind signatures issued by him contains the information he desires. The techniques make it possible to minimize the unlimited growth of the bank's database which storing all spent electronic cash in an anonymous electronic cash system. In this paper we propose an efficient partially blind signature scheme for electronic cash. In our scheme, only several modular additions and modular multiplications are required for a signature requester to obtain and verify a signature. It turns out that the proposed scheme is suitable for mobile clients and smart-card applications because no time-consuming computations are required, such as modular exponentiation and inverse computations. Comparing with the existing blind signature schemes proposed in the literatures, our method reduces the amount of computations for signature requesters by almost 98%.
ER -