A Karnaugh map {2,2} secret sharing scheme for color images

Authors:
K. N. Plataniotis;S. Stergiopoulos
Affiliations:
University of Toronto;Defence R&D Canada Toronto
Venue:
DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
Year:
2009

Citing 5
Cited 0

Visual cryptography for general access structures

Information and Computation
An image intellectual property protection scheme for gray-level images using visual secret sharing strategy

Pattern Recognition Letters
A Reliable (k, n) Image Secret Sharing Scheme

DASC '06 Proceedings of the 2nd IEEE International Symposium on Dependable, Autonomic and Secure Computing
Size-Adjustable Visual Secret Sharing Schemes

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Rapid and brief communication: Bit-level based secret sharing for image encryption

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a simple, computationally attractive {2,2} secret sharing scheme visual suitable for processing color images. The new design utilizes matrix sets derived using a Karnaugh map. The encryption and decryption functions are executed at the bit level of the RGB color representation. The proposed scheme offers perfect reconstruction with no pixel expansion. Analysis and experimental results including in this work support the main argument that the developed scheme is ideal for transmission of color images over un-trusted, bandwidth limited, communication channels.