ASecret Sharing Scheme of Identity-based Private Key
Liang Bin-mei · Jisuanji gongcheng · 2012
Threshold cryptographic scheme based on bilinear pairings depends too much on the bilinear pairing tool,but the computation of the bilinear pairing is very time-consuming so that the efficiency of secret sharing scheme is affected badly.By using Shamir threshold sharing scheme,this paper proposes a new method which threshold shares in the bilinear group.Its based-identity private key can be shared through the secret sharing scheme for integers.Analysis result shows that the new method needs only two times bilinear pairing computations and can be used to further design efficient identity based threshold cryptographic schemes.