{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:29:41Z","timestamp":1754155781746,"version":"3.41.2"},"reference-count":26,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2016,4,4]],"date-time":"2016-04-04T00:00:00Z","timestamp":1459728000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJPCC"],"published-print":{"date-parts":[[2016,4,4]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>The detection of an adversary in secret image sharing has been a problematic side in the reconstruction phase. Some of verifiable secret sharing solutions have been proposed to solve the problem. However, there is some computational limitation in the previous schemes. The purpose of this paper is to analyze the importance of consistency for detecting an adversary in a secure reconstruction phase. Strong <jats:italic>t<\/jats:italic>-consistency assures the correctness of reconstructed secret as long as participants P \u2208 N and n(P) = <jats:italic>t<\/jats:italic>. Consistency is a solution for preventing the participant to be absent and helps the dealer to easily detect the adversary without an additional verification step.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>This paper focuses on secure reconstruction, and uses two different approaches, namely, single-secret and multi-secret, to experiment the relationship between the given variable (<jats:italic>t,m,n<\/jats:italic>) and the adversaries by observing the quality test result, polynomial approach and visualization.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>The results show that <jats:italic>t<\/jats:italic> and <jats:italic>m<\/jats:italic> are inversely proportional to the image quality without respect to the polynomial approach. The reconstruction phase is declared as securely conducted when m = 2<jats:italic>t<\/jats:italic> \u2212 1, for both single- and multi-secret approaches.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>The application of consistency is a considerable step for securing the secret from an adversary by combining the reconstruction phase and the consistency combination at once, removing the need for additional separate verification steps for decreasing the computational time, especially in secret image sharing.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/ijpcc-01-2016-0006","type":"journal-article","created":{"date-parts":[[2016,4,29]],"date-time":"2016-04-29T08:27:57Z","timestamp":1461918477000},"page":"107-126","source":"Crossref","is-referenced-by-count":0,"title":["An in-depth analysis of strong <i>t<\/i>-consistency on secret image sharing"],"prefix":"10.1108","volume":"12","author":[{"given":"Anneke Soraya","family":"Hidayat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gil-Je","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eun-Jun","family":"Yoon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kee-Young","family":"Yoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"key":"key2020121621561831100_ref001","unstructured":"Anon. (2009), \u201cExplorable.com: statistical correlation\u201d, available at: https:\/\/explorable.com\/statistical-correlation (accessed 10 August 2015)."},{"issue":"2","key":"key2020121621561831100_ref002","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/TIT.1983.1056651","article-title":"A modular approach to key safeguarding","volume":"29","year":"1983","journal-title":"IEEE Transactions on Information Theory"},{"key":"key2020121621561831100_ref003","first-page":"11","article-title":"Secret-sharing schemes: a survey","volume-title":"Coding and Cryptology","year":"2011"},{"first-page":"313","article-title":"Safeguarding cryptographic keys","year":"1979","key":"key2020121621561831100_ref004"},{"issue":"2","key":"key2020121621561831100_ref005","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1142\/S0218001409007090","article-title":"Secret image sharing: a Boolean-operations-based approach combining benefits of polynomial-based and fast approaches","volume":"23","year":"2009","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"key":"key2020121621561831100_ref006","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.jss.2014.01.001","article-title":"A secure Boolean-based multi-secret image sharing scheme","volume":"92","year":"2014","journal-title":"Journal of Systems and Software"},{"issue":"18","key":"key2020121621561831100_ref007","doi-asserted-by":"crossref","first-page":"3592","DOI":"10.1002\/sec.1283","article-title":"A cheater identifiable multi-secret sharing scheme based on the Chinese remainder theorem","volume":"8","year":"2015","journal-title":"Security and Communication Networks"},{"issue":"2","key":"key2020121621561831100_ref008","first-page":"69","article-title":"A multi-secret sharing scheme based on the CRT and RSA","volume":"2","year":"2015","journal-title":"International Journal of Network Security"},{"issue":"5","key":"key2020121621561831100_ref009","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1109\/TIFS.2014.2384393","article-title":"Randomized component and its application to (t,m,n)-group oriented secret sharing","volume":"10","year":"2015","journal-title":"IEEE Transactions on Information Forensics and Security"},{"issue":"3","key":"key2020121621561831100_ref010","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1002\/sec.758","article-title":"Secure secret reconstruction and multi-secret sharing schemes with unconditional security","volume":"7","year":"2014","journal-title":"Security and Communication Networks"},{"issue":"6","key":"key2020121621561831100_ref013","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1002\/sec.807","article-title":"Verifiable secret sharing based on the Chinese remainder theorem","volume":"7","year":"2014","journal-title":"Security and Communication Networks"},{"issue":"1","key":"key2020121621561831100_ref011","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s10623-008-9265-8","article-title":"Detection and identification of cheaters in (t, n) secret sharing scheme","volume":"52","year":"2009","journal-title":"Designs, Codes and Cryptography"},{"issue":"16","key":"key2020121621561831100_ref012","doi-asserted-by":"crossref","first-page":"3059","DOI":"10.1016\/j.ins.2010.04.016","article-title":"Strong (n, t, n) verifiable secret sharing scheme","volume":"180","year":"2010","journal-title":"Information Sciences"},{"first-page":"357","article-title":"Consistency analysis for secure reconstruction in secret image sharing","year":"2015","key":"key2020121621561831100_ref014"},{"issue":"3","key":"key2020121621561831100_ref015","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/S0164-1212(03)00239-5","article-title":"Secret image sharing with steganography and authentication","volume":"73","year":"2004","journal-title":"Journal of Systems and Software"},{"issue":"3","key":"key2020121621561831100_ref016","first-page":"36","article-title":"Double verification secret sharing mechanism based on adaptive pixel pair matching","volume":"11","year":"2015","journal-title":"ACM Transactions on Multimedia Computing, Communications, and Applications (TOMM)"},{"issue":"7","key":"key2020121621561831100_ref017","doi-asserted-by":"crossref","first-page":"1282","DOI":"10.1002\/dac.2760","article-title":"A novel verifiable secret sharing mechanism using theory of numbers and a method for sharing secrets","volume":"28","year":"2015","journal-title":"International Journal of Communication Systems"},{"key":"key2020121621561831100_ref018","first-page":"371","article-title":"How to share a secret","volume-title":"Cryptography","year":"1983"},{"issue":"4","key":"key2020121621561831100_ref019","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1049\/iet-ifs.2012.0366","article-title":"Polynomial differential-based strong (n, t, n)-verifiable secret sharing","volume":"7","year":"2013","journal-title":"IER Information Security"},{"issue":"11","key":"key2020121621561831100_ref020","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","year":"1979","journal-title":"Communications of the ACM"},{"issue":"4","key":"key2020121621561831100_ref021","first-page":"234","article-title":"Dynamic and verifiable multi-secret sharing scheme based on Hermite interpolation and bilinear maps","volume":"9","year":"2014","journal-title":"Information Security, IET"},{"issue":"5","key":"key2020121621561831100_ref022","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1016\/S0097-8493(02)00131-0","article-title":"Secret image sharing","volume":"26","year":"2002","journal-title":"Computers & Graphics"},{"issue":"2","key":"key2020121621561831100_ref023","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1049\/iet-ifs.2012.0064","article-title":"Fair (t,n) threshold secret sharing scheme","volume":"7","year":"2013","journal-title":"Information Security, IET"},{"issue":"3","key":"key2020121621561831100_ref024","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF02252871","article-title":"How to share a secret with cheaters","volume":"1","year":"1989","journal-title":"Journal of Cryptology"},{"key":"key2020121621561831100_ref025","first-page":"31","article-title":"NPCR and UACI randomness tests for image encryption","year":"2011","journal-title":"Cyber Journals: Multidisciplinary Journals in Science and Technology, Journal of Selected Areas in Telecommunications (JSAT)"},{"key":"key2020121621561831100_ref026","first-page":"1","article-title":"Enhanced Boolean-based multi secret image sharing scheme","year":"2015","journal-title":"Journal of Systems and Software"}],"container-title":["International Journal of Pervasive Computing and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/IJPCC-01-2016-0006","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJPCC-01-2016-0006\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJPCC-01-2016-0006\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T22:05:07Z","timestamp":1753394707000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijpcc\/article\/12\/1\/107-126\/161160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,4]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,4,4]]}},"alternative-id":["10.1108\/IJPCC-01-2016-0006"],"URL":"https:\/\/doi.org\/10.1108\/ijpcc-01-2016-0006","relation":{},"ISSN":["1742-7371"],"issn-type":[{"type":"print","value":"1742-7371"}],"subject":[],"published":{"date-parts":[[2016,4,4]]}}}