Priority visual secret sharing of random grids for threshold access structures
Conventional ( k, n )-threshold visual secret sharing of random grids (VSSRG) schemes generate n shares having the same average light transmission from a secret image to be shared, and any information related to the secret image cannot be identified externally from a single share held by one partici...
Gespeichert in:
| Veröffentlicht in: | Multimedia tools and applications 2018-05, Vol.77 (10), p.11867-11882 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 11882 |
|---|---|
| container_issue | 10 |
| container_start_page | 11867 |
| container_title | Multimedia tools and applications |
| container_volume | 77 |
| creator | Chao, Her-Chang Fan, Tzuo-Yau |
| description | Conventional (
k, n
)-threshold visual secret sharing of random grids (VSSRG) schemes generate
n
shares having the same average light transmission from a secret image to be shared, and any information related to the secret image cannot be identified externally from a single share held by one participant. In addition, the secret image can be recovered only by collecting
k
shares individually held by participants, and every share has the same capability of recovering the secret image. In fact, participants’ priority levels vary in certain conditions, and therefore their shares’ capabilities to recover the secret image are different. The priority-based (
k, n
)-threshold VSSRG scheme proposed in this study enables the assignment of different priority weights to each share to create different priority levels. During decryption, the stacking of shares with different priority levels recovers the secret image at different levels. Moreover, shares individually held by each participant have the same average light transmission, and consequently the shares’ priority levels cannot be identified externally. |
| doi_str_mv | 10.1007/s11042-017-4836-1 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2044092194</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2044092194</sourcerecordid><originalsourceid>FETCH-LOGICAL-c316t-a00d316b88fcc511757fc6cc1dffcdc7f92273d28fdaecc9bda53cf5e516d4273</originalsourceid><addsrcrecordid>eNp1kE9LAzEQxRdRsFY_gLeA52gmu9nsHqX4D4p60HNIJ0m7pW1qZlfotzdlBU-e5jHz3hv4FcU1iFsQQt8RgKgkF6B51ZQ1h5NiAkqXXGsJp1mXjeBaCTgvLojWQkCtZDUpXt9TF1PXH9h3R4PdMPKYfM9oZVO3W7IYWLI7F7dsmTpHLMTE-lXytIobxyyiJ2LUpwH7IW8vi7NgN-Svfue0-Hx8-Jg98_nb08vsfs6xhLrnVgiXxaJpAqIC0EoHrBHBhYAOdWil1KWTTXDWI7YLZ1WJQXkFtavyaVrcjL37FL8GT71ZxyHt8ksjRVWJVkJbZReMLkyRKPlg9qnb2nQwIMwRmxmxmYzNHLEZyBk5Zmh_BODTX_P_oR95U3GI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2044092194</pqid></control><display><type>article</type><title>Priority visual secret sharing of random grids for threshold access structures</title><source>SpringerLink Journals - AutoHoldings</source><creator>Chao, Her-Chang ; Fan, Tzuo-Yau</creator><creatorcontrib>Chao, Her-Chang ; Fan, Tzuo-Yau</creatorcontrib><description>Conventional (
k, n
)-threshold visual secret sharing of random grids (VSSRG) schemes generate
n
shares having the same average light transmission from a secret image to be shared, and any information related to the secret image cannot be identified externally from a single share held by one participant. In addition, the secret image can be recovered only by collecting
k
shares individually held by participants, and every share has the same capability of recovering the secret image. In fact, participants’ priority levels vary in certain conditions, and therefore their shares’ capabilities to recover the secret image are different. The priority-based (
k, n
)-threshold VSSRG scheme proposed in this study enables the assignment of different priority weights to each share to create different priority levels. During decryption, the stacking of shares with different priority levels recovers the secret image at different levels. Moreover, shares individually held by each participant have the same average light transmission, and consequently the shares’ priority levels cannot be identified externally.</description><identifier>ISSN: 1380-7501</identifier><identifier>EISSN: 1573-7721</identifier><identifier>DOI: 10.1007/s11042-017-4836-1</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Computer Communication Networks ; Computer Science ; Data Structures and Information Theory ; Encryption ; Image transmission ; Light transmission ; Modularity ; Multimedia Information Systems ; Quality of service ; Special Purpose and Application-Based Systems</subject><ispartof>Multimedia tools and applications, 2018-05, Vol.77 (10), p.11867-11882</ispartof><rights>Springer Science+Business Media New York 2017</rights><rights>Multimedia Tools and Applications is a copyright of Springer, (2017). All Rights Reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c316t-a00d316b88fcc511757fc6cc1dffcdc7f92273d28fdaecc9bda53cf5e516d4273</citedby><cites>FETCH-LOGICAL-c316t-a00d316b88fcc511757fc6cc1dffcdc7f92273d28fdaecc9bda53cf5e516d4273</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11042-017-4836-1$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11042-017-4836-1$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Chao, Her-Chang</creatorcontrib><creatorcontrib>Fan, Tzuo-Yau</creatorcontrib><title>Priority visual secret sharing of random grids for threshold access structures</title><title>Multimedia tools and applications</title><addtitle>Multimed Tools Appl</addtitle><description>Conventional (
k, n
)-threshold visual secret sharing of random grids (VSSRG) schemes generate
n
shares having the same average light transmission from a secret image to be shared, and any information related to the secret image cannot be identified externally from a single share held by one participant. In addition, the secret image can be recovered only by collecting
k
shares individually held by participants, and every share has the same capability of recovering the secret image. In fact, participants’ priority levels vary in certain conditions, and therefore their shares’ capabilities to recover the secret image are different. The priority-based (
k, n
)-threshold VSSRG scheme proposed in this study enables the assignment of different priority weights to each share to create different priority levels. During decryption, the stacking of shares with different priority levels recovers the secret image at different levels. Moreover, shares individually held by each participant have the same average light transmission, and consequently the shares’ priority levels cannot be identified externally.</description><subject>Computer Communication Networks</subject><subject>Computer Science</subject><subject>Data Structures and Information Theory</subject><subject>Encryption</subject><subject>Image transmission</subject><subject>Light transmission</subject><subject>Modularity</subject><subject>Multimedia Information Systems</subject><subject>Quality of service</subject><subject>Special Purpose and Application-Based Systems</subject><issn>1380-7501</issn><issn>1573-7721</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNp1kE9LAzEQxRdRsFY_gLeA52gmu9nsHqX4D4p60HNIJ0m7pW1qZlfotzdlBU-e5jHz3hv4FcU1iFsQQt8RgKgkF6B51ZQ1h5NiAkqXXGsJp1mXjeBaCTgvLojWQkCtZDUpXt9TF1PXH9h3R4PdMPKYfM9oZVO3W7IYWLI7F7dsmTpHLMTE-lXytIobxyyiJ2LUpwH7IW8vi7NgN-Svfue0-Hx8-Jg98_nb08vsfs6xhLrnVgiXxaJpAqIC0EoHrBHBhYAOdWil1KWTTXDWI7YLZ1WJQXkFtavyaVrcjL37FL8GT71ZxyHt8ksjRVWJVkJbZReMLkyRKPlg9qnb2nQwIMwRmxmxmYzNHLEZyBk5Zmh_BODTX_P_oR95U3GI</recordid><startdate>20180501</startdate><enddate>20180501</enddate><creator>Chao, Her-Chang</creator><creator>Fan, Tzuo-Yau</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M2O</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>Q9U</scope></search><sort><creationdate>20180501</creationdate><title>Priority visual secret sharing of random grids for threshold access structures</title><author>Chao, Her-Chang ; Fan, Tzuo-Yau</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c316t-a00d316b88fcc511757fc6cc1dffcdc7f92273d28fdaecc9bda53cf5e516d4273</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Computer Communication Networks</topic><topic>Computer Science</topic><topic>Data Structures and Information Theory</topic><topic>Encryption</topic><topic>Image transmission</topic><topic>Light transmission</topic><topic>Modularity</topic><topic>Multimedia Information Systems</topic><topic>Quality of service</topic><topic>Special Purpose and Application-Based Systems</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chao, Her-Chang</creatorcontrib><creatorcontrib>Fan, Tzuo-Yau</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Access via ABI/INFORM (ProQuest)</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Research Library</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central Basic</collection><jtitle>Multimedia tools and applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chao, Her-Chang</au><au>Fan, Tzuo-Yau</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Priority visual secret sharing of random grids for threshold access structures</atitle><jtitle>Multimedia tools and applications</jtitle><stitle>Multimed Tools Appl</stitle><date>2018-05-01</date><risdate>2018</risdate><volume>77</volume><issue>10</issue><spage>11867</spage><epage>11882</epage><pages>11867-11882</pages><issn>1380-7501</issn><eissn>1573-7721</eissn><abstract>Conventional (
k, n
)-threshold visual secret sharing of random grids (VSSRG) schemes generate
n
shares having the same average light transmission from a secret image to be shared, and any information related to the secret image cannot be identified externally from a single share held by one participant. In addition, the secret image can be recovered only by collecting
k
shares individually held by participants, and every share has the same capability of recovering the secret image. In fact, participants’ priority levels vary in certain conditions, and therefore their shares’ capabilities to recover the secret image are different. The priority-based (
k, n
)-threshold VSSRG scheme proposed in this study enables the assignment of different priority weights to each share to create different priority levels. During decryption, the stacking of shares with different priority levels recovers the secret image at different levels. Moreover, shares individually held by each participant have the same average light transmission, and consequently the shares’ priority levels cannot be identified externally.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11042-017-4836-1</doi><tpages>16</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1380-7501 |
| ispartof | Multimedia tools and applications, 2018-05, Vol.77 (10), p.11867-11882 |
| issn | 1380-7501 1573-7721 |
| language | eng |
| recordid | cdi_proquest_journals_2044092194 |
| source | SpringerLink Journals - AutoHoldings |
| subjects | Computer Communication Networks Computer Science Data Structures and Information Theory Encryption Image transmission Light transmission Modularity Multimedia Information Systems Quality of service Special Purpose and Application-Based Systems |
| title | Priority visual secret sharing of random grids for threshold access structures |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T15%3A00%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Priority%20visual%20secret%20sharing%20of%20random%20grids%20for%20threshold%20access%20structures&rft.jtitle=Multimedia%20tools%20and%20applications&rft.au=Chao,%20Her-Chang&rft.date=2018-05-01&rft.volume=77&rft.issue=10&rft.spage=11867&rft.epage=11882&rft.pages=11867-11882&rft.issn=1380-7501&rft.eissn=1573-7721&rft_id=info:doi/10.1007/s11042-017-4836-1&rft_dat=%3Cproquest_cross%3E2044092194%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2044092194&rft_id=info:pmid/&rfr_iscdi=true |