Maximal contrast color visual secret sharing schemes

DOI10.1007/S10623-018-0570-6zbMath1442.94050OpenAlexW2898465902WikidataQ129077646 ScholiaQ129077646MaRDI QIDQ2420478

Avishek Adhikari, Sabyasachi Dutta, Sushmita Ruj

Publication date: 6 June 2019

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

Full work available at URL: https://doi.org/10.1007/s10623-018-0570-6

zbMATH Keywords

contrastpixel expansioncumulative arraycolor visual secret sharingessential participant

Mathematics Subject Classification ID

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

Related Items (1)

A study for security of visual cryptography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructions and analysis of some efficient \(t\)-\((k,n)^\ast\)-visual cryptographic schemes using linear algebraic techniques
• Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images
• Colored visual cryptography without color darkening
• Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
• New colored visual secret sharing schemes
• Contrast optimal XOR based visual cryptographic schemes
• Efficient visual secret sharing scheme for color images
• 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
• Contrast Optimal Threshold Visual Cryptography Schemes
• Progress in Cryptology - INDOCRYPT 2003
• XOR Based Non-monotone t- $$(k,n)^*$$ -Visual Cryptographic Schemes Using Linear Algebra
• Progress in Cryptology - INDOCRYPT 2004
• Improved schemes for visual cryptography

This page was built for publication: Maximal contrast color visual secret sharing schemes