𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On threshold schemes from large sets

✍ Scribed by Tuvi Etzion

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
832 KB
Volume
4
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis

An anonymous ( t , w)-threshold scheme is one of the schemes for secret sharing. Combinatorial designs and especially large sets of Steiner systems and of Steiner systems "with holes" have an important role in the design of perfect ( t , w)-threshold schemes. In this article we investigate perfect (4,4)-threshold schemes. We use large sets to form such systems with a large number of keys. In particular we construct the first known infinite families of large sets of H-designs with block size 4.

πŸ“œ SIMILAR VOLUMES

On dynamic threshold schemes
On dynamic threshold schemes
✍ Hung-Min Sun; Shiuh-Pyng Shieh πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 460 KB
On large sets of Pk-decompositions
On large sets of Pk-decompositions
✍ Yanfang Zhang πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 81 KB πŸ‘ 1 views

Let G ΒΌ Γ°VΓ°GÞ; EΓ°GÞÞ be a graph. A Γ°v v v; G; Þ-GD is a partition of all the edges of LGD. In this paper, we obtain a general result by using the finite fields, that is, if q ! k ! 2 is an odd prime power, then there exists a Γ°q; P k ; k Γ€ 1Þ-LGD.

On large distances in planar sets
On large distances in planar sets
✍ Katalin Vesztergombi πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 383 KB

Let n k denote the number of times the kth largest distance occurs among a set S of n points in the Euclidean plane. We prove that n2 ~< 2~n for arbitrary set S. This upper bound is sharp. We consider the set S of n arbitrary points in R 2. We denote the largest distance between two points in S by