{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T04:48:03Z","timestamp":1773118083224,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"9-10","license":[{"start":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:00:00Z","timestamp":1575849600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:00:00Z","timestamp":1575849600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602491"],"award-info":[{"award-number":["61602491"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Key Program of the National University of Defense Technology","award":["ZK-17-02-07"],"award-info":[{"award-number":["ZK-17-02-07"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2020,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Quick response (QR) codes are becoming increasingly popular in various areas of life due to the advantages of the error correction capacity, the ability to be scanned quickly and the capacity to contain meaningful content. The distribution of dark and light modules of a QR code looks random, but the content of a code can be decoded by a standard QR reader. Thus, a QR code is often used in combination with visual secret sharing (VSS) to generate meaningful shadows. There may be some losses in the process of distribution and preservation of the shadows. To recover secret images with high quality, it is necessary to consider the scheme\u2019s robustness. However, few studies examine robustness of VSS combined with QR codes. In this paper, we propose a robust (<jats:italic>k<\/jats:italic>, <jats:italic>n<\/jats:italic>)-threshold XOR-ed VSS (XVSS) scheme based on a QR code with the error correction ability. Compared with OR-ed VSS (OVSS), XVSS can recover the secret image losslessly, and the amount of computation needed is low. Since the standard QR encoder does not check if the padding codewords are correct during the encoding phase, we replace padding codewords by initial shadows shared from the secret image using XVSS to generate QR code shadows. As a result, the shadows can be decoded normally, and their error correction abilities are preserved. Once all the shadows have been collected, the secret image can be recovered losslessly. More importantly, if some conventional image attacks, including rotation, JPEG compression, Gaussian noise, salt-and-pepper noise, cropping, resizing, and even the addition of camera and screen noises are performed on the shadows, the secret image can still be recovered. The experimental results and comparisons demonstrate the effectiveness of our scheme.<\/jats:p>","DOI":"10.1007\/s11042-019-08351-0","type":"journal-article","created":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T03:02:35Z","timestamp":1575860555000},"page":"5719-5741","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["XOR-ed visual secret sharing scheme with robust and meaningful shadows based on QR codes"],"prefix":"10.1007","volume":"79","author":[{"given":"Longdan","family":"Tan","sequence":"first","affiliation":[]},{"given":"Yuliang","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Xuehu","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Lintao","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Xuan","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,9]]},"reference":[{"issue":"9","key":"8351_CR1","doi-asserted-by":"publisher","first-page":"2393","DOI":"10.1109\/TIFS.2018.2819125","volume":"13","author":"Y Cheng","year":"2018","unstructured":"Cheng Y, Fu Z, Yu B (2018) Improved visual secret sharing scheme for qr code applications. IEEE Transactions on Information Forensics and Security 13(9):2393\u20132403","journal-title":"IEEE Transactions on Information Forensics and Security"},{"issue":"4","key":"8351_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.3390\/sym10040095","volume":"10","author":"YW Chow","year":"2018","unstructured":"Chow YW, Susilo W, Tonien J, Vlahu-Gjorgievska E, Yang G (2018) Cooperative secret sharing using qr codes and symmetric keys. Symmetry 10(4):95\u2013107","journal-title":"Symmetry"},{"key":"8351_CR3","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-40253-6_25","volume":"9722","author":"YW Chow","year":"2016","unstructured":"Chow YW, Susilo W, Yang G, Phillips JG, Pranata I, Barmawi AM (2016) Exploiting the error correction mechanism in qr codes for secret sharing. Lecture Notes in Computer Science, Springer 9722:409\u2013425","journal-title":"Lecture Notes in Computer Science, Springer"},{"issue":"1","key":"8351_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1093\/comjnl\/bxh152","volume":"49","author":"S Cimato","year":"2006","unstructured":"Cimato S, De Prisco R, De Santis A (2006) Probabilistic visual cryptography schemes. The Computer Journal 49(1):97\u2013107","journal-title":"The Computer Journal"},{"key":"8351_CR5","doi-asserted-by":"publisher","first-page":"59567","DOI":"10.1109\/ACCESS.2018.2874527","volume":"6","author":"ZYC Fu","year":"2018","unstructured":"Fu ZYC, Yu B (2018) Visual cryptography scheme with meaningful shares based on qr codes. IEEE Access 6:59567\u201359574","journal-title":"IEEE Access"},{"key":"8351_CR6","unstructured":"Information - automatic identification and data capture techniques - qr code barcode symbology specification. Iso\/iec(18004:2015) (2015)"},{"issue":"10","key":"8351_CR7","first-page":"2172","volume":"82","author":"H Kuwakado","year":"1999","unstructured":"Kuwakado H, Tanaka H (1999) Image size invariant visual cryptography. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 82(10):2172\u20132177","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"issue":"11","key":"8351_CR8","first-page":"3460","volume":"33","author":"Y Liu","year":"2016","unstructured":"Liu Y, Fu Z, Wang Y (2016) Two-level information management scheme based on visual cryptography and qr code. Application Research of Computers 33 (11):3460\u20133463","journal-title":"Application Research of Computers"},{"key":"8351_CR9","doi-asserted-by":"crossref","unstructured":"Naor M, Shamir A (1995) Visual cryptography.: Advances in cryptology-EUROCRYPT\u201994 Lecture Notes in Computer Science, Workshop on the Theory and Application of Cryptographic Techniques, Springer, pp 1\u201312","DOI":"10.1007\/BFb0053419"},{"key":"8351_CR10","doi-asserted-by":"crossref","unstructured":"Samretwit D, Wakahara T (2011) Measurement of reading characteristics of multiplexed image in qr code. In: International Conference on Intelligent NETWORKING and Collaborative Systems. pp 552\u2013557","DOI":"10.1109\/INCoS.2011.117"},{"issue":"1","key":"8351_CR11","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10623-016-0285-5","volume":"85","author":"G Shen","year":"2017","unstructured":"Shen G, Liu F, Fu Z, Yu B (2017) Perfect contrast XOR-based visual cryptography schemes via linear algebra. Designs, Codes and Cryptography 85(1):15\u201337","journal-title":"Designs, Codes and Cryptography"},{"issue":"1","key":"8351_CR12","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10623-004-3816-4","volume":"37","author":"P Tuyls","year":"2005","unstructured":"Tuyls P, Hollmann HD, Van Lint JH, LMGM T (2005) XOR-Based visual cryptography schemes. Des Codes Crypt 37(1):169\u2013186","journal-title":"Des Codes Crypt"},{"key":"8351_CR13","unstructured":"Wan S, Lu Y, Yan X, Liu L (2017) Visual secret sharing scheme with (k,n) threshold based on qr codes. In: International Conference on Mobile Ad-Hoc and Sensor Networks. pp 374\u2013379"},{"issue":"2","key":"8351_CR14","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1007\/s11042-014-2365-8","volume":"75","author":"G Wang","year":"2016","unstructured":"Wang G, Liu F, Yan WQ (2016) 2D Barcodes for visual cryptography. Multimedia Tools and Applications 75(2):1223\u20131241","journal-title":"Multimedia Tools and Applications"},{"key":"8351_CR15","first-page":"196","volume":"7128","author":"J Weir","year":"2011","unstructured":"Weir J, Yan WQ (2011) Authenticating visual cryptography shares using 2D barcodes. International Workshop on Digital Watermarking, Springer 7128:196\u2013210","journal-title":"International Workshop on Digital Watermarking, Springer"},{"issue":"1","key":"8351_CR16","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.jvcir.2012.11.001","volume":"24","author":"X Wu","year":"2013","unstructured":"Wu X, Sun W (2013) Random grid-based visual secret sharing with abilities of or and xor decryptions. Journal of Visual Communication and Image Representation 24 (1):48\u201362","journal-title":"Journal of Visual Communication and Image Representation"},{"issue":"1","key":"8351_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s11554-015-0540-4","volume":"14","author":"X Yan","year":"2018","unstructured":"Yan X, Liu X, Yang CN (2018) An enhanced threshold visual secret sharing based on random grids. J Real-Time Image Proc 14(1):61\u201373","journal-title":"J Real-Time Image Proc"},{"issue":"2","key":"8351_CR18","first-page":"1","volume":"77","author":"X Yan","year":"2017","unstructured":"Yan X, Lu Y (2017) Progressive visual secret sharing for general access structure with multiple decryptions. Multimedia Tools and Applications 77(2):1\u201320","journal-title":"Multimedia Tools and Applications"},{"key":"8351_CR19","first-page":"210","volume":"65","author":"P Li","year":"2018","unstructured":"Li P, Liu ZQ, Yang CN (2018) A construction method of (t, k, n)-essential secret image sharing scheme. Signal Processing 65:210\u2013220","journal-title":"Signal Processing"},{"issue":"9","key":"8351_CR20","doi-asserted-by":"publisher","first-page":"3231","DOI":"10.1007\/s11042-013-1784-2","volume":"74","author":"X Yan","year":"2015","unstructured":"Yan X, Wang S, El-Latif AAA, Niu X (2015) Visual secret sharing based on random grids with abilities of AND and XOR lossless recovery. Multimedia Tools and Applications 74(9):3231\u20133252","journal-title":"Multimedia Tools and Applications"},{"key":"8351_CR21","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/j.sigpro.2014.06.011","volume":"105","author":"X Yan","year":"2014","unstructured":"Yan X, Wang S, Niu X (2014) Threshold construction from specific cases in visual cryptography without the pixel expansion. Signal Process 105:389\u2013398","journal-title":"Signal Process"},{"issue":"4","key":"8351_CR22","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.patrec.2003.12.011","volume":"25","author":"CN Yang","year":"2004","unstructured":"Yang CN (2004) New visual secret sharing schemes using probabilistic method. Pattern Recogn Lett 25(4):481\u2013494","journal-title":"Pattern Recogn Lett"},{"key":"8351_CR23","doi-asserted-by":"crossref","unstructured":"Yang CN, Liao JK, Wu FH, Yamaguchi Y (2016) Developing visual cryptography for authentication on smartphones. In: International Conference on Industrial IoT Technologies and Applications, Springer, pp 189\u2013200","DOI":"10.1007\/978-3-319-44350-8_19"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-019-08351-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11042-019-08351-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-019-08351-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,8]],"date-time":"2020-12-08T00:34:44Z","timestamp":1607387684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11042-019-08351-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,9]]},"references-count":23,"journal-issue":{"issue":"9-10","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["8351"],"URL":"https:\/\/doi.org\/10.1007\/s11042-019-08351-0","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,9]]},"assertion":[{"value":"7 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}