Constructions and analysis of some efficient \(t\)-\((k,n)^\ast\)-visual cryptographic schemes using linear algebraic techniques

DOI10.1007/S10623-015-0075-5zbMath1348.94043OpenAlexW2461664144MaRDI QIDQ300400

Avishek Adhikari, Sabyasachi Dutta, Raghvendra Singh Rohit

Publication date: 27 June 2016

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-015-0075-5

zbMATH Keywords

linear algebrapixel expansionsystem of linear equationsrelative contrast

Mathematics Subject Classification ID

Cryptography (94A60) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (1)

Maximal contrast color visual secret sharing schemes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images
• Image encryption by random grids
• Image encryption by multiple random grids
• Colored visual cryptography without color darkening
• Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
• On the contrast in visual cryptography schemes
• On general construction for extended visual cryptography schemes
• Optimal \((k, n)\) visual cryptographic schemes for general \(k\)
• On \({(k,n)^\ast}\)-visual cryptography scheme
• Optimal colored threshold visual cryptography schemes
• Visual cryptography for general access structures
• On $$(k, n)$$ Visual Cryptography Scheme with $$t$$ Essential Parties
• New Results on Visual Cryptography
• Contrast Optimal Threshold Visual Cryptography Schemes
• Progress in Cryptology - INDOCRYPT 2003
• Progress in Cryptology - INDOCRYPT 2004
• Improved schemes for visual cryptography

This page was built for publication: Constructions and analysis of some efficient \(t\)-\((k,n)^\ast\)-visual cryptographic schemes using linear algebraic techniques