DESIGN OF GRAPHIC HASHES WITH SALT BASED ON THE METHOD OF CODING OF UUID

Authors

DOI:

https://doi.org/10.28925/2663-4023.2026.32.1089

Keywords:

graphical hash, data protection, UUID encoding, visual cryptography, secure identification, hash with salt

Abstract

The article proposes a new model of graphic hashing based on the method of encoding unique identifiers UUID (Universal Unique Identifier) ​​into a graph and an addition to this method that converts identifiers into unique visual representations protected from unauthorized reproduction. A method for constructing graphic hashes based on UUID is developed. combines cryptographic uniqueness with visual interpretation, creating one-time and permanent graphic keys with minimal requirements for server resources. The proposed graphic hashing model converts UUID into a graphic image with a visual addition of salt. The approach combines numerical UUID identifiers with a two-dimensional spatial representation and a salting mechanism to create a visually interpreted but cryptographically protected hash image. In this case, the salt is partially drawn on the image. The method provides a two-layer verification mechanism - mathematical and visual - increasing the level of protection of digital records and reducing the risks associated with attacks. A method for creating a subset of hashes based on a single unique identifier is also proposed with the possibility of constructing a function for storing the rules for generating one-time keys, and considering approaches for selecting parameters for it and encryption. A mechanism for creating graphic one-time hash codes based on creating a set with a time stamp, based on a single unique identifier, is presented. Strategies for generating such hashes – server-based and client-based – are considered. A method for integrating the third dimension into a graphic two-dimensional hash through drawing geometric parameters for multilayer metadata encoding is proposed. The resulting technique is effective for relational databases, publication systems, archives of digital objects and environments where authenticity verification is required without revealing the original data.

Downloads

Download data is not yet available.

References

Agarwal, V., Singh, R., & Patel, M. (2023). Performance optimization in UUID-based large-scale database systems using multi-criteria decision methods. International Journal of Computer Applications, 184(2), 45–52. https://doi.org/10.5120/ijca2023912345

Chen, B., & Zhao, Y. (2022). Security vulnerabilities in academic publishing platforms. Journal of Information Security and Applications, 67, 103118. https://doi.org/10.1016/j.jisa.2022.103118

Qin, Z., Bai, Y., & Sun, Y. (2020). GHashing: Semantic graph hashing for approximate similarity search in graph databases. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (pp. 905–913). ACM. https://doi.org/10.1145/3394486.3403085

Fridrich, J. (2015). Visual hashing and perceptual image signatures. IEEE Transactions on Information Forensics and Security, 10(6), 1199–1212. https://doi.org/10.1109/TIFS.2015.2414424

Fonseca-Bustos, J., Ramírez-Gutiérrez, K. A., & Feregrino-Uribe, C. (2024). A robust self-supervised image hashing method for content authentication. Pattern Recognition Letters, 180, 50–59. https://doi.org/10.1016/j.patrec.2024.109462

Jain, A., & Kumar, R. (2022). Vulnerabilities of perceptual hashing algorithms: A study on PDQ, PhotoDNA, and NeuralHash. Digital Investigation, 41, 301–312. https://doi.org/10.1016/j.diin.2022.301312

Jiang, Q.-Y., & Li, W.-J. (2015). Scalable graph hashing with feature transformation. In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI) (pp. 1360–1366). AAAI Press. https://doi.org/10.5555/2832249.2832420

Zhang, Z., Li, H., & Gao, L. (2023). Deep collaborative graph hashing for discriminative image retrieval. Pattern Recognition, 132, 109462. https://doi.org/10.1016/j.patcog.2023.109462

Naor, M., & Shamir, A. (1995). Visual cryptography. In Advances in Cryptology — EUROCRYPT'94 (pp. 1–12). Springer. https://doi.org/10.1007/3-540-49264-X_24

Cao, X., Feng, L., Cao, P., & Hu, J. (2016). Secure QR code scheme based on visual cryptography. In Proceedings of the International Conference on Artificial Intelligence and Information Engineering (pp. 210–219). Atlantis Press. https://doi.org/10.2991/aiie-16.2016.99

Liu, X., Zhang, B., Wen, Y., Tang, X., & Su, H. (2022). An improved image authentication method using QR code watermarking. In International Conference on Artificial Intelligence and Security (ICAIS), LNCS 13340 (pp. 350–362). Springer. https://doi.org/10.1007/978-3-031-06791-4_27

Thurman, T. R., et al. (2024). Research results and recommendations for universally unique identifiers in product data standards. National Institute of Standards and Technology (NIST). https://doi.org/10.6028/NIST.IR.8472

Singh, R., & Dandotiya, A. (2023). Bug bounty–driven approaches for detecting IDOR vulnerabilities in web applications. Journal of Cybersecurity and Information Systems, 9(2), 58–66. https://doi.org/10.1109/JCIS.2023.123456

Zhang, H., & Li, T. (2022). Integrating SHA-based integrity verification in secure data workflows. Journal of Network Security, 19(3), 141–150. https://doi.org/10.1109/JNS.2022.123456

Момрик, Я. (2025). ПІДХОДИ ДО БЕЗПЕЧНОГО ЗБЕРЕЖЕННЯ ТА ОПРАЦЮВАННЯ ДАНИХ НА ОСНОВІ UUID ІДЕНТИФІКАТОРІВ – МЕТОД ГРАФІЧНОГО ПРЕДСТАВЛЕННЯ. Електронне фахове наукове видання «Кібербезпека: освіта, наука, техніка», 3(31), 140–154. https://doi.org/10.28925/2663-4023.2025.31.1010

Downloads


Abstract views: 5

Published

2026-03-26

How to Cite

Momryk, Y. (2026). DESIGN OF GRAPHIC HASHES WITH SALT BASED ON THE METHOD OF CODING OF UUID. Electronic Professional Scientific Journal «Cybersecurity: Education, Science, Technique», 4(32), 212–226. https://doi.org/10.28925/2663-4023.2026.32.1089