A Multi-secret Sharing Scheme Based on The Stern-Brocot Tree

摘要：

In 2004,Yang et al.proposed an efficient multisecret sharing scheme based on two-variable one-way function and Shamir’s secret sharing,which needs to reconstruct a(t-1)or(p-1)th degree Lagrange interpolation polynomial.This paper proposes a more efficient multi-secret sharing scheme based on Yang et al.’s scheme and the Stern-Brocot tree,which needs to reconstruct a(t-1)or(p/2-1)th degree Lagrange interpolation polynomial.Thus,the computing time and the storage cost of this scheme is less than that of Yang et al.’s scheme.

作者: Shi Runhua Zhong Hong

作者单位: School of Computer Science and Technology,Anhui University,Hefei,Anhui,PR China,230039

会议类型: 国际会议

会议名称: 第一届智能网络与智能系统国际会议(ICINIS 2008)(The First International Conference on Intelligent Networks and Intelligent Systems)

会议地点: 武汉

会议语种:英文

在线出版日期: 2008-11-01（万方平台首次上网日期，不代表论文的发表时间）