{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:27:31Z","timestamp":1754155651238,"version":"3.41.2"},"reference-count":10,"publisher":"Emerald","issue":"4","license":[{"start":{"date-parts":[[2014,10,7]],"date-time":"2014-10-07T00:00:00Z","timestamp":1412640000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,10,7]]},"abstract":"\n Purpose<\/jats:title>\n \u2013 The purpose of this study was to develop and test SCoP. Users find comparing long meaningless strings of alphanumeric characters difficult. While visual hashes \u2013 where users compare images rather than strings \u2013 have been proposed as an alternative, people are unable to sufficiently distinguish more than 30 bits, which does not provide adequate security against collision attacks. Our goal is to improve the situation. <\/jats:p>\n <\/jats:sec>\n \n Design\/methodology\/approach<\/jats:title>\n \u2013 A visual hash scheme was developed using shapes, colours, patterns and position parameters. It was evaluated in a series of pilot user studies and improved iteratively, leading to SCoP, which encodes 60 distinguishable bits. We tested SCoP further in two follow-up studies, simulating verifying in remote electronic voting and https<\/jats:uri> certificate validation. <\/jats:p>\n <\/jats:sec>\n \n Findings<\/jats:title>\n \u2013 Participants attained an average accuracy rate of 97 per cent with SCoP when comparing two visual hash images, one placed above the other. From the follow-up studies, SCoP was seen to be more promising for the https<\/jats:uri> certificate validation use case, with direct image comparison, while a low average accuracy rate in simulating verifiability in remote electronic voting limits its applicability in an image-recall use case. <\/jats:p>\n <\/jats:sec>\n \n Research limitations\/implications<\/jats:title>\n \u2013 Participants achieved high accuracy rates in unrealistic situations, where the images appeared on the screen at the same time and in the same size. Studies in more realistic situations are therefore necessary. <\/jats:p>\n <\/jats:sec>\n \n Originality\/value<\/jats:title>\n \u2013 We identify a visual hash scheme encoding a higher number of distinguishable bits than previously reported in literature, and extend the testing to realistic scenarios.<\/jats:p>\n <\/jats:sec>","DOI":"10.1108\/imcs-11-2013-0082","type":"journal-article","created":{"date-parts":[[2014,10,29]],"date-time":"2014-10-29T06:51:52Z","timestamp":1414565512000},"page":"382-392","source":"Crossref","is-referenced-by-count":0,"title":["Developing and testing SCoP \u2013 a visual hash scheme"],"prefix":"10.1108","volume":"22","author":[{"given":"M.","family":"Maina Olembo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timo","family":"Kilian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Stockhardt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"H\u00fclsing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Melanie","family":"Volkamer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"key":"key2020122802173631300_b1","unstructured":"Adida, B.\n (2008), \u201cHelios: web-based open-audit voting\u201d, Proceedings of the 17th Symposium on Security, San Jose, CA, pp. 335-348."},{"key":"key2020122802173631300_b2","doi-asserted-by":"crossref","unstructured":"Ellison, C.\n and \n Dohrmann, S.\n (2003), \u201cPublic-key support for group collaboration\u201d, ACM Transactions on Information and System Security (TISSEC), Vol. 6 No. 4, pp. 547-565.","DOI":"10.1145\/950191.950195"},{"key":"key2020122802173631300_b3","unstructured":"Ford, B.\n , \n Strauss, J.\n , \n Lesniewski-Laas, C.\n , \n Rhea, S.\n , \n Kaashoeck, F.\n and \n Morris, R.\n (2006), \u201cPersistent personal names for globally connected mobile devices\u201d, Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation (OSDI), USENIX Association, Seattle, WA, pp. 233-248."},{"key":"key2020122802173631300_b4","unstructured":"Gallery of Random Art\n , (2013), available at: www.random-art.org (accessed 26 October 2013)."},{"key":"key2020122802173631300_b5","doi-asserted-by":"crossref","unstructured":"Hsiao, H.-C.\n , \n Lin, Y.-H.\n , \n Studer, A.\n , \n Studer, C.\n , \n Wang, K.-H.\n , \n Kikuchi, H.\n , \n Perrig, A.\n , \n Sun, H.-M.\n and \n Yang, B.-Y.\n (2009), \u201cA study of user-friendly hash comparison schemes\u201d, Proceedings of the 2009 Annual Computer Security Applications Conference, ACSAC \u201809, Washington DC, pp. 105-114.","DOI":"10.1109\/ACSAC.2009.20"},{"key":"key2020122802173631300_b6","doi-asserted-by":"crossref","unstructured":"Josefsson, S.\n (2006), \u201cThe Base16, Base32, and Base64 data encodings, RFC4648\u201d, available at: https:\/\/tools.ietf.org\/html\/rfc4648 (accessed 26 October 2013).","DOI":"10.17487\/rfc4648"},{"key":"key2020122802173631300_b7","doi-asserted-by":"crossref","unstructured":"Lin, Y.-H.\n , \n Studer, A.\n , \n Hsiao, H.-C.\n , \n McCune, J.M.\n , \n Wang, K.-H.\n , \n Krohn, M.\n , \n Lin, P.-L.\n , \n Perrig, A.\n , \n Sun, H.-M.\n and \n Yang, B.-Y.\n (2009), \u201cSpate: small-group PKI-less authenticated trust establishment\u201d, Proceedings of the 7th International Conference on Mobile Systems, Applications and Services, Wroclaw, Poland, ACM, pp. 1-14.","DOI":"10.1145\/1555816.1555818"},{"key":"key2020122802173631300_b8","unstructured":"Perrig, A.\n and \n Song, D.\n (1999), \u201cHash visualization: a new technique to improve real-world security\u201d, Proceedings of the 1999 International Workshop on Cryptographic Techniques and E-Commerce, Hong Kong, pp. 131-138."},{"key":"key2020122802173631300_b9","doi-asserted-by":"crossref","unstructured":"Reynolds, R.E.\n , \n White, R.M.\n and \n Hilgendorf, R.L.\n (1972), \u201cDetection and recognition of colored signal lights\u201d, Human Factors, Vol. 14 No. 3, pp. 227-236.","DOI":"10.1177\/001872087201400304"},{"key":"key2020122802173631300_b10","doi-asserted-by":"crossref","unstructured":"Shepard, R.N.\n (1967), \u201cRecognition memory for words, sentences and pictures\u201d, Journal of Verbal Learnings and Verbal Behaviour, Vol. 6 No. 1, pp. 156-163.","DOI":"10.1016\/S0022-5371(67)80067-7"}],"container-title":["Information Management & Computer Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/IMCS-11-2013-0082","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IMCS-11-2013-0082\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IMCS-11-2013-0082\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T21:50:50Z","timestamp":1753393850000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ics\/article\/22\/4\/382-392\/176026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,7]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,10,7]]}},"alternative-id":["10.1108\/IMCS-11-2013-0082"],"URL":"https:\/\/doi.org\/10.1108\/imcs-11-2013-0082","relation":{},"ISSN":["0968-5227"],"issn-type":[{"type":"print","value":"0968-5227"}],"subject":[],"published":{"date-parts":[[2014,10,7]]}}}