A Combinatorial Approach to Threshold Schemes

DOI10.1137/0401024zbMath0667.05008OpenAlexW2015965749MaRDI QIDQ3819079

Scott A. Vanstone, Douglas R. Stinson

Publication date: 1988

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0401024

zbMATH Keywords

Steiner systemcombinatorial designsecret sharingthreshold schemes

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Cryptography (94A60)

Related Items (19)

On the bound for anonymous secret sharing schemes ⋮ Anonymous secret sharing schemes ⋮ Constructions for anonymous secret sharing schemes using combinatorial designs ⋮ Guest editorial: Special issue in honor of Scott A. Vanstone ⋮ Extremal properties of \(t\)-SEEDs and recursive constructions ⋮ Probabilistic existence of large sets of designs ⋮ Source-location privacy full protection in wireless sensor networks ⋮ Further results on large sets of partitioned incomplete Latin squares ⋮ The existence of large set of symmetric partitioned incomplete latin squares ⋮ On the classification of ideal secret sharing schemes ⋮ A completion of \(LS(2^n4^1)\) ⋮ Incidence structures applied to cryptography ⋮ Some improved bounds on the information rate of perfect secret sharing schemes ⋮ Further results on large sets of disjoint group-divisible designs ⋮ Large sets with multiplicity ⋮ Secret sharing over infinite domains ⋮ Kirkman packing designs KPD(\(\{w,s^{\ast}\},v \)) and related threshold schemes ⋮ A combinatorial characterization of regular anonymous perfect threshold schemes ⋮ Constructions of large sets of disjoint group-divisible designs \(\mathrm{LS}(2^n 4^1)\) using a generalization of \(^*\mathrm{LS}(2^n)\)

This page was built for publication: A Combinatorial Approach to Threshold Schemes