Title: An Efficient(t,n) Threshold Multi-Secret Sharing Scheme
Abstract: With the two-variable one-way function,a novel(t,n) threshold multi-secret sharing scheme was presented to overcome Chien-Jan-Tseng scheme's drawback about a large amount of computation and Yang-Chang-Hwang scheme's drawback about lots of public values.Multiple secrets can be shared in one sharing session,and each participant's secret shadow is as long as each of the shared secrets.In the recovery phase,each cooperative participant only needs to submit a pseudo-shadow instead of his secret shadow,and his secret shadow cannot be disclosed.Integrating the advantages of the existing schemes and avoiding their disadvantages,so this scheme is a practical and efficient secret sharing scheme.
Publication Year: 2006
Publication Date: 2006-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 2
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot