Izvestiya of Saratov University.

Mathematics. Mechanics. Informatics

ISSN 1816-9791 (Print)
ISSN 2541-9005 (Online)


For citation:

Kosolapov Y. V. On the Construction of (n, k)-schemes of Visual Cryptography Using a Class of Linear Hash Functions Over a Binary Field. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, 2018, vol. 18, iss. 2, pp. 227-239. DOI: 10.18500/1816-9791-2018-18-2-227-239, EDN: XQFNSP

This is an open access article distributed under the terms of Creative Commons Attribution 4.0 International License (CC-BY 4.0).
Published online: 
28.05.2018
Full text:
(downloads: 226)
Language: 
Russian
Heading: 
Article type: 
Article
UDC: 
517.9
EDN: 
XQFNSP

On the Construction of (n, k)-schemes of Visual Cryptography Using a Class of Linear Hash Functions Over a Binary Field

Autors: 
Kosolapov Yury V., Southern Federal University
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 devel oped, 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.

References: 
  1. Shamir A. How to share a secret // Communications of the ACM. 1979. Vol. 22, № 11. P. 612–613.
  2. Blakley G. R. Safeguarding cryptographic keys // Proc. of the National Computer Conference. 1979. Vol. 48. P. 313–317.
  3. Pogorelov B. A., Sachkov V. N. Slovar’ kriptograficheskih terminov [Dictionary of cryptographic terms]. Moscow, MTsNMO, 2006. 91 p.(in Russian).
  4. Chen H., Cramer R., Goldwasser S., Haan R., Vaikuntanathan V. Secure Computation from Random Error Correcting Codes // Advances in Cryptology – EUROCRYPT 2007. EUROCRYPT 2007. Lecture Notes in Computer Science. Berlin ; Heidelberg : Springer, 2007. Vol. 4515. P. 291–310. DOI: https://doi.org/10.1007/978-3-540-72540-4_17
  5. Naor M., Shamir A. Visual cryptography // Advances in Cryptology – EUROCRYPT’94. EUROCRYPT 1994. Lecture Notes in Computer Science. Berlin, Heidelberg : Springer, 1994. Vol. 950. P. 1–12. DOI: https://doi.org/10.1007/BFb0053419
  6. Pelli D.G., Bex P. Measuring contrast sensitivity // Vision Res. 2013. Vol. 90. P. 10–14. DOI: https://doi.org/10.1016/j.visres.2013.04.015
  7. Carter J. L., Wegman M. N. Universal classes of hash functions // Journal of Computer and System Sciences. 1979. Vol. 18, iss. 2. P. 143–154. DOI: https://doi.org/10.1016/0022-0000(79)90044-8
  8. Bose M., Mukerjee R. Optimal (k, n) visual cryptographic schemes for general k // Des. Codes Cryptogr. 2010. Vol. 55, iss. 1. P. 19–35. DOI: https://doi.org/10.1007/s10623-009-9327-6
  9. Cormen T.H., Leiserson C.E., Rivest R.L., Stein C. Introduction to Algorithms. Cambridge, Massachusetts; London, England : MIT Press, 2009. 1312 p.
  10. Lakshmanan R., Arumugam S. Construction of a (k, n)-visual cryptography scheme // Des. Codes Cryptogr. 2017. Vol. 82, iss. 3. P. 629–645. DOI: https://doi.org/10.1007/s10623-016-0181-z
Received: 
14.01.2018
Accepted: 
02.05.2018
Published: 
04.06.2018
Short text (in English):
(downloads: 74)