Abstract: 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
For citation:
Medvedev N. V., Titov S. S. Almost-threshold secret sharing schemes on elliptic curves. Doklady Tomskogo gosudarstvennogo universiteta sistem upravleniya i radioelektroniki, 2011, no. 1(23), pp. 91–95.
Authors and copyright holders:
—
Last issue
-2026-1_%D0%BA%D0%BE%D0%BF%D0%B8%D1%8F.jpg)
Editorial office address
Executive Secretary of the Editor’s Office
Editor’s Office: 40 Lenina Prospect, Tomsk, 634050, Russia
Phone / Fax: + 7 (3822) 701-582
Viktor N. Maslennikov
Executive Secretary of the Editor’s Office
Editor’s Office: 40 Lenina Prospect, Tomsk, 634050, Russia
Phone / Fax: + 7 (3822) 51-21-21 / 51-43-02
Subscription for updates
