ارسل ملاحظاتك

ارسل ملاحظاتك لنا







Provably Secure Certificateless Strong Designated Verifier Signature Scheme Based On Elliptic Curve Bilinear Pairings

المصدر: مجلة جامعة الملك سعود - علوم الحاسب والمعلومات
الناشر: جامعة الملك سعود
المؤلف الرئيسي: Islam, SK Hafizul (Author)
مؤلفين آخرين: Biswas, G.P. (Co-Author)
المجلد/العدد: مج25, ع1
محكمة: نعم
الدولة: السعودية
التاريخ الميلادي: 2013
الصفحات: 51 - 61
DOI: 10.33948/0584-025-001-006
ISSN: 1319-1578
رقم MD: 972855
نوع المحتوى: بحوث ومقالات
اللغة: الإنجليزية
قواعد المعلومات: science
مواضيع:
كلمات المؤلف المفتاحية:
Certificateless Cryptography | Elliptic Curve Cryptosystem | Designated Verifier | Digital Signature | Bilinear Pairing
رابط المحتوى:
صورة الغلاف QR قانون
حفظ في:
LEADER 02511nam a22002417a 4500
001 1715788
024 |3 10.33948/0584-025-001-006 
041 |a eng 
044 |b السعودية 
100 |9 524449  |a Islam, SK Hafizul  |e Author 
245 |a Provably Secure Certificateless Strong Designated Verifier Signature Scheme Based On Elliptic Curve Bilinear Pairings 
260 |b جامعة الملك سعود  |c 2013 
300 |a 51 - 61 
336 |a بحوث ومقالات  |b Article 
520 |b Diffie and Hellman first invented the public key cryptosystem (PKC) wherein the public key infrastructure (PKI) is used for the management of public keys; however, the PKI-based cryptosystems suffer from heavy management trouble of public keys and certificates. An alternative solution to the PKI is Shamir’s identity-based cryptosystems (IBC), which eliminate the need of public key certificates; however, the most important shortcoming of IBC is the key escrow problem. To cope with these problems, Al-Riyami and Paterson proposed a novel scheme of certificate less PKC (CL-PKC) by combining the advantages of PKI and IBC. Since then, several certificate less signature schemes have been designed and most of them have been analyzed and proven insecure against different types of adversaries. Besides, the researchers have given very less attention to the certificate less strong designated verifier signature (CL-SDVS) scheme. Therefore, we proposed a CL-SDVS scheme using elliptic curve bilinear parings in this paper. Our scheme, which is provably secure in the random oracle model with the intractability of BDH and CDH assumptions, supports all desirable security necessities of the CL-SDVS scheme such as strangeness, source hiding and non-delegatability. The rigorous security analysis and comparison with others guarantee the better performance of the proposed scheme. 
653 |a علوم الحاسوب  |a أمن المعلومات  |a التشفير 
692 |b Certificateless Cryptography  |b Elliptic Curve Cryptosystem  |b Designated Verifier  |b Digital Signature  |b Bilinear Pairing 
700 |9 524451  |a Biswas, G.P.  |e Co-Author 
773 |c 006  |e Journal of King Saud University (Computer and Information Sciences)  |f Maǧalaẗ ǧamʼaẗ al-malīk Saud : ùlm al-ḥasib wa al-maʼlumat  |l 001  |m مج25, ع1  |o 0584  |s مجلة جامعة الملك سعود - علوم الحاسب والمعلومات  |v 025  |x 1319-1578 
856 |u 0584-025-001-006.pdf 
930 |d y  |p y 
995 |a science 
999 |c 972855  |d 972855