{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T16:34:08Z","timestamp":1771432448350,"version":"3.50.1"},"reference-count":35,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2018,9,27]],"date-time":"2018-09-27T00:00:00Z","timestamp":1538006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 106-2221-E-260-009-"],"award-info":[{"award-number":["MOST 106-2221-E-260-009-"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>Visual cryptography (VC) encrypts a secret image into n shares (transparency). As such, we cannot see any information from any one share, and the original image is decrypted by stacking all of the shares. The general (k, n)-threshold secret sharing scheme (SSS) can similarly encrypt and decrypt the original image by stacking at least k (\u2264 n) shares. If one stack is fewer than k shares, the secret image is unrecognizable. Another subject is progressive visual secret sharing, which means that when more shares are progressively stacked, the combined share becomes clearer. In this study, we constructed an advanced scheme for (k, n)-threshold SSS that can be encrypted in VC for any positive integers n \u2265 k \u2265 2 through the method of combination, and the size of each share is the same as that of the original image. That is, no pixel expansion is required. Our scheme is novel, and the results from the theoretical analysis and simulation reveal that our scheme exhibits favorable contrast to that of other related schemes.<\/jats:p>","DOI":"10.3390\/cryptography2040028","type":"journal-article","created":{"date-parts":[[2018,9,28]],"date-time":"2018-09-28T02:54:54Z","timestamp":1538103294000},"page":"28","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A (k, n)-Threshold Progressive Visual Secret Sharing without Expansion"],"prefix":"10.3390","volume":"2","author":[{"given":"Ying-Yu","family":"Chen","sequence":"first","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Chi Nan University, Nantou 54561, Taiwan"}]},{"given":"Bo-Yuan","family":"Huang","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Chi Nan University, Nantou 54561, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3654-2560","authenticated-orcid":false,"given":"Justie Su-Tzu","family":"Juan","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Chi Nan University, Nantou 54561, Taiwan"}]}],"member":"1968","published-online":{"date-parts":[[2018,9,27]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Blakley, G.R. (1979, January 4\u20137). Safeguarding cryptographic keys. Proceedings of the AFIPS, New York, NY, USA.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Commun. ACM"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Naor, M., and Shamir, A. (1995). Visual cryptography. Eurocrypt94, Lecture Notes in Computer Science, Springer.","DOI":"10.1007\/BFb0053419"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s001459900057","article-title":"On the contrast in visual cryptography schemes","volume":"12","author":"Blundo","year":"1999","journal-title":"J. Cryptol."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1023\/A:1012504516447","article-title":"Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels","volume":"25","author":"Eisen","year":"2002","journal-title":"Des. Codes Cryptogr."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/S0304-3975(99)00243-1","article-title":"Contrast-optimal k out of n secret sharing schemes in visual cryptography","volume":"240","author":"Hofmeister","year":"2000","journal-title":"Theory Comput. Sci."},{"key":"ref_7","first-page":"594","article-title":"Secret multimedia information sharing with data hiding capability by simple logic operations","volume":"14","author":"Lin","year":"2004","journal-title":"Pattern Recognit. Image Anal."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02128670","article-title":"Aprroximate inclusion-exlusion","volume":"10","author":"Linial","year":"1990","journal-title":"Combinatorica"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/j.patrec.2003.12.011","article-title":"New visual secret sharing schemes using probabilistic method","volume":"25","author":"Yang","year":"2004","journal-title":"Pattern Recognit. Lett."},{"key":"ref_10","unstructured":"Fang, W.-P., Lin, S.-J., and Li, J.-C. (2008, January 17\u201320). Visual cryptography (VC) with nonexpanded shadow images: A hilbert-curve approach. Proceedings of the IEEE International Conference on Intelligence and Security Informatics, Taipei, Taiwan."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/BF01199431","article-title":"\u00dceber die stetige abbildung einer linie aufein fl\u00e4chenst\u00fcck","volume":"38","author":"Hilbert","year":"1891","journal-title":"Math. Ann."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1582","DOI":"10.1016\/j.patcog.2008.08.023","article-title":"Image encryption by multiple random grids","volume":"42","author":"Shyu","year":"2009","journal-title":"Pattern Recognit."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1364\/OL.12.000377","article-title":"Encryption of pictures and shapes by random grids","volume":"12","author":"Kafri","year":"1987","journal-title":"Opt. Lett."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"2203","DOI":"10.1016\/j.patcog.2008.11.015","article-title":"Visual secret sharing by random grids revisited","volume":"42","author":"Chen","year":"2009","journal-title":"Pattern Recognit."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.jvcir.2012.11.001","article-title":"Random grid-based visual secret sharing with abilities of OR and XOR decryptions","volume":"24","author":"Wu","year":"2013","journal-title":"J. Vis. Commun. Image Represent."},{"key":"ref_16","first-page":"98","article-title":"Secret image sharing scheme based on a boolean operation","volume":"14","author":"Nag","year":"2014","journal-title":"Cybern. Inf. Technol."},{"key":"ref_17","first-page":"3","article-title":"A New Simple Non-Expansion Algorithm for (2, 2)-Visual Secret Sharing Scheme","volume":"113","author":"Gaafar","year":"2015","journal-title":"Int. J. Comput. Appl."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"2466","DOI":"10.1016\/j.patcog.2005.04.002","article-title":"Fault-tolerant and progressive transmission of images","volume":"38","author":"Chen","year":"2005","journal-title":"Pattern Recognit."},{"key":"ref_19","unstructured":"Fang, W.P. (2007, January 24\u201326). Multi-layer progressive secret image sharing. Proceedings of the 7th WSEAS, Athens, Greece."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1134\/S1054661806040080","article-title":"Progressive viewing and sharing of sensitive images","volume":"16","author":"Fang","year":"2006","journal-title":"Pattern Recognit. Image Anal."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Chen, Z.-H., and Lee, Y.-S. (2009, January 12\u201314). Yet another friendly progressive visual secret sharing scheme. Proceedings of the 2009 Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, Kyoto, Japan.","DOI":"10.1109\/IIH-MSP.2009.135"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1760","DOI":"10.1109\/TCSVT.2011.2106291","article-title":"Progressive visual cryptography with unexpanded shares","volume":"21","author":"Hou","year":"2011","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"ref_23","unstructured":"Chen, Y.Y., and Juan, J.S.T. (2011, January 18\u201321). A 4 out of n Secret Sharing Scheme in Visual Cryptography without Expansion. Proceedings of the International Conference on Foundations of Computer Science (FCS), Stanford, CA, USA."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1016\/j.jss.2011.02.023","article-title":"Threshold visual secret sharing by random grids","volume":"84","author":"Chen","year":"2011","journal-title":"J. Syst. Softw."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1016\/j.sigpro.2012.11.014","article-title":"Improving the visual quality of random grid based visual secret sharing","volume":"93","author":"Wu","year":"2013","journal-title":"Signal Process."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"2094","DOI":"10.1016\/j.jss.2013.03.062","article-title":"Threshold visual secret sharing by random grids with improved contrast","volume":"86","author":"Guo","year":"2013","journal-title":"J. Syst. Softw."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s11554-015-0540-4","article-title":"An enhanced threshold visual secret sharing based on random grids","volume":"14","author":"Yan","year":"2018","journal-title":"J. Real-Time Image Process."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s11554-017-0678-3","article-title":"Visual secret sharing scheme for (k, n) threshold based on QR code with multiple decryptions","volume":"14","author":"Wan","year":"2018","journal-title":"J. Real-Time Image Process."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"8657","DOI":"10.1007\/s11042-015-2779-y","article-title":"Threshold progressive visual cryptography construction with unexpanded shares","volume":"75","author":"Yan","year":"2016","journal-title":"Multimed. Tools Appl."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.image.2018.05.004","article-title":"Progressive (k, n) secret image sharing schemes based on Boolean operations and covering codes","volume":"66","author":"Liu","year":"2018","journal-title":"Signal Process. Image Commun."},{"key":"ref_31","unstructured":"Alon, N., and Spencer, J. (1992). The Probabilistic Method, Wiley."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","article-title":"Universal classes of hash functions","volume":"18","author":"Carter","year":"1979","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","article-title":"New hash functions and their use in authentication and set equality","volume":"22","author":"Wegman","year":"1981","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"2433","DOI":"10.1016\/j.ins.2007.12.016","article-title":"A novel secret image sharing scheme in color images using small shadow images","volume":"178","author":"Chang","year":"2008","journal-title":"Inf. Sci."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Shankar, K., and Eswaran, P. (2016, January 7\u20138). A new k out of n secret image sharing scheme in visual cryptography. Proceedings of the 10th International Conference on IEEE Intelligent Systems and Control (ISCO2016), Coimbatore, India.","DOI":"10.1109\/ISCO.2016.7726969"}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/2\/4\/28\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T15:49:09Z","timestamp":1771429749000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/2\/4\/28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,27]]},"references-count":35,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2018,12]]}},"alternative-id":["cryptography2040028"],"URL":"https:\/\/doi.org\/10.3390\/cryptography2040028","relation":{},"ISSN":["2410-387X"],"issn-type":[{"value":"2410-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,27]]}}}