2016年
Generalized Graph-based Visual Secret Sharing Schemes for Multiple Secrets
2016 10TH INTERNATIONAL CONFERENCE ON INNOVATIVE MOBILE AND INTERNET SERVICES IN UBIQUITOUS COMPUTING (IMIS)
- 開始ページ
- 614
- 終了ページ
- 619
- 記述言語
- 英語
- 掲載種別
- 研究論文(国際会議プロシーディングス)
- DOI
- 10.1109/IMIS.2016.123
- 出版者・発行元
- IEEE
A visual secret sharing scheme with an access structure based on a given graph has been proposed, and can be considered an extension of (2,n)-threshold visual secret sharing schemes. Ateniese et al. presented a decomposition method in which a dealer decomposes a given graph into star graphs, with qualified participants (vertices in a given graph) who have a common edge if and only if the participants can reconstruct the secret image by stacking their shares. This paper classifies graph-based visual secret sharing schemes, presents several optimal examples, and proposes an ideal graph-based visual secret sharing scheme with real world applications, because the pixel expansion is not greater than 4. This paper also proposes some new methods for the construction of a graph-based visual secret sharing scheme for multiple secrets with practical pixel expansion.
- リンク情報
-
- DOI
- https://doi.org/10.1109/IMIS.2016.123
- DBLP
- https://dblp.uni-trier.de/rec/conf/imis/Suga16
- Web of Science
- https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000393413000111&DestApp=WOS_CPL
- URL
- http://dblp.uni-trier.de/db/conf/imis/imis2016.html#conf/imis/Suga16
- ID情報
-
- DOI : 10.1109/IMIS.2016.123
- DBLP ID : conf/imis/Suga16
- Web of Science ID : WOS:000393413000111