多秘密共享阈值可视化密码方案

2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007) Pub Date : 2007-12-15 DOI:10.1109/CIS.WORKSHOPS.2007.206

Bin Yu, Xiaohui Xu, Liguo Fang

{"title":"多秘密共享阈值可视化密码方案","authors":"Bin Yu, Xiaohui Xu, Liguo Fang","doi":"10.1109/CIS.WORKSHOPS.2007.206","DOIUrl":null,"url":null,"abstract":"Original VCS can only share a secret image at a time. When we want to share more secret images, we need to preserve a number of shares which increase our burden. Based on (k, n)-VCS and (k-1, k-1)-VCS, we propose a multi-secret sharing threshold VCS that a participant only preserves a share to share more than one secret and expands the scope of application.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"75 11","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Multi-secret Sharing Threshold Visual Cryptography Scheme\",\"authors\":\"Bin Yu, Xiaohui Xu, Liguo Fang\",\"doi\":\"10.1109/CIS.WORKSHOPS.2007.206\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Original VCS can only share a secret image at a time. When we want to share more secret images, we need to preserve a number of shares which increase our burden. Based on (k, n)-VCS and (k-1, k-1)-VCS, we propose a multi-secret sharing threshold VCS that a participant only preserves a share to share more than one secret and expands the scope of application.\",\"PeriodicalId\":409737,\"journal\":{\"name\":\"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)\",\"volume\":\"75 11\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS.WORKSHOPS.2007.206\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.206","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 13

摘要

原始VCS一次只能共享一个秘密映像。当我们想要分享更多的秘密图像时，我们需要保留一定数量的共享，这增加了我们的负担。在(k, n)-VCS和(k-1, k-1)-VCS的基础上，提出了一个参与者只保留一个共享来共享多个秘密的多秘密共享阈值VCS，扩大了应用范围。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Multi-secret Sharing Threshold Visual Cryptography Scheme

Original VCS can only share a secret image at a time. When we want to share more secret images, we need to preserve a number of shares which increase our burden. Based on (k, n)-VCS and (k-1, k-1)-VCS, we propose a multi-secret sharing threshold VCS that a participant only preserves a share to share more than one secret and expands the scope of application.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)

自引率

0.00%

发文量