کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9506591 | 1340753 | 2005 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A robust (k, n) + 1 threshold proxy signature scheme based on factoring
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Proxy signature is an active cryptographic research area. Since Mambo et al. introduced the concept of proxy signature in 1996, many proxy signature schemes have been proposed. However, most of these previously proposed schemes are based on discrete logarithm problems. In this paper, we would like to propose a new robust (k, n) + 1 threshold proxy signature scheme based on factoring. In this scheme, generating a valid proxy signature needs not only any k or more members in n proxy signers but also a trusted dealer to cooperatively sign a message. To our best knowledge, this is the first (k, n) + 1 threshold proxy signature scheme based on factoring.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 166, Issue 1, 6 July 2005, Pages 35-45
Journal: Applied Mathematics and Computation - Volume 166, Issue 1, 6 July 2005, Pages 35-45
نویسندگان
RongXing Lu, ZhenFu Cao, HaoJin Zhu,