Visual cryptography for general access structures
From MaRDI portal
Publication:2506485
DOI10.1006/inco.1996.0076zbMath1096.94522OpenAlexW2062010115MaRDI QIDQ2506485
Giuseppe Ateniese, Alfredo De Santis, Carlo Blundo, Douglas R. Stinson
Publication date: 10 October 2006
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/444e1530237809c5c2b293762103252e554d6fe6
Related Items (49)
Efficient visual secret sharing scheme for color images ⋮ Improved algorithms for group testing with inhibitors ⋮ Ideal contrast visual cryptography schemes with reversing ⋮ Visual cryptography for grey level images ⋮ Hierarchical Visual Secret Sharing Scheme Using Steganography ⋮ Constructions and analysis of some efficient \(t\)-\((k,n)^\ast\)-visual cryptographic schemes using linear algebraic techniques ⋮ A novel distributed privacy paradigm for visual sensor networks based on sharing dynamical systems ⋮ Two secret sharing schemes based on Boolean operations ⋮ Boolean Composition of Visual Secret Sharing Schemes ⋮ Image encryption by random grids ⋮ Visual cryptographic schemes using combined Boolean operations ⋮ Boolean operations-based visual secret sharing for general access structures ⋮ Visual cryptography schemes with optimal pixel expansion ⋮ Perfect contrast XOR-based visual cryptography schemes via linear algebra ⋮ Extended visual cryptography schemes ⋮ A cheating prevention scheme for binary visual cryptography with homogeneous secret images ⋮ Graph access structures with optimal pixel expansion three ⋮ Color visual cryptography schemes for black and white secret images ⋮ Secure Two-Party Computation: A Visual Way ⋮ Measure-Independent Characterization of Contrast Optimal Visual Cryptography Schemes ⋮ Maximal contrast color visual secret sharing schemes ⋮ Revisiting the False Acceptance Rate Attack on Biometric Visual Cryptographic Schemes ⋮ Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images ⋮ Visual cryptography on graphs ⋮ On \({(k,n)^\ast}\)-visual cryptography scheme ⋮ Meaningful share generation for increased number of secrets in visual secret-sharing scheme ⋮ Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. ⋮ A new online extended visual cryptography scheme for STS access structures ⋮ Coloured visual cryptography using fixed size meaningful share ⋮ Visual cryptograms of random grids for threshold access structures ⋮ Probabilistic secret sharing ⋮ Visual secret sharing for multiple secrets ⋮ A discussion on the relationship between probabilistic visual cryptography and random grid ⋮ Friendly progressive visual secret sharing ⋮ Construction of a \((k,n)\)-visual cryptography scheme ⋮ Bounds for visual cryptography schemes ⋮ Optimal colored threshold visual cryptography schemes ⋮ Visual multiple secret sharing based upon turning and flipping ⋮ New visual cryptographic schemes derived from orthogonal and mixed orthogonal arrays ⋮ Sharing multiple secrets in visual cryptography ⋮ Visual cryptography scheme on graphs with $m^{*}(G)=4$ ⋮ The alignment problem of visual cryptography schemes ⋮ On the security of a visual cryptography scheme for color images ⋮ A new visual cryptography scheme for STS based access structures ⋮ Colored visual cryptography without color darkening ⋮ MTVSS: (M)isalignment (T)olerant (V)isual (S)ecret (S)haring on resolving alignment difficulty ⋮ Randomness in secret sharing and visual cryptography schemes ⋮ A New Approach to Image Sharing with High-Security Threshold Structure ⋮ Extended capabilities for visual cryptography
This page was built for publication: Visual cryptography for general access structures
