Multi-secret Sharing Scheme Based on Bilinear Maps

This paper proposes a(t,n)-threshold multi-secret sharing scheme based on bilinear maps.In this scheme,each participant's secret shadow is selected by the participant himself and only one reusable secret shadow is required to be kept by each participant for sharing multiple secrets.There is no secure channel and static secret-publisher needed in this proposed scheme.The participants can communicate in a public channel,and only 3 public values are required for one secret sharing.It can checkout the cheat among participants and verify the correctness of secrets while the scheme is working.Therefore,it is high secure and efficient.