Social multi-secret sharing scheme

in this paper, we introduce a Social Multi-Secret Sharing scheme based on the notion first presented by Nojoumian et. al. In this setting, multiple secrets will be sharedamong n players who receive shares based on their reputation. In order to avoid disclosure of secrets against mobile adversary,shares will be renewed through time. If players have cooperative behavior during share renewal process, their reputation value will be increased and thus they get more shares of secrets. Despitethe ability to handle multiple secrets, we show that our scheme is more efficient than Nojoumian’s scheme and is unconditionally secure.

Keywords:

Reputation , Trust , Secret Sharing , Social Secret Sharing