ScholarLens Back to search
2001•Jounal of Xidian UniversityRequires access

Anonymity revocable divisible e cash system

Hu Yu

Open publisher page 1 citations

Abstract

An anonymity revocable divisible e cash system is firstly presented with the introduction of a Trustee. A very simple method instead of Okamotos complex binary tree presentation technique is used to construct a divisible e cash system, thus making the system not only efficient but also preventing crimes by using the anonymity of a coin. Since a coin can be spent legally several times, there is no double spending but over spending. In the system, the trustee is off line entirely, and does not need to be involved in any protocol expect the owner/coin tracing and over spending check protocols.

About this research paper

What this paper is about

An anonymity revocable divisible e cash system is firstly presented with the introduction of a Trustee. A very simple method instead of Okamotos complex binary tree presentation technique is used to construct a divisible e cash system, thus making the system not only efficient but also preventing crimes by using the anonymity of a coin. Since a coin can be spent legally several times, there is no double spending but over spending. In the system, the trustee is off line entirely, and does not need to be involved in any protocol expect the owner/coin tracing and over spending check protocols.

Why it matters

OpenAlex reports 1 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

An anonymity revocable divisible e cash system is firstly presented with the introduction of a Trustee. A very simple method instead of Okamotos complex binary tree presentation technique is used to construct a divisible e cash system, thus making the system not only efficient but also preventing crimes by using the anonymity of a coin. Since a coin can be spent legally several times, there is no double spending but over spending. In the system, the trustee is off line entirely, and does not need to be involved in any protocol expect the owner/coin tracing and over spending check protocols.

Key concepts: Anonymity, Computer science, Computer security, Simple (philosophy), Tracing, Cash, Protocol (science), Electronic cash

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Anonymity revocable divisible e cash system — Research Paper | ScholarLens