{"title":"基于视觉密码(SCOSVC)的最优共享秘密通信新技术","authors":"J. K. Mandal, S. Ghatak","doi":"10.1109/ISED.2011.49","DOIUrl":null,"url":null,"abstract":"In this paper a novel (2, m + 1) visual cryptographic technique has been proposed, where m number of secret images has been encrypted based on a randomly generated master as a common share for all secrets which is decodable with any of the shares in conjunction with master share out of m + 1 generated shares. Instead of generating new pixels for share except the master share, hamming weight of the blocks of the secret images has been modified using random function to generate shares corresponding to the secrets. The proposed scheme is secure and very easy to implement like other existing techniques of visual cryptography. At the decoding end the secrets are revealed by stacking the master share on any one share corresponding to the secrets in any arbitrary order with proper alignment directly by human visual system where shares are printed on different transparencies which conforms the optimality of using shares. The aspect ratio and dimension of the secret images and the generated shares with respect to the source images remains constant during the process.","PeriodicalId":349073,"journal":{"name":"2011 International Symposium on Electronic System Design","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"A Novel Technique for Secret Communication through Optimal Shares Using Visual Cryptography (SCOSVC)\",\"authors\":\"J. K. Mandal, S. Ghatak\",\"doi\":\"10.1109/ISED.2011.49\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper a novel (2, m + 1) visual cryptographic technique has been proposed, where m number of secret images has been encrypted based on a randomly generated master as a common share for all secrets which is decodable with any of the shares in conjunction with master share out of m + 1 generated shares. Instead of generating new pixels for share except the master share, hamming weight of the blocks of the secret images has been modified using random function to generate shares corresponding to the secrets. The proposed scheme is secure and very easy to implement like other existing techniques of visual cryptography. At the decoding end the secrets are revealed by stacking the master share on any one share corresponding to the secrets in any arbitrary order with proper alignment directly by human visual system where shares are printed on different transparencies which conforms the optimality of using shares. The aspect ratio and dimension of the secret images and the generated shares with respect to the source images remains constant during the process.\",\"PeriodicalId\":349073,\"journal\":{\"name\":\"2011 International Symposium on Electronic System Design\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Symposium on Electronic System Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISED.2011.49\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Symposium on Electronic System Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISED.2011.49","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Novel Technique for Secret Communication through Optimal Shares Using Visual Cryptography (SCOSVC)
In this paper a novel (2, m + 1) visual cryptographic technique has been proposed, where m number of secret images has been encrypted based on a randomly generated master as a common share for all secrets which is decodable with any of the shares in conjunction with master share out of m + 1 generated shares. Instead of generating new pixels for share except the master share, hamming weight of the blocks of the secret images has been modified using random function to generate shares corresponding to the secrets. The proposed scheme is secure and very easy to implement like other existing techniques of visual cryptography. At the decoding end the secrets are revealed by stacking the master share on any one share corresponding to the secrets in any arbitrary order with proper alignment directly by human visual system where shares are printed on different transparencies which conforms the optimality of using shares. The aspect ratio and dimension of the secret images and the generated shares with respect to the source images remains constant during the process.