ScholarLens Back to search
2009•Journal of Yangzhou UniversityRequires access

An efficient scheme for (t,n) threshold verifiable multi-secret sharing

Zhaoxia Song

Open publisher page 0 citations

Abstract

Based on the verifiable secret sharing scheme presented in 2005,a new verifiable multi-secret sharing scheme is presented via a novel method to construct sub-shadow keys on the basis of the YCH multi-secret sharing scheme in this paper.The analysis shows that new scheme can detect cheating behavior from the dealer or the cooperating participants.The new scheme performs better than existing schemes in most cases.

About this research paper

What this paper is about

Based on the verifiable secret sharing scheme presented in 2005,a new verifiable multi-secret sharing scheme is presented via a novel method to construct sub-shadow keys on the basis of the YCH multi-secret sharing scheme in this paper.The analysis shows that new scheme can detect cheating behavior from the dealer or the cooperating participants.The new scheme performs better than existing schemes in most cases.

Why it matters

A significance statement is not available in the OpenAlex record.

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

Based on the verifiable secret sharing scheme presented in 2005,a new verifiable multi-secret sharing scheme is presented via a novel method to construct sub-shadow keys on the basis of the YCH multi-secret sharing scheme in this paper.The analysis shows that new scheme can detect cheating behavior from the dealer or the cooperating participants.The new scheme performs better than existing schemes in most cases.

Key concepts: Verifiable secret sharing, Secret sharing, Homomorphic secret sharing, Scheme (mathematics), Cheating, Computer science, Construct (python library), Secure multi-party computation

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An efficient scheme for (t,n) threshold verifiable multi-secret sharing — Research Paper | ScholarLens