A Multi-Secret Sharing Scheme with Many Keys Based on Hermite Interpolation

HTML  XML Download Download as PDF (Size: 2499KB)  PP. 1196-1201  
DOI: 10.4236/jamp.2014.213140    4,131 Downloads   5,019 Views  Citations
Author(s)

ABSTRACT

A secret sharing scheme is one of cryptographies. A threshold scheme, which is introduced by Shamir in 1979, is very famous as a secret sharing scheme. We can consider that this scheme is based on Lagrange's interpolation formula. A secret sharing scheme has one key. On the other hand, a multi-secret sharing scheme has more than one keys; that is, a multi-secret sharing scheme has p (2) keys. Dealers distribute shares of keys among n participants. Gathering t (n) participants, keys can be reconstructed. In this paper, we give a scheme of a (t,n) multi-secret sharing based on Hermite interpolation, in the case of pt.

Share and Cite:

Adachi, T. and Okazaki, C. (2014) A Multi-Secret Sharing Scheme with Many Keys Based on Hermite Interpolation. Journal of Applied Mathematics and Physics, 2, 1196-1201. doi: 10.4236/jamp.2014.213140.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.