RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Izv. Saratov Univ. (N.S.), Ser. Math. Mech. Inform.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Izv. Saratov Univ. (N.S.), Ser. Math. Mech. Inform., 2018, Volume 18, Issue 2, Pages 227–239 (Mi isu758)  

Scientific Part
Computer Sciences

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

Yu. V. Kosolapov

Southern Federal University, 105/42, Bol'shaya Sadovaya Str., Rostov-on-Don, 344006, Russia

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

Key words: secret sharing scheme, visual cryptography, linear hash functions.

DOI: https://doi.org/10.18500/1816-9791-2018-18-2-227-239

Full text: PDF file (403 kB)
References: PDF file   HTML file

Bibliographic databases:

UDC: 517.9

Citation: Yu. V. Kosolapov, “On the construction of $(n,k)$-schemes of visual cryptography using a class of linear hash functions over a binary field”, Izv. Saratov Univ. (N.S.), Ser. Math. Mech. Inform., 18:2 (2018), 227–239

Citation in format AMSBIB
\Bibitem{Kos18}
\by Yu.~V.~Kosolapov
\paper On the construction of $(n,k)$-schemes of visual cryptography using a class of linear hash functions over a binary field
\jour Izv. Saratov Univ. (N.S.), Ser. Math. Mech. Inform.
\yr 2018
\vol 18
\issue 2
\pages 227--239
\mathnet{http://mi.mathnet.ru/isu758}
\crossref{https://doi.org/10.18500/1816-9791-2018-18-2-227-239}
\elib{http://elibrary.ru/item.asp?id=35085052}


Linking options:
  • http://mi.mathnet.ru/eng/isu758
  • http://mi.mathnet.ru/eng/isu/v18/i2/p227

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Известия Саратовского университета. Новая серия. Серия Математика. Механика. Информатика
    Number of views:
    This page:192
    Full text:23
    References:7

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019