Perfect contrast XOR-based visual cryptography schemes via linear algebra
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1088244 (Why is no real title available?)
- scientific article; zbMATH DE number 1088898 (Why is no real title available?)
- A new definition of the contrast of visual cryptography scheme
- Cheating Prevention in Visual Cryptography
- Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
- Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images
- On \((k,n)\) visual cryptography scheme with\( t\) essential parties
- On \({(k,n)^\ast}\)-visual cryptography scheme
- On general construction for extended visual cryptography schemes
- On the contrast in visual cryptography schemes
- Optimal colored threshold visual cryptography schemes
- Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels
- Topics in Cryptology – CT-RSA 2004
- Visual cryptography for general access structures
- Visual cryptography for grey level images
- Visual cryptography for natural images and visual voting
- XOR-based visual cryptography schemes
Cited in
(7)- Topics in Cryptology – CT-RSA 2004
- XOR-based visual cryptography schemes
- Contrast optimal XOR based visual cryptographic schemes
- Towards cheat-preventing in block-based progressive visual cryptography for general access structures
- Multiparty verification in image secret sharing
- XOR based non-monotone \(t\)-\((k,n)^*\)-visual cryptographic schemes using linear algebra
- scientific article; zbMATH DE number 7295660 (Why is no real title available?)
This page was built for publication: Perfect contrast XOR-based visual cryptography schemes via linear algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2402969)