2010International Conference on Advanced Communication TechnologyRequires access

A novel verifiable dynamic multi-policy secret sharing scheme

Feng Wang, Lize Gu, Shihui Zheng, Yixian Yang, Zhengming Hu

Open publisher page 6 citations

Abstract

Most verifiable multi-secret sharing schemes can not distinguish the security classification because of having the common drawback of sharing secrets with the same threshold value. In order to withstand the problem, a novel verifiable dynamic multi-policy secret sharing scheme is proposed, in which the dealer can freely give any sets of group secrets for sharing according to the different threshold values, and the shadows held by the participants are not only reusable but also verifiable. The proposed scheme provides efficient solutions against the malicious dealer and participants. Moreover, the proposed scheme can add new participants and new group secrets. Compared to the current secret sharing scheme, the proposed scheme is more flexible and more practical application.

About this research paper

What this paper is about

Most verifiable multi-secret sharing schemes can not distinguish the security classification because of having the common drawback of sharing secrets with the same threshold value. In order to withstand the problem, a novel verifiable dynamic multi-policy secret sharing scheme is proposed, in which the dealer can freely give any sets of group secrets for sharing according to the different threshold values, and the shadows held by the participants are not only reusable but also verifiable. The proposed scheme provides efficient solutions against the malicious dealer and participants. Moreover, the proposed scheme can add new participants and new group secrets. Compared to the current secret sharing scheme, the proposed scheme is more flexible and more practical application.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Most verifiable multi-secret sharing schemes can not distinguish the security classification because of having the common drawback of sharing secrets with the same threshold value. In order to withstand the problem, a novel verifiable dynamic multi-policy secret sharing scheme is proposed, in which the dealer can freely give any sets of group secrets for sharing according to the different threshold values, and the shadows held by the participants are not only reusable but also verifiable. The proposed scheme provides efficient solutions against the malicious dealer and participants. Moreover, the proposed scheme can add new participants and new group secrets. Compared to the current secret sharing scheme, the proposed scheme is more flexible and more practical application.

Key concepts: Verifiable secret sharing, Secret sharing, Scheme (mathematics), Computer science, Computer security, Homomorphic secret sharing, Secure multi-party computation, Order (exchange)

Related papers

Back to paper searchBrowse research topicsOriginal source
A novel verifiable dynamic multi-policy secret sharing scheme — Research Paper | ScholarLens