A Visual Secret Sharing Scheme for Progressively Restoring Secrets
Visual secret sharing has received more and more attention over the past years due to the fact that neither complex computation nor cryptographic knowledge is required to decrypt the secret image directly according to the characteristics of the human vision system. Considering the issue of sharing t...
Gespeichert in:
Veröffentlicht in: | 电子科技学刊 2011, Vol.9 (4), p.325-331 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 331 |
---|---|
container_issue | 4 |
container_start_page | 325 |
container_title | 电子科技学刊 |
container_volume | 9 |
creator | Chin-Chen Chang Yi-Pei Hsieh Chi-Cheng Liao |
description | Visual secret sharing has received more and more attention over the past years due to the fact that neither complex computation nor cryptographic knowledge is required to decrypt the secret image directly according to the characteristics of the human vision system. Considering the issue of sharing the secret image at multiple image resolutions with the meaningful shadows, in this paper, we present a friendly progressive visual secret sharing scheme without expanding the image size in the shadows and the reconstructed secret image based on applying a 2x2-sized block-wise operation to generate the shadows block by block. The proposed method can achieve these benefits: 1) the generated shadows are meaningful, and their sizes are not expanded, and 2) the secret image can be recovered at different resolutions by stacking different quantities of shadows together. The experimental results also show that the proposed method is superior to other compared schemes. |
doi_str_mv | 10.3969/j.issn.1674-862X.2011.04.008 |
format | Article |
fullrecord | <record><control><sourceid>wanfang_jour_chong</sourceid><recordid>TN_cdi_wanfang_journals_zgdzkj_e201104008</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cqvip_id>40735636</cqvip_id><wanfj_id>zgdzkj_e201104008</wanfj_id><sourcerecordid>zgdzkj_e201104008</sourcerecordid><originalsourceid>FETCH-LOGICAL-c608-131bacfc89f772b3e03a61595e8974888471eb72b3b8d0aaf84c0a57a778b8503</originalsourceid><addsrcrecordid>eNo9j0tPwzAQhH0Aiar0PxiJC4eYdfzMsVS8pEogUiFukeM6L9IE7BbU_npSgjittPvNzA5ClxQIS2Ry3ZA6hI5QqXikZfxGYqCUACcA-gRN_vdnaBZCnYOgTCqp4gm6mePXOuxMi1NnvdvitDK-7kqc2sptHC56j599X3o3CL9cu8cvLmz7EflVhHN0Wpg2uNnfnKLV3e1q8RAtn-4fF_NlZCXoiDKaG1tYnRRKxTlzwIykIhFOJ4prrbmiLj9ecr0GYwrNLRihjFI61wLYFF2Ntt-mK0xXZk2_890QmB3K9eG9ydyxNPCh8sBejKyt-q78HJ7NPny9MX6fcVBMSCbZD5w2Wyw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Visual Secret Sharing Scheme for Progressively Restoring Secrets</title><source>Alma/SFX Local Collection</source><creator>Chin-Chen Chang Yi-Pei Hsieh Chi-Cheng Liao</creator><creatorcontrib>Chin-Chen Chang Yi-Pei Hsieh Chi-Cheng Liao</creatorcontrib><description>Visual secret sharing has received more and more attention over the past years due to the fact that neither complex computation nor cryptographic knowledge is required to decrypt the secret image directly according to the characteristics of the human vision system. Considering the issue of sharing the secret image at multiple image resolutions with the meaningful shadows, in this paper, we present a friendly progressive visual secret sharing scheme without expanding the image size in the shadows and the reconstructed secret image based on applying a 2x2-sized block-wise operation to generate the shadows block by block. The proposed method can achieve these benefits: 1) the generated shadows are meaningful, and their sizes are not expanded, and 2) the secret image can be recovered at different resolutions by stacking different quantities of shadows together. The experimental results also show that the proposed method is superior to other compared schemes.</description><identifier>ISSN: 1674-862X</identifier><identifier>DOI: 10.3969/j.issn.1674-862X.2011.04.008</identifier><language>eng</language><publisher>Department of Information Engineering and Computer Science, Feng Chia University. He is also with the Department of Computer Science and Information Engineering, Asia University%Department of Information Engineering and Informatics, Tzu Chi College of Technology%Department of Computer Science and Information Engineering. National Chung Cheng University</publisher><subject>人类视觉系统 ; 可视化 ; 图像共享 ; 图像分辨率 ; 块操作 ; 秘密共享方案 ; 秘密分享 ; 阴影</subject><ispartof>电子科技学刊, 2011, Vol.9 (4), p.325-331</ispartof><rights>Copyright © Wanfang Data Co. Ltd. All Rights Reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://image.cqvip.com/vip1000/qk/87980A/87980A.jpg</thumbnail><link.rule.ids>314,776,780,4009,27902,27903,27904</link.rule.ids></links><search><creatorcontrib>Chin-Chen Chang Yi-Pei Hsieh Chi-Cheng Liao</creatorcontrib><title>A Visual Secret Sharing Scheme for Progressively Restoring Secrets</title><title>电子科技学刊</title><addtitle>Journal of Electronic Science Technology</addtitle><description>Visual secret sharing has received more and more attention over the past years due to the fact that neither complex computation nor cryptographic knowledge is required to decrypt the secret image directly according to the characteristics of the human vision system. Considering the issue of sharing the secret image at multiple image resolutions with the meaningful shadows, in this paper, we present a friendly progressive visual secret sharing scheme without expanding the image size in the shadows and the reconstructed secret image based on applying a 2x2-sized block-wise operation to generate the shadows block by block. The proposed method can achieve these benefits: 1) the generated shadows are meaningful, and their sizes are not expanded, and 2) the secret image can be recovered at different resolutions by stacking different quantities of shadows together. The experimental results also show that the proposed method is superior to other compared schemes.</description><subject>人类视觉系统</subject><subject>可视化</subject><subject>图像共享</subject><subject>图像分辨率</subject><subject>块操作</subject><subject>秘密共享方案</subject><subject>秘密分享</subject><subject>阴影</subject><issn>1674-862X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><recordid>eNo9j0tPwzAQhH0Aiar0PxiJC4eYdfzMsVS8pEogUiFukeM6L9IE7BbU_npSgjittPvNzA5ClxQIS2Ry3ZA6hI5QqXikZfxGYqCUACcA-gRN_vdnaBZCnYOgTCqp4gm6mePXOuxMi1NnvdvitDK-7kqc2sptHC56j599X3o3CL9cu8cvLmz7EflVhHN0Wpg2uNnfnKLV3e1q8RAtn-4fF_NlZCXoiDKaG1tYnRRKxTlzwIykIhFOJ4prrbmiLj9ecr0GYwrNLRihjFI61wLYFF2Ntt-mK0xXZk2_890QmB3K9eG9ydyxNPCh8sBejKyt-q78HJ7NPny9MX6fcVBMSCbZD5w2Wyw</recordid><startdate>2011</startdate><enddate>2011</enddate><creator>Chin-Chen Chang Yi-Pei Hsieh Chi-Cheng Liao</creator><general>Department of Information Engineering and Computer Science, Feng Chia University. He is also with the Department of Computer Science and Information Engineering, Asia University%Department of Information Engineering and Informatics, Tzu Chi College of Technology%Department of Computer Science and Information Engineering. National Chung Cheng University</general><scope>2RA</scope><scope>92L</scope><scope>CQIGP</scope><scope>W92</scope><scope>~WA</scope><scope>2B.</scope><scope>4A8</scope><scope>92I</scope><scope>93N</scope><scope>PSX</scope><scope>TCJ</scope></search><sort><creationdate>2011</creationdate><title>A Visual Secret Sharing Scheme for Progressively Restoring Secrets</title><author>Chin-Chen Chang Yi-Pei Hsieh Chi-Cheng Liao</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c608-131bacfc89f772b3e03a61595e8974888471eb72b3b8d0aaf84c0a57a778b8503</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>人类视觉系统</topic><topic>可视化</topic><topic>图像共享</topic><topic>图像分辨率</topic><topic>块操作</topic><topic>秘密共享方案</topic><topic>秘密分享</topic><topic>阴影</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chin-Chen Chang Yi-Pei Hsieh Chi-Cheng Liao</creatorcontrib><collection>中文科技期刊数据库</collection><collection>中文科技期刊数据库-CALIS站点</collection><collection>中文科技期刊数据库-7.0平台</collection><collection>中文科技期刊数据库-工程技术</collection><collection>中文科技期刊数据库- 镜像站点</collection><collection>Wanfang Data Journals - Hong Kong</collection><collection>WANFANG Data Centre</collection><collection>Wanfang Data Journals</collection><collection>万方数据期刊 - 香港版</collection><collection>China Online Journals (COJ)</collection><collection>China Online Journals (COJ)</collection><jtitle>电子科技学刊</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chin-Chen Chang Yi-Pei Hsieh Chi-Cheng Liao</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Visual Secret Sharing Scheme for Progressively Restoring Secrets</atitle><jtitle>电子科技学刊</jtitle><addtitle>Journal of Electronic Science Technology</addtitle><date>2011</date><risdate>2011</risdate><volume>9</volume><issue>4</issue><spage>325</spage><epage>331</epage><pages>325-331</pages><issn>1674-862X</issn><abstract>Visual secret sharing has received more and more attention over the past years due to the fact that neither complex computation nor cryptographic knowledge is required to decrypt the secret image directly according to the characteristics of the human vision system. Considering the issue of sharing the secret image at multiple image resolutions with the meaningful shadows, in this paper, we present a friendly progressive visual secret sharing scheme without expanding the image size in the shadows and the reconstructed secret image based on applying a 2x2-sized block-wise operation to generate the shadows block by block. The proposed method can achieve these benefits: 1) the generated shadows are meaningful, and their sizes are not expanded, and 2) the secret image can be recovered at different resolutions by stacking different quantities of shadows together. The experimental results also show that the proposed method is superior to other compared schemes.</abstract><pub>Department of Information Engineering and Computer Science, Feng Chia University. He is also with the Department of Computer Science and Information Engineering, Asia University%Department of Information Engineering and Informatics, Tzu Chi College of Technology%Department of Computer Science and Information Engineering. National Chung Cheng University</pub><doi>10.3969/j.issn.1674-862X.2011.04.008</doi><tpages>7</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1674-862X |
ispartof | 电子科技学刊, 2011, Vol.9 (4), p.325-331 |
issn | 1674-862X |
language | eng |
recordid | cdi_wanfang_journals_zgdzkj_e201104008 |
source | Alma/SFX Local Collection |
subjects | 人类视觉系统 可视化 图像共享 图像分辨率 块操作 秘密共享方案 秘密分享 阴影 |
title | A Visual Secret Sharing Scheme for Progressively Restoring Secrets |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T20%3A28%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-wanfang_jour_chong&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Visual%20Secret%20Sharing%20Scheme%20for%20Progressively%20Restoring%20Secrets&rft.jtitle=%E7%94%B5%E5%AD%90%E7%A7%91%E6%8A%80%E5%AD%A6%E5%88%8A&rft.au=Chin-Chen%20Chang%20Yi-Pei%20Hsieh%20Chi-Cheng%20Liao&rft.date=2011&rft.volume=9&rft.issue=4&rft.spage=325&rft.epage=331&rft.pages=325-331&rft.issn=1674-862X&rft_id=info:doi/10.3969/j.issn.1674-862X.2011.04.008&rft_dat=%3Cwanfang_jour_chong%3Ezgdzkj_e201104008%3C/wanfang_jour_chong%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_cqvip_id=40735636&rft_wanfj_id=zgdzkj_e201104008&rfr_iscdi=true |