book

Visual Cryptography and Secret Image Sharing

by Stelvio Cimato, Ching-Nung Yang

December 2017

Intermediate to advanced

546 pages

13h 43m

English

CRC Press

Read now

Unlock full access

Cover
Half Title
Title Page
Copyright Page
Dedication
Table of Contents
List of Figures
List of Tables
Preface
Contributors

1 Visual Cryptography from Halftone Error Diffusion
1.1 Introduction1.1.1 Visual Cryptography1.1.2 Halftone Visual Cryptography1.1.3 Blue Noise Error Diffusion1.2 Visual Secret Sharing1.2.1 Notion and Formal Definitions1.2.2 Construction of VSS Scheme1.3 Halftone VSS Construction Using Error Diffusion1.3.1 Share Structure1.3.2 Distribution of SIPs and ABPs1.3.3 Generation of Halftone Shares via Error Diffusion1.4 Halftone VSS Construction Using Parallel Error Diffusion1.5 Quality of Halftone Shares1.6 Discussion1.6.1 Improvement of Image Quality1.6.2 Comparison with Other Methods1.6.3 Image Decoding1.7 Simulation Results1.8 ConclusionBibliography
2 Visual Cryptography for Color Images
2.1 Introduction2.2 Color Superposition2.2.1 Color Vision and Color Models2.2.2 Lattices2.2.3 The Darkening Problem2.2.4 The Annihilator Color2.2.5 The Identity Color2.3 Formal Models for Colored VCS2.3.1 The Models for B&W-VC2.3.2 The Models for Color-VC2.3.3 The SC, ND, and General Models2.3.4 Base Matrices2.4 Schemes for the SC Model2.4.1 The VV Schemes2.4.2 The BDD Schemes2.4.3 The KY and YL Schemes2.4.4 The CDD Schemes and a Lower Bound2.5 Schemes for the ND Model2.6 Schemes for the General Model2.6.1 (2,2)-Threshold Schemes2.6.2 The (2, n)-Threshold AS Schemes2.7 Other Schemes2.8 ConclusionsBibliography
3 Visual Cryptography for Multiple Secrets
3.1 Introduction3.2 Naor and Shamir’s Basic Visual Secret Sharing Scheme3.3 Visual Two-Secret Sharing Schemes3.3.1 Wu and Chen’s Scheme3.3.2 Wu and Chang’s Scheme3.4 Visual Multiple-Secret Sharing Schemes3.4.1 Shyu et al.’s Scheme3.4.1.1 Informal Description3.4.1.2 Encoding Circle Share A3.4.1.3 Encoding Circle Share B3.4.1.4 General Algorithm3.4.2 Feng et al.’s Scheme3.4.3 Experimental Results3.4.4 Comparison and Discussions3.5 Concluding RemarksBibliography
4 Extended Visual Cryptography for Photograph Images
4.1 Introduction4.2 Basic Visual Cryptography Schemes4.2.1 (k,n) Visual Secret Sharing Schemes4.2.2 Extended Visual Cryptography Scheme4.2.3 Random Grids4.3 Fundamentals of Photograph Visual Cryptography4.3.1 Digital Halftoning4.3.2 Image Quality and Related Parameters4.3.3 Photograph Visual Cryptography with Basic Schemes4.4 Variations of Photograph Visual Cryptography4.4.1 Approaches to Photograph Visual Cryptography4.4.2 Random-Dot Shadow Images4.4.3 Similar Shadow Images4.4.4 Positive and Negative Shadow Images4.4.5 Error and Secret Diffusion4.4.6 Simultaneous Iterative Search4.4.7 Tone Adjustment4.4.8 Continuous-Tone Subpixel4.5 Misalignment-Tolerant Photograph Visual Cryptography4.5.1 Theory and Implementation4.5.2 Results4.6 ConclusionsBibliography
5 Probabilistic Visual Cryptography Schemes
5.1 Introduction5.2 Visual Cryptography Schemes5.2.1 The Deterministic Model5.2.2 The Probabilistic Model5.3 Canonical Probabilistic Schemes5.4 Probabilistic Schemes with No Pixel Expansion5.5 Trading Pixel Expansion with Probabilities5.5.1 Probabilistic Schemes with Given Pixel Expansion5.6 Constructing Probabilistic Schemes5.6.1 (n, n)-Threshold Probabilistic Schemes with Any Pixel Expansion5.6.2 (2, n)-Threshold Probabilistic Schemes with Any Pixel Expansion5.7 Probabilistic Schemes with Boolean Operations5.7.1 (2, n) Scheme for Binary Images (Wang)5.7.2 (n, n) Scheme for Binary Images (Wang)5.8 Conclusions and Open ProblemsBibliography
6 XOR-Based Visual Cryptography
6.1 Introduction6.2 Preliminaries6.3 Visual Cryptography Scheme Using the Polarization of Light6.3.1 (2, n) Scheme6.3.2 (n, n) Scheme6.3.3 (k, n) Scheme6.4 Visual Cryptography Scheme with Reversing6.4.1 (k, n) VC Scheme Using Cyclic-Shift Operation6.4.2 A Scheme for General Access Structure6.5 Secret Sharing Scheme Using Boolean Operation6.5.1 (2, n) Scheme6.5.2 (n, n) Scheme6.5.3 (k, n) Scheme6.6 ConclusionBibliography
7 Visual Cryptography and Random Grids
7.1 Introduction7.2 Random Grids7.2.1 Random Pixel, Random Grid, and Average Light Transmission7.2.2 Superimposition of Random Grids7.3 Visual Cryptograms of Random Grids7.3.1 Definition of VCRG7.3.2 (2, 2)-VCRG Algorithms for Binary Images7.3.3 Experiments for (2, 2)-VCRG7.3.4 Definition of Light Contrast and Performance Evaluation7.3.5 Algorithms of (n, n)-VCRG for Binary Images7.3.6 Algorithms of (n, n)-VCRG for Gray-Level and Color Images7.3.7 Experiments for (n, n)-VCRG7.4 Concluding RemarksBibliography
8 Visual Cryptography and Contrast Bounds
8.1 Introduction8.2 Preliminaries8.3 Approximate Inclusion Exclusion8.4 Designs and Codes8.5 Optimal 3-out-of-n Schemes8.6 Asymptotic Optimal k-out-of-n Schemes8.7 Contrast Trade-Offs for Extended Visual Cryptography Schemes8.8 Enhancing the Contrast by Nonstandard Models8.9 ConclusionBibliography
9 Visual Cryptography Schemes with Reversing
9.1 Introduction9.2 Visual Cryptography Schemes9.2.1 (k, k)-Threshold Visual Cryptography Schemes9.2.2 Perfect Black Visual Cryptography Schemes9.3 Almost Ideal Contrast VCS with Reversing9.4 Ideal Contrast VCS with Reversing9.4.1 A Construction Using a Binary Secret Sharing Scheme9.4.2 Constructions Using Perfect Black VCSs9.4.2.1 The Scheme by Cimato, De Santis, Ferrara, and Masucci9.4.2.2 The Scheme by Hu and Tzeng9.4.2.3 The Scheme by Yang, Wang, and Chen9.4.2.4 Comparisons9.4.3 A Construction Using a Nonperfect Black VCS9.5 ConclusionsBibliography
10 Cheating Prevention in Visual Cryptography
10.1 Introduction10.2 Preliminaries10.2.1 Visual Cryptography10.2.2 Cheating in VC10.3 Cheating Prevention Schemes10.3.1 HCT1 and HCT210.3.2 HT10.3.3 TCH10.3.4 PS1 and PS210.4 Analysis of Cheating Prevention Schemes10.5 ConclusionsBibliography
11 Resolving the Alignment Problem in Visual Cryptography
11.1 Introduction11.2 Preliminaries11.3 Misalignment with Integer Number of Subpixels11.4 Misalignment with Less Than One Subpixel11.4.1 Shares with Slightly Misalignment Can Still Recover the Secret Image11.4.2 Large Subpixels Have Better Misalignment Tolerance11.5 A Misalignment Tolerant VCS11.5.1 The Algorithm11.5.2 Simulations11.6 Conclusions and Discussions11.7 AcknowledgmentsBibliography
12 Applications of Visual Cryptography
12.1 Introduction12.2 Trojan-Secure Confirmation of Transactions12.3 Trojan-Secure Authentication Using a PIN12.4 Security versus Multiple Use12.5 Using Refraction12.6 Technical Problems Concerning Adjustment and Parallaxes12.7 Voting with a Receipt Based on visual cryptography12.8 ConclusionBibliography
13 Steganography in Halftone Images
13.1 Introduction13.2 A Review of Error Diffusion13.3 Data Hiding by Stochastic Error Diffusion (DHSED)13.4 Data Hiding by Conjugate Error Diffusion (DHCED) 35913.5 Performance Analysis13.6 SummaryBibliography
14 Image Secret Sharing
14.1 Introduction14.2 State of the Art14.3 Approaches for Image Sharing14.3.1 Shamir’s Secret Sharing Scheme14.3.2 Color Image Sharing Based on the Lagrange Interpolation14.3.3 Color Image Sharing Based on Moving Lines14.3.4 Improved Algorithm14.4 Experiment and Evaluation14.5 ConclusionBibliography
15 Polynomial-Based Image Sharing
15.1 Introduction15.2 Polynomial-Based Sharing Scheme15.2.1 Shamir’s Secret Sharing Scheme15.2.2 Lagrange Interpolation Scheme15.3 Preliminaries and Related Works15.3.1 Thien-Lin Scheme15.3.2 Lin-Tsai Scheme15.3.3 Yang et al.’s Scheme15.3.4 Inverted Pattern LSB Scheme15.3.5 Scalable Secret Image Sharing15.4 Wang et al.’s Scheme15.4.1 Secret Image Sharing15.4.2 Set-Up Authentication15.4.3 Main Algorithms15.5 Experimental Results15.5.1 Fidelity Analysis15.5.2 Evaluating Authentication15.6 ConclusionsBibliography
16 Image Sharing with Steganography and Authentication
16.1 Introduction16.2 Related Work16.2.1 Lin and Tsai’s Scheme16.2.2 Yang et al.’s Scheme16.2.3 Chang et al.’s Scheme16.3 Adopted Techniques in the Proposed Scheme16.3.1 Error Diffusion Technique16.3.2 Interpolation Technique16.3.3 Canny Edge Detector16.3.4 Edge Lookup Inverse Halftoning Technique16.3.5 Shamir Scheme for Secret Sharing16.4 Proposed Scheme16.4.1 Sharing and Embedding Phase16.4.2 Reconstruction and Verifying Phase16.5 Experimental Results16.6 ConclusionsBibliography
17 Two-Decoding-Option Image Sharing Method
17.1 Introduction17.2 Preliminaries17.2.1 PISSS17.2.2 VCS17.3 Previous Works17.3.1 Jin et al.’s TiOISSS17.3.2 Lin and Lin’s TiOISSS17.4 A New (k, n)-TiOISSS17.4.1 Design Concept17.4.2 The Lossless TiOISSS17.5 Experimental Results and Comparisons17.6 ConclusionBibliography
Index

Overview

This book covers an extensive range of topics related to visual cryptography techniques and secure image sharing solutions. It addresses sharing multiple secrets and visual cryptography schemes based on the probabilistic reconstruction of the secret image, including pictures in the distributed shares, contrast enhancement techniques, visual cryptography schemes based on different logical operations for combining shared images, cheating prevention, and the alignment problem for image shares. The book also describes practical applications, steganography, and authentication. Case studies demonstrate the effectiveness of the techniques.

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Publisher Resources

ISBN: 9781439837221

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills