• ثبت نام
    • ورود به سامانه
    مشاهده مورد 
    •   صفحهٔ اصلی
    • نشریات انگلیسی
    • The ISC International Journal of Information Security
    • Volume 14, Issue 1
    • مشاهده مورد
    •   صفحهٔ اصلی
    • نشریات انگلیسی
    • The ISC International Journal of Information Security
    • Volume 14, Issue 1
    • مشاهده مورد
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    An Efficient Pairing-Free Identity-Based Certificateless Signcryption

    (ندگان)پدیدآور
    Banaeian Far, SaeedRajabzadeh Assar, Maryam
    Thumbnail
    دریافت مدرک مشاهده
    FullText
    اندازه فایل: 
    1.168 مگابایت
    نوع فايل (MIME): 
    PDF
    نوع مدرک
    Text
    Research Article
    زبان مدرک
    English
    نمایش کامل رکورد
    چکیده
    A certificateless (CL) signcryption scheme is a cryptographic primitive that provides user authentication and message confidentiality at the same time. CL signcryption schemes (as a type of certificateless encryption scheme) have solved problems concerning malicious server presentation, and the server who issues users' partial private keys and certificates cannot obtain users' signing keys. Therefore, the CL signcryption scheme is an excellent choice for protecting users' signing keys and providing user authentication and message confidentiality. Moreover, signcryption schemes have lower computational costs than signature and encryption schemes. The present study presents a short and efficient CL signcryption scheme based on the hyperelliptic curve (HC). Applying HC as the calculation base for designing the presented CL signcryption scheme reduces key-length from 160 bits to 80. The presented CL signcryption scheme is shorter than other recently-proposed ones with regard to communication overhead with its less than one-third shorter length compared to the shortest of the others. Moreover, it is more efficient than other recently-proposed CL signcryption schemes in the user-side computational cost, including the \textit{key generation} and \textit{user key generation} phases that have been halved in total. Finally, the security of the presented CL signcryption scheme was analyzed in the random oracle (RO) model based on the hardness of the point factorization problem (PFP) on HC.
    کلید واژگان
    Certificateless Signcryption
    Efficiency
    Hyperelliptic Curve
    Point Factorization problem
    Random Oracle

    شماره نشریه
    1
    تاریخ نشر
    2022-01-01
    1400-10-11
    ناشر
    Iranian Society of Cryptology
    سازمان پدید آورنده
    Department of Electrical and Computer Engineering, Science and Research Branch Islamic Azad University, Tehran, Iran
    Department of Electrical and Computer Engineering, Science and Research Branch Islamic Azad University, Tehran, Iran

    شاپا
    2008-2045
    2008-3076
    URI
    https://dx.doi.org/10.22042/isecure.2021.261788.587
    http://www.isecure-journal.com/article_135755.html
    https://iranjournals.nlai.ir/handle/123456789/861764

    مرور

    همه جای سامانهپایگاه‌ها و مجموعه‌ها بر اساس تاریخ انتشارپدیدآورانعناوینموضوع‌‌هااین مجموعه بر اساس تاریخ انتشارپدیدآورانعناوینموضوع‌‌ها

    حساب من

    ورود به سامانهثبت نام

    آمار

    مشاهده آمار استفاده

    تازه ترین ها

    تازه ترین مدارک
    © کليه حقوق اين سامانه برای سازمان اسناد و کتابخانه ملی ایران محفوظ است
    تماس با ما | ارسال بازخورد
    قدرت یافته توسطسیناوب