Pairing-Based Dynamic Threshold Secret Sharing Scheme

In this paper, we propose the PBDT, a novel secret sharing scheme which outperforms current constructions in the distributed wireless network environment. In our scheme, each participant selects his secret share respectively without negotiating with a central node. One secret share can extract several messages without renewing when new participants are added or old participants are deleted. And its share verification phase allows any participant to verify its authenticity and validity. PBDT proves to be practically efficient and computationally secure to resist collision attack, especially for distributed wireless networks.