کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
453455 694856 2007 4 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A practical verifiable multi-secret sharing scheme
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
A practical verifiable multi-secret sharing scheme
چکیده انگلیسی

C.-C. Yang, T.-Y. Chang, M.-S. Hwang [C.-C. Yang, T.-Y. Chang, M.-S. Hwang, A (t,n) multi-secret sharing scheme, Applied Mathematics and Computation 151 (2004) 483–490] proposed an efficient multi-secret sharing scheme based on a two-variable one-way function in 2004. But the scheme doesn't have the property of verification. A practical verifiable multi-secret sharing scheme, which is based on the YCH scheme and the intractability of the discrete logarithm, is proposed in this paper. Our scheme solves the problems in the YCH scheme; each participant chooses her/his own shadow by her/himself, so the system doesn't need a security channel and the cost of the system can be lowered. The scheme can be used in practice widely.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Standards & Interfaces - Volume 29, Issue 1, January 2007, Pages 138–141
نویسندگان
, , ,