مقاله انگلیسی رایگان در مورد رمزیابی در مورد یک طرح امضایی مستور مبتنی بر شبکه بهینه round برای خدمات ابری – الزویر ۲۰۱۹
مشخصات مقاله | |
ترجمه عنوان مقاله | رمزیابی در مورد “یک طرح امضایی مستور مبتنی بر شبکه بهینه round برای خدمات ابری” |
عنوان انگلیسی مقاله | Cryptoanalysis on ‘A round-optimal lattice-based blind signature scheme for cloud services’ |
انتشار | مقاله سال ۲۰۱۹ |
تعداد صفحات مقاله انگلیسی | ۴ صفحه |
هزینه | دانلود مقاله انگلیسی رایگان میباشد. |
پایگاه داده | نشریه الزویر |
نوع نگارش مقاله |
مقاله پژوهشی (Research Article) |
مقاله بیس | این مقاله بیس نمیباشد |
نمایه (index) | Scopus – Master Journals List – JCR |
نوع مقاله | ISI |
فرمت مقاله انگلیسی | |
ایمپکت فاکتور(IF) |
۷٫۰۰۷ در سال ۲۰۱۸ |
شاخص H_index | ۹۳ در سال ۲۰۱۹ |
شاخص SJR | ۰٫۸۳۵ در سال ۲۰۱۸ |
شناسه ISSN | ۰۱۶۷-۷۳۹X |
شاخص Quartile (چارک) | Q1 در سال ۲۰۱۸ |
مدل مفهومی | ندارد |
پرسشنامه | ندارد |
متغیر | ندارد |
رفرنس | دارد |
رشته های مرتبط | مهندسی کامپیوتر |
گرایش های مرتبط | رایانش ابری، مهندسی نرم افزار، امنیت اطلاعات |
نوع ارائه مقاله |
ژورنال |
مجله | سیستم های کامپیوتری نسل آینده – Future Generation Computer Systems |
دانشگاه | Seoul National University, Seoul, Republic of Korea |
کلمات کلیدی | امضاهای مستور، رمزیابی های مبتنی بر شبکه ، رمزیابی |
کلمات کلیدی انگلیسی | Blind signatures، Lattice-based cryptosystem، Cryptoanalysis |
شناسه دیجیتال – doi |
https://doi.org/10.1016/j.future.2018.12.067 |
کد محصول | E11543 |
وضعیت ترجمه مقاله | ترجمه آماده این مقاله موجود نمیباشد. میتوانید از طریق دکمه پایین سفارش دهید. |
دانلود رایگان مقاله | دانلود رایگان مقاله انگلیسی |
سفارش ترجمه این مقاله | سفارش ترجمه این مقاله |
فهرست مطالب مقاله: |
Abstract
۱- Introduction ۲- Preliminaries ۳- The blind signature scheme by Zhu et al. ۴- Cryptoanalysis on Zhu et al. ’s blind signature scheme ۵- Discussion ۶- Conclusion References |
بخشی از متن مقاله: |
Abstract In this note, we review the article published by Zhu et al. in Future Generation Computer Systems in 2017. We show that their construction of a blind signature does not hold the correctness requirement or the blindness requirement. Discussion In this section, we briefly describe the difficulties of building provably secure blind signatures and future work. To our best knowledge, from lattices, there is one known provably secure blind signature [3]. In [3], it is well described why building a provably secure blind signature is difficult in general and why it is more difficult when it comes to working with lattices. Here is a quick summary and we refer to [3] for details. First, building a provably secure blind signature is non-trivial in general since two security requirements of a blind signature scheme, the blindness and the one-more unforgeability have somewhat conflicting characteristics. To provide the blindness, the user is given an ability to modify the signature from the signer. However, the ability must be limited only to the single signature. Otherwise, it hurts the one-more unforgeability. Secondly, building a probably secure blind signature from lattices becomes harder because in lattices, the completeness is not naturally followed. In particular, the blind signature by Ruckert [ ¨ ۳] makes use of a commitment scheme and additional interactions to overcome the incompleteness. Moreover, in lattices, RSA-style design does not work [3]: the RSA-style using preimage trapdoor functions consists of the following procedures, (1) hash, (2) blind, (3) invert, then (4) unblind. In lattice, such a style does not work due to the linearity of the function (For details, we refer to [3]). As summarized in the above, building a blind signature that is provably secure in lattices requires a careful design and rigorous security analysis. Often plausible designs fail to be provably secure [1,5,6]. Since the problem becomes harder in lattices, a rigorous study is required. One possible approach is improving the scheme by Ruckert [ ¨ ۳] by lessening the number of interactions. One might try to lessen them by sending two or more commitments at a time. Another possible approach is building a lattice-based witness indistinguishability primitive first and then applying it as a building block like in [5,6]. The aforementioned methods require further research to ensure provable security analysis and concrete scheme design. In this paper, we focus on providing cryptoanalysis of the particular scheme. We will continue the further research as a future work. |