Verifiable Social Multi-Secret Sharing Secure in Active Adversarial Model

Social secret sharing, introduced in 2010 by Nojoumian et al., allows to share a secret among a set of participants whose authorities can vary over time. However, existing social secret sharing schemes are only capable of sharing one secret during each execution. To overcome this drawback, in this paper, we employ symmetric encryption schemes to propose a social multi-secret sharing scheme. It is proved that the proposed scheme provides computational security in the active mobile adversary. Moreover, to indicate the eciency of the proposed scheme, comparison with existing (single) social secret sharing schemes is provided.