The optimal linear multi-secret sharing scheme for non-threshold access structure(student contribution)

Dai, Shu-guang; Tang, Chunming; Chen, Yuenai

doi:10.1145/2070425.2070435

Cited by 1 publication

(4 citation statements)

References 12 publications

(18 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Without loss of generality, we assume that elements in Γ i don't include each other. Definition 1 [3] . A subset S ⊆ U is called as an i-th access set if S contains an element in Γ i .…”

Section: Definitionsmentioning

confidence: 99%

“…Definition 3 [3] . A subset T ⊆ U is called as an i-th rejected set if it does not contain any element in Γ i .…”

Section: Definitionsmentioning

confidence: 99%

“…A subset T ⊆ U is called as an i-th rejected set if it does not contain any element in Γ i . Definition 4 [3] . An i-th rejected subset T is maximal if every superset proper containing T is an i-th access set.…”

Section: Definitionsmentioning

confidence: 99%

“…An i-th rejected subset T is maximal if every superset proper containing T is an i-th access set. Definition 5 [3] . Let R i denote the collection of all maximal rejected sets of Γ i .…”

Section: Definitionsmentioning

confidence: 99%

See 3 more Smart Citations

The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures

Tang

Dai

2014

Acta Math. Appl. Sin. Engl. Ser.

Self Cite

View full text Add to dashboard Cite

In a linear multi-secret sharing scheme with non-threshold structures, several secret values are shared among n participants, and every secret value has a specified access structure. The efficiency of a multisecret sharing scheme is measured by means of the complexity σ and the randomness τ . Informally, the complexity σ is the ratio between the maximum of information received by each participant and the minimum of information corresponding to every key. The randomness τ is the ratio between the amount of information distributed to the set of users U = {1, · · · , n} and the minimum of information corresponding to every key.In this paper, we discuss σ and τ of any linear multi-secret sharing schemes realized by linear codes with non-threshold structures, and provide two algorithms to make σ and τ to be the minimum, respectively. That is, they are optimal.

show abstract

Section: Definitionsmentioning

confidence: 99%

“…Definition 3 [3] . A subset T ⊆ U is called as an i-th rejected set if it does not contain any element in Γ i .…”

Section: Definitionsmentioning

confidence: 99%

Section: Definitionsmentioning

confidence: 99%

“…An i-th rejected subset T is maximal if every superset proper containing T is an i-th access set. Definition 5 [3] . Let R i denote the collection of all maximal rejected sets of Γ i .…”

Section: Definitionsmentioning

confidence: 99%

See 2 more Smart Citations