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

Author

Plataniotis, K.N. ; Stergiopoulos, S.

Author_Institution

Univ. of Toronto, Toronto, ON, Canada

fYear

2009

fDate

5-7 July 2009

Firstpage

1

Lastpage

6

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.

Keywords

cryptography; image colour analysis; image reconstruction; image representation; matrix algebra; Karnaugh map secret sharing scheme; RGB color representation; color image processing; communication channel; decryption function; encryption function; Bandwidth; Color; Communication channels; Communication system security; Cryptography; Data encapsulation; Data security; Image reconstruction; Information security; Pixel; Karnaugh map; Secret sharing; color images; permutation; security;

fLanguage

English

Publisher

ieee

Conference_Titel

Digital Signal Processing, 2009 16th International Conference on

Conference_Location

Santorini-Hellas

Print_ISBN

978-1-4244-3297-4

Electronic_ISBN

978-1-4244-3298-1

Type

conf

DOI

10.1109/ICDSP.2009.5201146

Filename

5201146