Efficient Multi-secret Sharing Scheme Using Room Square
In 1979, secret sharing scheme was first proposed by Shamir. In a secret sharing scheme, each participant receives a secret share in such a way that only authorized subsets can reconstruct the secret. Compare with Shamirs scheme, Juan and Huang proposed an efficient secret sharing scheme from room square in 2005. Their scheme gave a practical algorithm to reduce the computation complexity by using rooM square, and obtained as (n-1, n)-threshold secret sharing scheme. However, there is not any (t, n)threshold secret sharing scheme for t≤n-2 with more efficient than Shamirs scheme has been proposed. For this reason, this paper utilizes the characteristic of cycle to design four (t, n)threshold secret sharing schemes for t=n-2.These proposed schemes are not only more efficient than previous related works in the computational complexity, but also with the information rate is approximated optimal value 1.In addition, we combine the proposed scheme and the property of room square to present a new multi-secret sharing scheme in this paper.
secret sharing scheme room square multi-use multi-secret
Ming-Jheng Li Ying-Hsuan Chang Justie Su-Tzu Juan
Department of Computer Science and Information Engineering National Chi Nan University Puli, Nantou 54561 Taiwan
国际会议
上海
英文
260-266
2009-07-08（万方平台首次上网日期，不代表论文的发表时间）