{"title":"(2, n)理想对比度的秘密图像共享方案","authors":"Lin Dong, Daoshun Wang, Min Ku, Yiqi Dai","doi":"10.1109/CIS.2010.97","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a (2, n) secret image sharing scheme with precise reconstruction for binary, grayscale and color image. In sharing phase, XOR-based secret sharing scheme is utilized and each participant is required to hold a certain number of shares, each having the same size as the secret image. In revealing phase, each two participants can recover the original secret image precisely by just performing simple Boolean operation. The proposed scheme has low computational complexity and can reconstruct the secret image precisely. Experimental results show our scheme is simple and effective.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"(2, n) Secret Image Sharing Scheme with Ideal Contrast\",\"authors\":\"Lin Dong, Daoshun Wang, Min Ku, Yiqi Dai\",\"doi\":\"10.1109/CIS.2010.97\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a (2, n) secret image sharing scheme with precise reconstruction for binary, grayscale and color image. In sharing phase, XOR-based secret sharing scheme is utilized and each participant is required to hold a certain number of shares, each having the same size as the secret image. In revealing phase, each two participants can recover the original secret image precisely by just performing simple Boolean operation. The proposed scheme has low computational complexity and can reconstruct the secret image precisely. Experimental results show our scheme is simple and effective.\",\"PeriodicalId\":420515,\"journal\":{\"name\":\"2010 International Conference on Computational Intelligence and Security\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Computational Intelligence and Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS.2010.97\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Computational Intelligence and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.2010.97","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
(2, n) Secret Image Sharing Scheme with Ideal Contrast
In this paper, we propose a (2, n) secret image sharing scheme with precise reconstruction for binary, grayscale and color image. In sharing phase, XOR-based secret sharing scheme is utilized and each participant is required to hold a certain number of shares, each having the same size as the secret image. In revealing phase, each two participants can recover the original secret image precisely by just performing simple Boolean operation. The proposed scheme has low computational complexity and can reconstruct the secret image precisely. Experimental results show our scheme is simple and effective.