Feldman, P. (1987) A Practical Scheme for Non-Interactive Verifiable Secret Sharing. Proceedings of 28th IEEE Symposium on Foundations of Computer Science, Los Angeles, 12-14 October 1987, 427-437.

has been cited by the following article:

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

  AUTHORS: Tomoko Adachi, Chie Okazaki

  KEYWORDS: Secret Sharing Scheme, Multi Secret Sharing Scheme, Hermite Interpolation

  JOURNAL NAME: Journal of Applied Mathematics and Physics, Vol.2 No.13, December 23, 2014

  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 p≤t.