A SECRET SHARING SCHEME BASED ON MULTIVARIATE POLYNOMIALS

Ari Dwi Hartanto, Sutjijana Sutjijana


DOI: https://doi.org/10.14710/jfma.v2i2.41

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.


Full Text:

PDF

References


K. Saniee, “A simple expression for multivariate lagrange interpolation,” SIAM, vol.1, no.1, pp.1–9, 2007.

A. Shamir, “How to share a secret,” Communications of the ACM, vol.22, pp.612–613, 1979.

D. Stinson, Cryptography: Theory and Practice, Third Edition, CRC Press, Inc., Florida, 2006.

T, Tassa, T., N. Dyn, “Multipartite secret sharing by bivariate interpolation,” Journal of Cryptology, vol.22, no.2, pp.227–258, 2006.


Refbacks

  • There are currently no refbacks.


Publisher:

Department of Mathematics, Faculty of Science and Mathematics, Diponegoro University

Mailing address: Jl. Prof Soedarto, SH, Tembalang, Semarang, Indonesia 50275

Telp./Fax             : (+6224) 70789493 / (+62224) 76480922

Website              : www.math.fsm.undip.ac.id

E-mail                : admin.math@live.undip.ac.id

 

Indexed in:

GOOGLE SCHOLAR CROSSREF SINTA PORTAL GARUDA SCILIT DIMENSIONS