On the construction of $(n,k)$-schemes of visual cryptography using a class of linear hash functions over a binary field

Yu. V. Kosolapov

Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 18 (2018) no. 2, pp. 227-239

Résumé

The paper explores the use of a set of hash functions for constructing a secret sharing scheme among $ n $ participants based on the $(k, k)$-scheme M. Nahor and A. Shamir. Conditions are obtained for a set of hash functions, in which it is possible to construct $(k, n)$-schemes where any coalition of power $ k $ or more can restore a secret, and a coalition of lower power cannot restore the secret. In particular, the application of the class of linear hash functions is investigated. In general, this class does not allow us to construct a $(k, n)$-scheme, but it is possible to construct a $(k, K, n)$-scheme for which any $ k-1 $ and less participants cannot restore the secret, and any $ K $ and more can. For a class of linear hash functions, sufficient conditions are obtained for $K$, in which the coalition of power $K$ and more can restore the secret. In a particular case, a secret sharing scheme for eight participants was developed, based on the $(4,4)$-scheme of M. Naor and A. Shamir using a class of linear hash functions. It is shown that for any $4$-power coalition the secret can be restored, that is, the constructed scheme is a $(8,4)$-scheme. The $(8,4)$-scheme constructed in particular is characterized by a shorter length of shares than the $(8,4)$-scheme constructed in accordance with the algorithm proposed by M. Naor and A. Shamir.