2006Unpublished venueRequires access

A Fair Off-line Electronic Cash Scheme Based on RSA Partially Blind Signature

Changji Wang, Hennong Xuan

Open publisher page 6 citations

Abstract

Current fair electronic cash schemes are mostly based on discrete logarithm problem on finite field or elliptic curve over finite field. However, the RSA is widely accepted as the industrial standard in practice. It is important to study how to construct an efficient fair electronic cash scheme based on the RSA cryptosystem from both a practical perspective and a pure research issue. In this paper, a simple and efficient fair electronic cash scheme is presented using RSA partially blind signature as a building block. The partially blind property aids in the practical deployment of electronic cash schemes as it allows for the easy implementation of coin expiration date and multiple coin face values. Furthermore, the fair property allows a trustee to revoke anonymity under a warrant, thus prevents crime such as blackmailing, money laundering and illegal purchase

About this research paper

What this paper is about

Current fair electronic cash schemes are mostly based on discrete logarithm problem on finite field or elliptic curve over finite field. However, the RSA is widely accepted as the industrial standard in practice. It is important to study how to construct an efficient fair electronic cash scheme based on the RSA cryptosystem from both a practical perspective and a pure research issue. In this paper, a simple and efficient fair electronic cash scheme is presented using RSA partially blind signature as a building block. The partially blind property aids in the practical deployment of electronic cash schemes as it allows for the easy implementation of coin expiration date and multiple coin face values. Furthermore, the fair property allows a trustee to revoke anonymity under a warrant, thus prevents crime such as blackmailing, money laundering and illegal purchase

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Current fair electronic cash schemes are mostly based on discrete logarithm problem on finite field or elliptic curve over finite field. However, the RSA is widely accepted as the industrial standard in practice. It is important to study how to construct an efficient fair electronic cash scheme based on the RSA cryptosystem from both a practical perspective and a pure research issue. In this paper, a simple and efficient fair electronic cash scheme is presented using RSA partially blind signature as a building block. The partially blind property aids in the practical deployment of electronic cash schemes as it allows for the easy implementation of coin expiration date and multiple coin face values. Furthermore, the fair property allows a trustee to revoke anonymity under a warrant, thus prevents crime such as blackmailing, money laundering and illegal purchase

Key concepts: Electronic cash, Blind signature, Discrete logarithm, Electronic money, Electronic signature, Computer security, Anonymity, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
A Fair Off-line Electronic Cash Scheme Based on RSA Partially Blind Signature — Research Paper | ScholarLens