Topic
Verifiable secret sharing
About: Verifiable secret sharing is a research topic. Over the lifetime, 4241 publications have been published within this topic receiving 99569 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: The main idea is to analyze how a simple reversible model of computation allows one to compute the shares and then using the reverse computation in order to recover the secret image.
24 citations
TL;DR: It can be formally proved that SDSS-MAC can achieve the confidentiality, provenance verification and integrity of data, secure key distribution, multiple collusions resistance, and attribute-revocation security as well as practical efficiency of storage, computation and communication comparing with other related schemes.
24 citations
TL;DR: Experimental results reveal that the proposed XOR-based progressive visual secret sharing scheme is superior to existing approaches with respect to performance and practicability.
24 citations
TL;DR: Two new secret sharing schemes in which cheaters are detected with high probability are presented and it is proved that the information rate of this scheme is almost optimal among all schemes with the same security requirements.
Abstract: A perfect secret sharing scheme is a method of distributing shares of a secret among a set P of participants in such a way that only qualified subsets of P can reconstruct the secret from their shares and non-qualified subsets have absolutely no information on the value of the secret. In a secret sharing scheme, some participants could lie about the value of their shares in order to obtain some illicit benefit. Therefore, the security against cheating is an important issue in the implementation of secret sharing schemes. Two new secret sharing schemes in which cheaters are detected with high probability are presented in this paper. The first one has information rate equal to 1/2 and can be implemented not only in threshold structures, but in a more general family of access structures. We prove that the information rate of this scheme is almost optimal among all schemes with the same security requirements. The second scheme we propose is a threshold scheme in which cheaters are detected with high probability even if they know the secret. The information rate is in this case 1/3. In both schemes, the probability of cheating successfully is a fixed value that is determined by the size of the secret.
24 citations
TL;DR: A novel scheme for the realization of single-photon dynamic quantum secret sharing between a boss and three dynamic agent groups that is more flexible and will contribute to a practical application.
24 citations