2014
DOI: 10.1080/00207160.2014.941360
|View full text |Cite
|
Sign up to set email alerts
|

Perfect secret sharing scheme based on vertex domination set

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
5
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 18 publications
(19 reference statements)
0
5
0
Order By: Relevance
“…(3) is a [8,2,6] code over F 7 with the weight enumerator 1 + 24x 6 + 24x 8 . We can then obtain nonzero codewords of C(r, 6) in this example through programming, as follows : When N 1 = 3 or N 1 = 4, the weight enumerator of some irreducible cyclic codes C(r, N ) were studied [24,26].…”
Section: A N U S C R I P Tmentioning
confidence: 99%
See 2 more Smart Citations
“…(3) is a [8,2,6] code over F 7 with the weight enumerator 1 + 24x 6 + 24x 8 . We can then obtain nonzero codewords of C(r, 6) in this example through programming, as follows : When N 1 = 3 or N 1 = 4, the weight enumerator of some irreducible cyclic codes C(r, N ) were studied [24,26].…”
Section: A N U S C R I P Tmentioning
confidence: 99%
“…An ideal secret sharing scheme is well-known to be the best efficiency that one can achieve with lowest storage complexity and the communication complexity [5,6]. We say that Γ ⊂ 2 P is an ideal access structure if there exists an ideal secret sharing scheme for Γ.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…In the most of these approaches, many researchers have proposed different constructions of a perfect secret sharing scheme based on uniform access structures which contains qualified subsets all of the same cardinality m. In these constructions, participants are represented by the vertices of a graph G, the uniform access structure Γ is based on the concept of adjacent vertices and represented by the edges, for more details see for instance [4,18,3,14,6,13]. In [2] a novel approach to design a graph access structure, which is based on the concept of non-adjacent vertices, was proposed. In this approach, an independent dominating set of vertices in a graph G was introduced and applied as a novel idea to construct a perfect secret sharing scheme such that the vertices of the graph represent the participants and the dominating set of vertices in G represents the minimal qualified set.…”
Section: Introductionmentioning
confidence: 99%
“…In Perfect secret sharing scheme based on vertex domination set [4], the authors present a method for protecting secret data. They introduce the novel idea of constructing a secretsharing scheme using a graph G whose vertices represent the participants and the dominating set of vertices in G represents the minimal authorized set.…”
mentioning
confidence: 99%