Related Experiment Video
Updated: May 27, 2025

Construction and Systematical Symmetric Studies of a Series of Supramolecular Clusters with Binary or Ternary Ammonium Triphenylacetates
Published on: February 15, 2016
Conjunctive hierarchical secret sharing by finite geometry
Máté Gyarmati1, Péter Ligeti1,2, Peter Sziklai3,4
1Department of Computeralgebra, Eötvös Loránd University, Budapest, Hungary.
Abstract:
Secret sharing is a general method for distributing sensitive data among the participants of a system such that only a collection of predefined qualified coalitions can recover the secret data. One of the most widely used special cases is threshold secret sharing, where every subset of participants of size above a given number is qualified. In this short note, we propose a general construction for a generalized threshold scheme, called conjunctive hierarchical secret sharing, where the participants are divided into disjoint levels of hierarchy, and there are different thresholds for all levels, all of which must be satisfied by qualified sets. The construction is the first method for arbitrary parameters based on finite geometry arguments and yields an improvement in the size of the underlying finite field in contrast with the existing results using polynomials.
Related Concept Videos
Coordination Number and Geometry
Singularity Functions for Shear
Second Uniqueness Theorem
In contrast, consider that the electric field is non-unique and apply Gauss's law in divergence form in the region between the conductors and the integral form to the...
Symmetric Member in Bending
SFG Algebra
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
Castigliano's Theorem

