2010Jisuanji gongchengRequires access

Verifiable Multi-secret Sharing Scheme Based on ECC

Jianzhong Zhang, Lan Jianqing

Open publisher page 3 citations

Abstract

In existing scheme,the dealer chooses and delivers secret information to every participant,so a secure channel between them is necessary,and in the recovery phase,the scheme can not check whether every participant provides the true information.Aiming at such shortcomings,the paper proposes a verifiable multi-secret sharing scheme based on ECC.Each participant’s secret shadow is selected and kept by the participant himself.The shadows do not need to be changed when the shared secret is renewed,and many secrets can be recovered one time.The scheme can check whether each participant provides the true information,so a secure channel between them is unnecessary.

About this research paper

What this paper is about

In existing scheme,the dealer chooses and delivers secret information to every participant,so a secure channel between them is necessary,and in the recovery phase,the scheme can not check whether every participant provides the true information.Aiming at such shortcomings,the paper proposes a verifiable multi-secret sharing scheme based on ECC.Each participant’s secret shadow is selected and kept by the participant himself.The shadows do not need to be changed when the shared secret is renewed,and many secrets can be recovered one time.The scheme can check whether each participant provides the true information,so a secure channel between them is unnecessary.

Why it matters

OpenAlex reports 3 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

In existing scheme,the dealer chooses and delivers secret information to every participant,so a secure channel between them is necessary,and in the recovery phase,the scheme can not check whether every participant provides the true information.Aiming at such shortcomings,the paper proposes a verifiable multi-secret sharing scheme based on ECC.Each participant’s secret shadow is selected and kept by the participant himself.The shadows do not need to be changed when the shared secret is renewed,and many secrets can be recovered one time.The scheme can check whether each participant provides the true information,so a secure channel between them is unnecessary.

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

Related papers

Back to paper searchBrowse research topicsOriginal source
Verifiable Multi-secret Sharing Scheme Based on ECC — Research Paper | ScholarLens