skip to main content

A SECRET SHARING SCHEME BASED ON MULTIVARIATE POLYNOMIALS

*Ari Dwi Hartanto  -  Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Gadjah Mada, Indonesia
Sutjijana Sutjijana  -  Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Gadjah Mada, Indonesia

Citation Format:
Abstract

A Secret sharing scheme is a method for dividing a secret into several partial
information. The secret can be reconstructed if a certain number of partial information is collected. One of the known secret sharing schemes is the Shamir’s secret sharing scheme. It uses Lagrange interpolation (with one indeterminate) for reconstructing the secret. In this paper, we present a secret sharing scheme using multivariate polynomials with the secret reconstruction process using the multivariate interpolation formula derived by Saniee (2007). The resulted scheme can be considered as a generalization of the Shamir’s secret sharing scheme.

Fulltext View|Download

Article Metrics:

  1. K. Saniee, “A simple expression for multivariate lagrange interpolation,” SIAM, vol.1, no.1, pp.1–9, 2007
  2. A. Shamir, “How to share a secret,” Communications of the ACM, vol.22, pp.612–613, 1979
  3. D. Stinson, Cryptography: Theory and Practice, Third Edition, CRC Press, Inc., Florida, 2006
  4. T, Tassa, T., N. Dyn, “Multipartite secret sharing by bivariate interpolation,” Journal of Cryptology, vol.22, no.2, pp.227–258, 2006

Last update:

No citation recorded.

Last update:

No citation recorded.