{"title":"彩色图像的Karnaugh地图{2,2}秘密共享方案","authors":"K. Plataniotis, S. Stergiopoulos","doi":"10.1109/ICDSP.2009.5201146","DOIUrl":null,"url":null,"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.","PeriodicalId":409669,"journal":{"name":"2009 16th International Conference on Digital Signal Processing","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Karnaugh map {2,2} secret sharing scheme for color images\",\"authors\":\"K. Plataniotis, S. Stergiopoulos\",\"doi\":\"10.1109/ICDSP.2009.5201146\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":409669,\"journal\":{\"name\":\"2009 16th International Conference on Digital Signal Processing\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 16th International Conference on Digital Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDSP.2009.5201146\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 16th International Conference on Digital Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDSP.2009.5201146","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Karnaugh map {2,2} secret sharing scheme for color images
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.