ScholarLens Back to search
2012•Journal of Shaanxi Normal UniversityRequires access

A new verifiable(t,n) multi-secret sharing scheme

Hou Jian-chun

Open publisher page 0 citations

Abstract

According to the defects that the X-Y-W scheme can not withstand the cheating among the participants,a new verifiable(t,n) multi-secret sharing scheme is presented based on certificate and double secret shadow.This scheme meets some advantages,such as it does not need a secure channel in the system,can reduce communication costs, the cheating can be prevented from the dealer and the participants,and new shared secret can be dynamically increased etc.Comparing with the existing schemes,lower communication traffic and storage make the proposed scheme more efficient.

About this research paper

What this paper is about

According to the defects that the X-Y-W scheme can not withstand the cheating among the participants,a new verifiable(t,n) multi-secret sharing scheme is presented based on certificate and double secret shadow.This scheme meets some advantages,such as it does not need a secure channel in the system,can reduce communication costs, the cheating can be prevented from the dealer and the participants,and new shared secret can be dynamically increased etc.Comparing with the existing schemes,lower communication traffic and storage make the proposed scheme more efficient.

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

According to the defects that the X-Y-W scheme can not withstand the cheating among the participants,a new verifiable(t,n) multi-secret sharing scheme is presented based on certificate and double secret shadow.This scheme meets some advantages,such as it does not need a secure channel in the system,can reduce communication costs, the cheating can be prevented from the dealer and the participants,and new shared secret can be dynamically increased etc.Comparing with the existing schemes,lower communication traffic and storage make the proposed scheme more efficient.

Key concepts: Verifiable secret sharing, Secret sharing, Cheating, Homomorphic secret sharing, Scheme (mathematics), Computer science, Computer security, Shamir's Secret Sharing

Related papers

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