scientific article; zbMATH DE number 1088898
From MaRDI portal
Publication:4365722
Recommendations
Cited in
(only showing first 100 items - show all)- The alignment problem of visual cryptography schemes
- On the security of a visual cryptography scheme for color images
- Image encryption by multiple random grids
- Colored visual cryptography without color darkening
- MTVSS: (M)isalignment (T)olerant (V)isual (S)ecret (S)haring on resolving alignment difficulty
- Private computation using a PEZ dispenser.
- Contrast-optimal k out of n secret sharing schemes in visual cryptography
- Extended capabilities for visual cryptography
- A reversible steganography scheme of secret image sharing based on cellular automata and least significant bits construction
- Bit-level based secret sharing for image encryption
- Secret image sharing scheme with threshold changeable capability
- Randomness in secret sharing and visual cryptography schemes
- A new approach for visual cryptography
- Meaningful share generation for increased number of secrets in visual secret-sharing scheme
- Fake and dishonest participant location scheme in secret image sharing
- Image inpainting-based behavior image secret sharing
- A compressed secret image sharing method with shadow image verification capability
- A novel secret sharing scheme using multiple share images
- Security protection using two different image shadows with authentication
- Quantum verifiable protocol for secure modulo zero-sum randomness
- Three \((t, n )\)-secret image sharing schemes based on homogeneous linear recursion
- Multiple images encryption based on 3D scrambling and hyper-chaotic system
- Ramp secret image sharing
- On general construction for extended visual cryptography schemes
- Sharing a verifiable secret image using two shadows
- Visual secret sharing by random grids revisited
- Image hiding in time-averaged moiré gratings on finite element grids
- A secret sharing scheme for quantum gray and color images based on encryption
- Cooperative secret sharing using QR codes and symmetric keys
- Efficient visual secret sharing scheme for color images
- Two secret sharing schemes based on Boolean operations
- Optimal (k, n) visual cryptographic schemes for general k
- Visual cryptography
- A multiple-level visual secret-sharing scheme without image size expansion
- Perfect contrast XOR-based visual cryptography schemes via linear algebra
- Maximal contrast color visual secret sharing schemes
- On \({(k,n)^\ast}\)-visual cryptography scheme
- Friendly progressive visual secret sharing
- Optimal colored threshold visual cryptography schemes
- Reduce shadow size in aspect ratio invariant visual secret sharing schemes using a square block-wise operation
- Owner-customer right protection mechanism using a watermarking scheme and a watermarking protocol
- XOR-based visual cryptography schemes
- An explicit formula and its fast algorithm for a class of symmetric balanced incomplete block designs
- Research on a novel construction of probabilistic visual cryptography scheme \((k, n, 0, 1, 1)\)-PVCS for threshold access structures
- Visual cryptography based on ghost imaging and Hadamard transform
- scientific article; zbMATH DE number 1728663 (Why is no real title available?)
- Exploiting the error correction mechanism in QR codes for secret sharing
- Bounded indistinguishability and the complexity of recovering secrets
- Boolean composition of visual secret sharing schemes
- Verifiable visual cryptography based on group structure
- Secure two-party computation: a visual way
- Measure-independent characterization of contrast optimal visual cryptography schemes
- Visual cryptography for grey level images
- Private visual share-homomorphic computation and randomness reduction in visual cryptography
- Revisiting the false acceptance rate attack on biometric visual cryptographic schemes
- Coloured visual cryptography using fixed size meaningful share
- Constructions and analysis of some efficient \(t\)-\((k,n)^\ast\)-visual cryptographic schemes using linear algebraic techniques
- A (3,3) visual cryptography scheme using meaningful shares
- Hierarchical visual secret sharing scheme using steganography
- New Results on Visual Cryptography
- Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol
- Probabilistic (n, n) Visual Secret Sharing Scheme for Grayscale Images
- Graph access structures with optimal pixel expansion three
- Color visual cryptography schemes for black and white secret images
- Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images
- scientific article; zbMATH DE number 1302809 (Why is no real title available?)
- scientific article; zbMATH DE number 1303123 (Why is no real title available?)
- scientific article; zbMATH DE number 1088244 (Why is no real title available?)
- Traceable visual cryptography
- \((2,n)\) secret sharing scheme for gray and color images based on Boolean operation
- scientific article; zbMATH DE number 2058633 (Why is no real title available?)
- scientific article; zbMATH DE number 1759325 (Why is no real title available?)
- scientific article; zbMATH DE number 6866300 (Why is no real title available?)
- Visual cryptograms of random grids for threshold access structures
- Visual cryptography for natural images and visual voting
- Secret sharing with multi-cover adaptive steganography
- Probabilistic secret sharing
- An encryption algorithm for grey-scale image based on bit-plane decomposition and diffuse representation
- A discussion on the relationship between probabilistic visual cryptography and random grid
- A Survey on some Applications of Graph Theory in Cryptography
- Steganography based image sharing with reversibility
- Region splitting visual cryptography using random grids
- Robust progressive block based visual cryptography with chaotic map
- Visual cryptographic schemes using combined Boolean operations
- Boolean operations-based visual secret sharing for general access structures
- Distortionless visual multi-secret sharing based on random grid
- Construction of a \((k,n)\)-visual cryptography scheme
- Visual cryptography scheme on graphs with \(m^*(G)=4\)
- Secure computation without computers
- On the construction of \((n,k)\)-schemes of visual cryptography using a class of linear hash functions over a binary field
- A generalization of the Mignotte's scheme over Euclidean domains and applications to secret image sharing
- Visual cryptography from halftone error diffusion
- scientific article; zbMATH DE number 6741950 (Why is no real title available?)
- scientific article; zbMATH DE number 6741951 (Why is no real title available?)
- scientific article; zbMATH DE number 6741952 (Why is no real title available?)
- Prevention of cheating in visual cryptography by using coherent patterns
- A protection method of valuable documents against forgery based on the visual secret sharing scheme
- Computing transparently: The independent sets in a graph
- Information and Communications Security
- Extended visual cryptography scheme for multiple-secrets continuous-tone images
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4365722)
