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

DOI10.18500/1816-9791-2018-18-2-227-239zbMath1421.94086OpenAlexW2809902890MaRDI QIDQ5194998

Yury V. Kosolapov

Publication date: 17 September 2019

Published in: Izvestiya of Saratov University. New Series. Series: Mathematics. Mechanics. Informatics (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/isu758

zbMATH Keywords

visual cryptographysecret sharing schemelinear hash functions

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Construction of a \((k,n)\)-visual cryptography scheme
• Universal classes of hash functions
• Optimal \((k, n)\) visual cryptographic schemes for general \(k\)
• How to share a secret
• Secure Computation from Random Error Correcting Codes

This page was built for publication: On the Construction of (n, k)-schemes of Visual Cryptography Using a Class of Linear Hash Functions Over a Binary Field