ScholarLens Back to search
2004•Jisuanji gongcheng yu shejiRequires access

Efficient fair offline divisible E-cash scheme

Zhang Qishan

Open publisher page 0 citations

Abstract

A new efficient offline divisible E-cash scheme is presented, which aims to enhance the efficiency of divisibility of E-cash on the basis of fairness. The fairness of E-cash is realized by using the restrictive signature scheme so that the bank can revoke the anonymity of E-cash when needed with the help of the trusted third party. And its divisibility is implemented by signing all the monetary amounts of E-cash with only one pair of keys in order to reduce the complexity and computation of the scheme as well as to strengthen its security. The result of analysis indicates it is secure and efficient.

About this research paper

What this paper is about

A new efficient offline divisible E-cash scheme is presented, which aims to enhance the efficiency of divisibility of E-cash on the basis of fairness. The fairness of E-cash is realized by using the restrictive signature scheme so that the bank can revoke the anonymity of E-cash when needed with the help of the trusted third party. And its divisibility is implemented by signing all the monetary amounts of E-cash with only one pair of keys in order to reduce the complexity and computation of the scheme as well as to strengthen its security. The result of analysis indicates it is secure and efficient.

Why it matters

A significance statement is not available in the OpenAlex record.

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

A new efficient offline divisible E-cash scheme is presented, which aims to enhance the efficiency of divisibility of E-cash on the basis of fairness. The fairness of E-cash is realized by using the restrictive signature scheme so that the bank can revoke the anonymity of E-cash when needed with the help of the trusted third party. And its divisibility is implemented by signing all the monetary amounts of E-cash with only one pair of keys in order to reduce the complexity and computation of the scheme as well as to strengthen its security. The result of analysis indicates it is secure and efficient.

Key concepts: Divisibility rule, Computer science, Anonymity, Scheme (mathematics), Computer security, Cash, Digital signature, Electronic cash

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Efficient fair offline divisible E-cash scheme — Research Paper | ScholarLens