Affiliation:
1. Polska Akademia Nauk w Warszawie
Abstract
We introduce methods that use Grobner bases for secure secret sharing schemes. The description is based on polynomials in the ring R = K[X1, . . . , Xl] where identities of the participants and shares of the secret are or are related to ideals in R. Main theoretical results are related to algorithmical reconstruction of a multivariate polynomial from such shares with respect to given access structure, as a generalisation of classical threshold schemes. We apply constructive Chinese remainder theorem in R of Becker and Weispfenning. Introduced ideas find their detailed exposition in our related works
Publisher
Wojskowa Akademia Techniczna w Warszawie
Reference21 articles.
1. C. Asmuth, J. Bloom, A modular approach to key safeguarding, IEEE Trans. on Information Theory, IT-29(2):208-211, 1983.
2. T. Becker, V. Weispfenning, The Chinese remainder problem, multivariate interpolation, and Gr¨obner bases, Proc. ISSAC’91, Bonn, ACM Press, 6469, New York 1991.
3. T. Becker, V. Weispfenning, Gr¨obner Bases: A Computational Approach to Commutative Algebra, Springer-Verlag, 1993.
4. M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, 1-10, Proc. ACM STOC ’88.
5. G. Blakley, Safeguarding cryptographic keys, Proceedings of the National Computer Conference 48: 313–317, 1979.