Threshold Short Signature Scheme Based on Bilinear Parings
Gao Feng-xiu · Journal of Information Engineering University · 2008
A provably secure threshold short signature based on bilinear paring is proposed.The scheme can tolerate at most t-1n/3 players compromised by the adversary, and the private key can be generated by interactions of the players,no trusted center is needed.Because bilinear paring is used,the scheme is simple,and the size of the signature is short.Finally,the scheme is proved to be existentially unforgeable against adaptive chosen message attack in random oracle model.