Anonymous and non-repudiation E-cash scheme based on partially blind signature
مقدم أطروحة جامعية
al-Matari, Hani Muhammad Salih
مشرف أطروحة جامعية
أعضاء اللجنة
Aqil, Misbah M.
Tamimi, Abd al-Fattah Arif
الجامعة
جامعة الشرق الأوسط
الكلية
كلية تكنولوجيا المعلومات
القسم الأكاديمي
قسم علم الحاسوب
دولة الجامعة
الأردن
الدرجة العلمية
ماجستير
تاريخ الدرجة العلمية
2011
الملخص الإنجليزي
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.
التخصصات الرئيسية
تكنولوجيا المعلومات وعلم الحاسوب
عدد الصفحات
73
قائمة المحتويات
Table of contents.
Abstract.
Abstract in Arabic.
Chapter One : Introduction.
Chapter Two : Literature review.
Chapter Three : Fast fraction integer method (FFIM) for computing multiplicative inverse.
Chapter Four : Anonymous and non-repudiation e-cash scheme with partially blind signature.
Chapter Five : Conclusions and future work.
References.
نمط استشهاد جمعية علماء النفس الأمريكية (APA)
al-Matari, Hani Muhammad Salih. (2011). Anonymous and non-repudiation E-cash scheme based on partially blind signature. (Master's theses Theses and Dissertations Master). Middle East University, Jordan
https://search.emarefa.net/detail/BIM-694151
نمط استشهاد الجمعية الأمريكية للغات الحديثة (MLA)
al-Matari, Hani Muhammad Salih. Anonymous and non-repudiation E-cash scheme based on partially blind signature. (Master's theses Theses and Dissertations Master). Middle East University. (2011).
https://search.emarefa.net/detail/BIM-694151
نمط استشهاد الجمعية الطبية الأمريكية (AMA)
al-Matari, Hani Muhammad Salih. (2011). Anonymous and non-repudiation E-cash scheme based on partially blind signature. (Master's theses Theses and Dissertations Master). Middle East University, Jordan
https://search.emarefa.net/detail/BIM-694151
لغة النص
الإنجليزية
نوع البيانات
رسائل جامعية
رقم السجل
BIM-694151
قاعدة معامل التأثير والاستشهادات المرجعية العربي "ارسيف Arcif"
أضخم قاعدة بيانات عربية للاستشهادات المرجعية للمجلات العلمية المحكمة الصادرة في العالم العربي
تقوم هذه الخدمة بالتحقق من التشابه أو الانتحال في الأبحاث والمقالات العلمية والأطروحات الجامعية والكتب والأبحاث باللغة العربية، وتحديد درجة التشابه أو أصالة الأعمال البحثية وحماية ملكيتها الفكرية. تعرف اكثر