A practical verifiable multi-secret sharing scheme

  • Authors:

  • Jianjie Zhao;Jianzhong Zhang;Rong Zhao

  • Affiliations:

  • College of Mathematics and Information Science, Shaanxi Normal University, Xi'an 710062, People's Republic of China;College of Mathematics and Information Science, Shaanxi Normal University, Xi'an 710062, People's Republic of China;Natural Science Institute, Xi'an University of Technology, Xi'an 710048, People's Republic of China

  • Venue:
  • Computer Standards & Interfaces
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.