Anonymous and non-repudiation E-cash scheme based on partially blind signature

Dissertant

al-Matari, Hani Muhammad Salih

Thesis advisor

Shilbayah, Nidal F.

Comitee Members

Aqil, Misbah M.
Tamimi, Abd al-Fattah Arif

University

Middle East University

Faculty

Faculty of Information Technology

Department

Computer Science Department

University Country

Jordan

Degree

Master

Degree Date

2011

English Abstract

The blind signature technique Considered since its inception in 1982, as a key principle in building the e-cash schemes until 1996, when emerged the concept of partially blind signature, which played an important role in building electronic cash systems: It allows the signer to include pre-agreed information such as expiration date or collateral conditions in the resulting signature.

In this thesis, we proposed a "non-repudiation and anonymous e-cash scheme based on partially blind signature".

The main motivation of electronic cash research is providing anonymity.

In fact, the unconditional anonymity may be misused for untraceable blackmailing of customers, which is called perfect crime.

Furthermore, unconditional anonymity makes ease money laundering, illegal purchase, and bank robbery.

Our proposed scheme enables the judge to specify a dishonest customer, bank, or blind office.

In addition to that, our scheme is considered as a multi-purpose scheme because it satisfies the integrity and separation of power.

We also analyze the efficiency and the security of the proposed scheme.

Multiplicative inverse is a crucial operation in public key cryptography which is used to generate blind signature or partially blind signature.

Multiplicative inverse has been widely used in cryptography.

Public key cryptography has given rise to such a need, in which we need to generate a related public and private pair of numbers, each of which is the inverse of the other.

The basic method to find multiplicative inverses is Extended-Euclidean method.

In this thesis we will propose a new algorithm for computing the inverse, based on continuous subtract fraction from integer and divide by fraction to obtain integer that will be used to compute the inverse d.

The proposed method is more efficient and faster than the existing methods.

Main Subjects

Information Technology and Computer Science

No. of Pages

73

Table of Contents

• APA
• MLA
• AMA

Language

English

Data Type

Arab Theses

Record ID

BIM-694151