A SECRET SHARING SCHEME BASED ON MULTIVARIATE POLYNOMIALS | Zendy

Ari Dwi Hartanto | Zendy; Sutjijana Sutjijana | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A SECRET SHARING SCHEME BASED ON MULTIVARIATE POLYNOMIALS

Author(s) -

Ari Dwi Hartanto,

Sutjijana Sutjijana

Publication year - 2019

Publication title -

journal of fundamental mathematics and applications (jfma)

Language(s) - English

Resource type - Journals

eISSN - 2621-6035

pISSN - 2621-6019

DOI - 10.14710/jfma.v2i2.41

Subject(s) - secret sharing , shamir's secret sharing , homomorphic secret sharing , lagrange polynomial , verifiable secret sharing , scheme (mathematics) , interpolation (computer graphics) , mathematics , generalization , secure multi party computation , computer science , algorithm , cryptography , polynomial , artificial intelligence , image (mathematics) , set (abstract data type) , mathematical analysis , programming language

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 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research