Wang Xiao-feng, Lin Ting-ting, Wang Shang-ping, Zhang Ya-ling. Limited Confederate Verifier Signatures[J]. Journal of Electronics & Information Technology, 2008, 30(4): 991-994. doi: 10.3724/SP.J.1146.2006.01507
Citation:
Wang Xiao-feng, Lin Ting-ting, Wang Shang-ping, Zhang Ya-ling. Limited Confederate Verifier Signatures[J]. Journal of Electronics & Information Technology, 2008, 30(4): 991-994. doi: 10.3724/SP.J.1146.2006.01507
Wang Xiao-feng, Lin Ting-ting, Wang Shang-ping, Zhang Ya-ling. Limited Confederate Verifier Signatures[J]. Journal of Electronics & Information Technology, 2008, 30(4): 991-994. doi: 10.3724/SP.J.1146.2006.01507
Citation:
Wang Xiao-feng, Lin Ting-ting, Wang Shang-ping, Zhang Ya-ling. Limited Confederate Verifier Signatures[J]. Journal of Electronics & Information Technology, 2008, 30(4): 991-994. doi: 10.3724/SP.J.1146.2006.01507
The precise definition and security model of a new signature scheme-limited confederate verifier signatures is proposed based on the idea of threshold. An efficient limited confederate verifier signatures scheme is also constructed for the first time. The new scheme allows confining the right to learn the message and the right to verify the signature within t verifiers, the signature can be verified iff all the t verifiers cooperate. Moreover, the size of the signature does not grow with the number of verifiers. The scheme is proved to achieve the desired security request under the random oracle model.