Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In a (t, n) threshold proxy signature scheme, the original signer delegates the por of signing messages to a designated proxy group of n members. Any t or more proxy signers of the group can cooperatively issue a proxy signature on behalf of the original signer, but (t - 1) or less proxy signers cannot. Previously, all of the proposed threshold proxy signature schemes have been based on the discrete logarithm problem and do not satisfy all proxy requirements. ,  propose a practical, efficient, and secure (t, n) threshold proxy signature scheme based on the RSA cryptosystem. Our scheme satisfies all proxy requirements and uses only a simple Lagrange formula to share the proxy signature key. Furthermore, our scheme requires only 5 percent of the computational overhead and 8 percent of the communicational overhead required in Kim's scheme.
['Min-Shiang Hwang', 'E. Jui-Lin Lu', 'Iuon-Chang Lin']
I am writing a research paper on a idea A practical (t, n) threshold proxy signature scheme based on the RSA cryptosystem
[{"from": "human", "value": "I am writing a research paper on a idea A practical (t, n) threshold proxy signature scheme based on the RSA cryptosystem"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In a (t, n) threshold proxy signature scheme, the original signer delegates the por of signing messages to a designated proxy group of n members. Any t or more proxy signers of the group can cooperatively issue a proxy signature on behalf of the original signer, but (t - 1) or less proxy signers cannot. Previously, all of the proposed threshold proxy signature schemes have been based on the discrete logarithm problem and do not satisfy all proxy requirements. ,  propose a practical, efficient, and secure (t, n) threshold proxy signature scheme based on the RSA cryptosystem. Our scheme satisfies all proxy requirements and uses only a simple Lagrange formula to share the proxy signature key. Furthermore, our scheme requires only 5 percent of the computational overhead and 8 percent of the communicational overhead required in Kim's scheme."}]