1 / 13

Bit-level based secret sharing for image encryption

Bit-level based secret sharing for image encryption. Rastislav Lukac, Konstantinos N. Plataniotis. Pattern Recognition 38 (2005) 767 – 772. Presented by Du-Shiau Tsai. Contents. 1. Introduction 2. Visual Cryptography 3. The proposed scheme 4. Experiment results 5. Conclusions.

dieter-reese
Download Presentation

Bit-level based secret sharing for image encryption

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Bit-level based secret sharing for image encryption Rastislav Lukac, Konstantinos N. Plataniotis Pattern Recognition 38 (2005) 767 – 772 Presented by Du-Shiau Tsai

  2. Contents • 1. Introduction • 2. Visual Cryptography • 3. The proposed scheme • 4. Experiment results • 5. Conclusions

  3. Introduction • Secret image sharing (Tsai)

  4. Introduction • Classification of SIS (Tsai)

  5. Introduction • Visual cryptography is a secret sharing procedure for image data • Recover the secret by the human visual system • Without additional computations • and any knowledge of cryptography .

  6. Introduction • Unfortunately, visual sharing schemes cannot restore to its original quality when the original input is a natural image. • The proposed scheme operates directly on the bit planes of the digital image

  7. 2-out-of-3 Visual Cryptography SA SB SC

  8. B 2-out-of-2 Visual Cryptography

  9. 2-out-of-2 Visual Cryptography • More reasons for the proposed scheme • cannot provide perfect reconstruction • intensity or spatial resolution • is not appropriate for real-time applications.

  10. The proposed scheme

  11. 5=0101=0*23 + 1*22 + 0*21 + 1 Example: The (2,2) proposed scheme for 4-bit image 12=1011=1*23 + 0*22 + 1*21 + 1

  12. Experiment results

  13. Preserve all the features of traditional k-out-n sharing schemes Allow for perfect reconstruction of the input B-bit image Encrypts binary, gray-scale and color images Can be effectively implemented either in software or hardware Conclusions

More Related