Almost-threshold secret sharing schemes on elliptic curves

Download article in PDF format

Authors: Medvedev N. V., Titov S. S.

Annotation: The article describes secret sharing schemes based on polynomials on elliptic curves. The structure of access and basic properties of such schemes are studied. The theorem on qualified coalitions is proved. The example is given.

Keywords: secret sharing schemes, elliptic curves, polynomials, the structure of access, threshold schemes, cycles, matroids, finite fields