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

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







Certificateless Aggregate Signcryption: Security Model And A Concrete Construction Secure In The Random Oracle Model

المصدر: مجلة جامعة الملك سعود - علوم الحاسب والمعلومات
الناشر: جامعة الملك سعود
المؤلف الرئيسي: Eslami, Ziba (Author)
مؤلفين آخرين: Pakniat, Nasrollah (Co-Author)
المجلد/العدد: مج26, ع3
محكمة: نعم
الدولة: السعودية
التاريخ الميلادي: 2014
الصفحات: 276 - 286
DOI: 10.33948/0584-026-003-003
ISSN: 1319-1578
رقم MD: 973120
نوع المحتوى: بحوث ومقالات
اللغة: الإنجليزية
قواعد المعلومات: science
مواضيع:
كلمات المؤلف المفتاحية:
Certificateless Cryptography | Aggregate Signcryption | Random Oracle Model | Bilinear Pairing
رابط المحتوى:
صورة الغلاف QR قانون
حفظ في:
LEADER 02363nam a22002417a 4500
001 1716030
024 |3 10.33948/0584-026-003-003 
041 |a eng 
044 |b السعودية 
100 |9 524672  |a Eslami, Ziba  |e Author 
245 |a Certificateless Aggregate Signcryption: Security Model And A Concrete Construction Secure In The Random Oracle Model 
260 |b جامعة الملك سعود  |c 2014 
300 |a 276 - 286 
336 |a بحوث ومقالات  |b Article 
520 |b The concept of aggregate signcryption was first introduced in 2009 by Selvi et al. [Identity based aggregate signcryption schemes, Lecture Notes in Computer Science 5922 LNCS, 2009, pp. 378–397]. The aggregation process of these schemes reduces the amount of exchanged information and is particularly useful in low-bandwidth communication networks and computationally- restricted environments such as wireless sensor networks. Selvi et al.’s scheme is in the identity-based setting and suffers from the key escrow problem. The goal of this paper is to overcome this problem and propose a suitable security model for aggregate signcryption in the certificate less setting. We further propose a concrete certificate less aggregate signcryption scheme which is based on Barbosa and Farshim’s certificate less signcryption scheme [Certificate less signcryption. In: M. Abe, V. Gligor (Eds.), Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security (ASIACCS-08), ACM, New York. pp. 369–372]. We then prove the security of the proposed scheme in the random oracle model under the gap Bilinear Diffie–Hellman and computational Diffie–Hellman intractability assumptions 
653 |a علوم الحاسوب  |a قواعد البيانات  |a نموذج أوراكل  |a الشبكات اللاسكلية 
692 |b Certificateless Cryptography  |b Aggregate Signcryption  |b Random Oracle Model  |b Bilinear Pairing 
700 |9 524673  |a Pakniat, Nasrollah  |e Co-Author 
773 |c 003  |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 003  |m مج26, ع3  |o 0584  |s مجلة جامعة الملك سعود - علوم الحاسب والمعلومات  |v 026  |x 1319-1578 
856 |u 0584-026-003-003.pdf 
930 |d y  |p y 
995 |a science 
999 |c 973120  |d 973120 

عناصر مشابهة