Secret sharing schemes for graph-based prohibited structures
Hung-Min Sun,Shiuh-Pyng Shieh +1 more
TLDR
This paper proposes an efficient construction of perfect secret sharing schemes for graph-based prohibited structures where a vertex denotes a participant and an edge does a pair of participants who cannot recover the master key.Abstract:
A secret sharing scheme for the prohibited structure is a method of sharing a master key among a finite set of participants in such a way that only certain prespecified subsets of participants cannot recover the master key. A secret sharing scheme is called perfect, if any subset of participants who cannot recover the master key obtains no information regarding the master key. In this paper, we propose an efficient construction of perfect secret sharing schemes for graph-based prohibited structures where a vertex denotes a participant and an edge does a pair of participants who cannot recover the master key. The information rate of our scheme is 2n, where n is the number of participants.read more
Citations
More filters
Journal ArticleDOI
A unified approach to secret sharing schemes with low distribution cost
TL;DR: A unified approach for both threshold‐based schemes and generalized group‐oriented cryptosystems is proposed, which requires much less overhead than its counterparts when various secret sharing problems are simultaneously involved.
Journal ArticleDOI
A New Verifiable Multi-secret Sharing Scheme Realizing Adversary Structure
TL;DR: A verifiable multi-secret sharing scheme based on one-way hash function that realizes adversary structure, in which each participant has only one reusable shadow, which has the advantages of better verifiability and fewer shadows preserves by every participant respect to other schemes realizing adversary structures.
Journal ArticleDOI
Fundamental circuits and cut-sets used in cryptography
R. Selvakumar,Nishant Gupta +1 more
TL;DR: This paper presents an innovative algorithm for encryption and decryption using connected graphs, which leads to more secure data transfer.
Journal ArticleDOI
A label graph based verifiable secret sharing scheme for general access structures
TL;DR: A verifiable secret sharing scheme realizing general access structures is proposed that can resist possible internal attack performed by malicious participants, who want to obtain additional shares or provide a fake share to other participants.
Journal ArticleDOI
New construction of perfect secret sharing schemes for graph-based prohibited structures
TL;DR: This paper proposes a new construction for perfect secret sharing schemes with graph-based prohibited structures that has an improvement on the information rate.
References
More filters
Journal ArticleDOI
On the information rate of perfect secret sharing schemes
TL;DR: A method to derive information-theoretical upper bounds on the optimal information rate and the optimal average information rate of perfect secret sharing schemes based on connected graphs on six vertices is discussed.
Journal ArticleDOI
Multiple assignment scheme for sharing secret
TL;DR: By observing a simple set-theoretic property of an access structure, this paper proposes its mathematical definition and proves that every family satisfying the definition is realized by assigning two more shadows of a threshold scheme to trustees.
Book ChapterDOI
New General Lower Bounds on the Information Rate of Secret Sharing Schemes
TL;DR: Two combinatorial techniques are used to apply a decomposition construction in obtaining general lower bounds on information rate and average information rate of certain general classes of access structures.
Book ChapterDOI
Multisecret threshold schemes
TL;DR: This paper considers the situation where there is a secret sK associated with each k-subset K of participants and sK can be reconstructed by any group of t participants in K (t ? k).
Journal ArticleDOI
An efficient construction of perfect secret sharing schemes for graph-based structures
Hung-Min Sun,Shiuh-Pyng Shieh +1 more
TL;DR: This paper presents an efficient construction of perfect secret sharing schemes for graph-based access structures where a vertex denotes a participant and an edge does a qualified pair of participants and an application of the scheme to the reduction of storage and computation loads on the communication granting server in a secure network.