Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In this article,  propose a (t,n) threshold verifiable multi-secret sharing scheme, in which to reconstruct t secrets needs to solve t simultaneous equations. The analysis results show that our scheme is as easy as Yang's scheme [8] in the secret reconstruction and requires less public values than Chien's [7] and Yang's schemes. Furthermore, the shares in our scheme can be verified their validity with t public values based on ECDLP, and there are two verified forms: one is computationally secure as Feldman 's scheme [12] and other is unconditionally secure as Pedersen's scheme [13]. In addition, for the main computation: a i,1 P 1  + a i,2 P 2  +  hellip  + a i,t P t  in our scheme,  present a new method based on the signed factorial expansion and implement it, the results show that it is more efficient than the current public methods. Thus our scheme is a secure and efficient (t,n) threshold verified multi-secret sharing scheme.
['Ruanhua Shi', 'Hong Zhong', 'Liusheng Huang']
I am writing a research paper on a idea A (t, n)-Threshold Verified Multi-secret Sharing Scheme Based on ECDLP
[{"from": "human", "value": "I am writing a research paper on a idea A (t, n)-Threshold Verified Multi-secret Sharing Scheme Based on ECDLP"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In this article,  propose a (t,n) threshold verifiable multi-secret sharing scheme, in which to reconstruct t secrets needs to solve t simultaneous equations. The analysis results show that our scheme is as easy as Yang's scheme [8] in the secret reconstruction and requires less public values than Chien's [7] and Yang's schemes. Furthermore, the shares in our scheme can be verified their validity with t public values based on ECDLP, and there are two verified forms: one is computationally secure as Feldman 's scheme [12] and other is unconditionally secure as Pedersen's scheme [13]. In addition, for the main computation: a i,1 P 1  + a i,2 P 2  +  hellip  + a i,t P t  in our scheme,  present a new method based on the signed factorial expansion and implement it, the results show that it is more efficient than the current public methods. Thus our scheme is a secure and efficient (t,n) threshold verified multi-secret sharing scheme."}]