kaz29Вестник Казахстанско-Британского технического университетаHerald of the Kazakh-British Technical University1998-66882959-8109Казахстанско-Британский Технический Университет10.55452/1998-6688-2026-23-1-68-81kaz29-2500Research ArticleКОМПЬЮТЕРНЫЕ НАУКИCOMPUTER SCIENCEКРИПТОГРАФИЧЕСКИЙ ПРОТОКОЛ ВЕРИФИЦИРУЕМО ЗАШИФРОВАННОЙ ПОДПИСИ С ВОЗМОЖНОСТЬЮ ПРОВЕРКИ ЧЕРЕЗ ЗАДАННОЕ ВРЕМЯCRYPTOGRAPHIC PROTOCOL OF VERIFIABLY ENCRYPTED SIGNATURE WITH POSSIBILITY OF VERIFICATION AFTER A SPECIFIED TIMEhttps://orcid.org/0000-0002-5172-8339СейткуловЕ. Н.SeitkulovYe. N.

к. ф.-м. н., научный сотрудник

г. Астана

Cand. Phys.-Math. Sc., Research Fellow

Astana

yerzhan.seitkulov@gmail.comhttps://orcid.org/0000-0002-0771-575XОспановР. М.OspanovR. M.

магистр, научный сотрудник

г. Астана

MSc (Tech.), Research Fellow

Astana

ospanovrm@gmail.comhttps://orcid.org/0000-0002-1252-857XЕргалиеваБ. Б.YergaliyevaB. B.

научный сотрудник

г. Астана

Research Fellow

Astana

banu.yergaliyeva@gmail.comhttps://orcid.org/0009-0004-3032-5049УтебаевК. А.UtebayevK. A.

магистрант, научный сотрудник

г. Алматы

Master’s student, Research Fellow

Almaty

utebayevkuat@gmail.comhttps://orcid.org/0000-0003-2115-7130АтановС. К.AtanovS. K.,

д.т.н., профессор

г. Астана

Dr. Tech. Sc., Professor

Astana

atanov_sk@enu.kzЕвразийский национальный университет им. Л.Н.ГумилеваКазахстанL.N. Gumilyov Eurasian National UniversityKazakhstanАлматинский филиал Национального исследовательского ядерного университета «МИФИ»КазахстанAlmaty branch of the National Research Nuclear University MEPhIKazakhstan2026290320262316881Copyright © Сейткулов Е.Н., Оспанов Р.М., Ергалиева Б.Б., Утебаев К.А., Атанов С.К., 20262026Сейткулов Е.Н., Оспанов Р.М., Ергалиева Б.Б., Утебаев К.А., Атанов С.К.Seitkulov Y.N., Ospanov R.M., Yergaliyeva B.B., Utebayev K.A., Atanov S.K.Данная работа распространяется под лицензией Creative Commons Attribution 4.0.This work is licensed under a Creative Commons Attribution 4.0 License.https://vestnik.kbtu.edu.kz/jour/article/view/2500

Одним из современных направлений в области защиты информации является постквантовая криптография. Ее целью является разработка новых квантово-устойчивых криптографических алгоритмов. Важный раздел постквантовой криптографии составляют алгоритмы электронной цифровой подписи. Существует ряд различных подходов к проектированию постквантовых подписей. Одним из основных подходов к проектированию постквантовых криптографических алгоритмов цифровой подписи являются схемы постквантовой цифровой подписи, основанные на хешировании. Схемы постквантовой цифровой подписи, основанные на хешировании, являются одним из основных типов постквантовых криптографических алгоритмов цифровой подписи. Они достаточно эффективны и доказуемо безопасны. Установлена их надежная безопасность как против классических, так и против квантовых атак. Для решения различных задач информационной безопасности существует множество видов цифровых подписей, например, групповые подписи, кольцевые подписи, слепые подписи, верифицируемо зашифрованные подписи и т.д. В данной работе предлагается новый криптографический протокол верифицируемо зашифрованной подписи с возможностью проверки через заданное время на базе постквантового криптографического алгоритма цифровой подписи, основанной на хешировании, TANBA-SPHINCS+. Протокол является эффективной комбинацией постквантового алгоритма цифровой подписи TANBA-SPHINCS+, криптографического протокола, обеспечивающего шифрование данных на заданное время, ECTLC, и схемы верифицируемо зашифрованной подписи.

One of the modern directions in the field of information security is post-quantum cryptography. Its purpose is to develop new quantum-resistant cryptographic algorithms. An important section of post-quantum cryptography is electronic digital signature algorithms. There are a number of different approaches to designing post-quantum signatures. One of the main approaches to designing post-quantum cryptographic digital signature algorithms is hash-based post-quantum digital signature schemes. Hash-based post-quantum digital signature schemes are one of the main types of post-quantum cryptographic digital signature algorithms. They are quite efficient and provably secure. Their reliable security has been established against both classical and quantum attacks. There are many types of digital signatures for solving various information security problems, such as group signatures, ring signatures, blind signatures, verifiably encrypted signatures, etc. This paper proposes a new cryptographic protocol of verifiably encrypted signature with possibility of verification after a specified time based on the post-quantum cryptographic algorithm of hash-based digital signature, TANBA-SPHINCS+. The protocol is an efficient combination of the postquantum digital signature algorithm TANBA-SPHINCS+, the cryptographic protocol providing data encryption for a specified time, ECTLC, and the verifiably encrypted signature scheme.

криптографический протоколцифровая подписьпостквантовая криптографияасимметричная криптографияверифицируемо зашифрованная подписьcryptographic protocoldigital signaturepost-quantum cryptographyasymmetric cryptographyverifiably encrypted signatureРабота выполнена при финансовой поддержке КН МНВО РК, No AP23486901.ReferencesОспанов Р., Сейткулов Е., Ергалиева Б., Утебаев К., Атанов С. TANBA-SPHINCS+ - постквантовый криптографический алгоритм цифровой подписи, основанной на хешировании // Вестник КазНПУ имени Абая. Серия: Физико-математические науки. – 2025. – №1(89). – C. 235–246. https://doi.org/10.51889/2959-5894.2025.89.1.020.Ospanov, R., Sejtkulov, E., Ergalieva, B., Utebaev, K., Atanov, S. TANBA-SPHINCS+ - postkvantovyj kriptograficheskij algoritm cifrovoj podpisi, osnovannoj na heshirovanii. Vestnik KazNPU imeni Abaya. Seriya: Fiziko-matematicheskie nauki, 1(89), 235–246 (2025). https://doi.org/10.51889/2959-5894.2025.89.1.020. (in Russian)Asokan N., Shoup V., Waidner M. Optimistic fair exchange of digital signatures // Advances in Cryptology - EUROCRYPT'98. EUROCRYPT 1998. LNCS. – 1998. – Vol. 1403. – P. 591–606. https://doi.org/10.1007/BFb0054156.Asokan, N., Shoup, V., Waidner, M. Optimistic fair exchange of digital signatures. Advances in Cryptology – EUROCRYPT 1998, 1403, 591–606 (1998). https://doi.org/10.1007/BFb0054156.Boneh D., Gentry C., Lynn B., Shacham H. Aggregate and Verifiably Encrypted Signatures from Bilinear Maps. // Advances in Cryptology – EUROCRYPT 2003. EUROCRYPT 2003. Lecture Notes in Computer Science. – 2003. – Vol. 2656. – P. 416–432. https://doi.org/10.1007/3-540-39200-9_26.Boneh, D., Gentry, C., Lynn, B., Shacham, H. Aggregate and verifiably encrypted signatures from bilinear maps. Advances in Cryptology – EUROCRYPT 2003, 2656, 416–432 (2003). https://doi.org/10.1007/3-540-39200-9_26.Ateniese G. Verifiable encryption of digital signature and applications // ACM Transactions on Information and System Security. – 2004. – Vol. 7(1). – P. 1–20. https://doi.org/10.1145/984334.984335.Ateniese, G. Verifiable encryption of digital signatures and applications. ACM Transactions on Information and System Security, 7(1), 1–20 (2004). https://doi.org/10.1145/984334.984335Lu S., Ostrovsky R., Sahai A., Shacham H., Waters B. Sequential aggregate signatures and multisignatures without random oracles // Advances in Cryptology - EUROCRYPT 2006. EUROCRYPT 2006. LNCS. – 2006. – Vol. 4004. – P. 465–485. https://doi.org/10.1007/11761679_28.Lu, S., Ostrovsky, R., Sahai, A., Shacham, H., Waters, B. Sequential aggregate signatures and multisignatures without random oracles. Advances in Cryptology – EUROCRYPT 2006, 4004, 465–485 (2006). https://doi.org/10.1007/11761679_28Rückert M. Verifiably encrypted signatures from RSA without NIZKs // Progress in Cryptology - INDOCRYPT 2009. INDOCRYPT 2009. LNCS. – 2009. –Vol. 5922. – P. 363–377. https://doi.org/10.1007/978-3-642-10628-6_24.Rückert, M. Verifiably encrypted signatures from RSA without NIZKs. Progress in Cryptology – INDOCRYPT 2009, 5922, 363–377 (2009). https://doi.org/10.1007/978-3-642-10628-6_24Kim K.S., Jeong I.R. Efficient verifiably encrypted signatures from lattices // Int. J. Inf. Secur. – 2014. – Vol. 13. – P. 305–314. https://doi.org/10.1007/s10207-014-0226-0.Kim, K. S., Jeong, I. R. Efficient verifiably encrypted signatures from lattices. International Journal of Information Security, 13, 305–314 (2014). https://doi.org/10.1007/s10207-014-0226-0Shao, Zuhua and Yipeng Gao. Certificate- based verifiably encrypted RSA signatures // Transactions on Emerging Telecommunications Technologies. – 2015. – Vol. 26. – P. 276–289. https://doi.org/10.1002/ett.2607.Shao, Z., Gao, Y.Certificate-based verifiably encrypted RSA signatures. Transactions on Emerging Telecommunications Technologies, 26, 276–289 (2015). https://doi.org/10.1002/ett.2607Shao Z., Gao Y. Practical verifiably encrypted signature based on Waters signatures // IET Information Security. – 2015. – Vol. 9(3). – P. 185–193. https://doi.org/10.1049/iet-ifs.2013.0385.Shao, Z., Gao, Y. Practical verifiably encrypted signature based on Waters signatures. IET Information Security, 9(3), 185–193 (2015). https://doi.org/10.1049/iet-ifs.2013.0385Nishimaki R., Xagawa K. Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES // Cryptology ePrint Archive. – 2015. – Paper 2015/248. https://eprint.iacr.org/2015/248.Nishimaki, R., Xagawa, K. Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES. Cryptology ePrint Archive, Report 2015/248 (2015). URL: https://eprint.iacr.org/2015/248Zhang Y., Hu Y. A New Verifiably Encrypted Signature Scheme from Lattices // J. Comput. Res. Develop. – 2017. – Vol. 54. – P. 305–312. https://dx.doi.org/10.7544/issn1000-1239.2017.20150887.Zhang, Y., Hu, Y. A new verifiably encrypted signature scheme from lattices. Journal of Computer Research and Development, 54, 305–312 (2017). https://doi.org/10.7544/issn1000-1239.2017.20150887Wang F., Shi S. Lattice-Based Encrypted Verifiably Encryption Signature Scheme for the Fair and Private Electronic Commence // IEEE Access. – 2019. – Vol. 7. – P. 147481–147489. https://doi.org/10.1109/ACCESS.2019.2946272.Wang, F., Shi, S. Lattice-based encrypted verifiably encryption signature scheme for fair and private electronic commerce. IEEE Access, 7, 147481–147489 (2019). https://doi.org/10.1109/ACCESS.2019.2946272Yang X., Lau W.F., Ye Q., Au M.H., Liu J.K., Cheng J. Practical escrow protocol for Bitcoin // IEEE Trans. Inf. Forensics Security. – 2020. – Vol. 15. – P. 3023–3034. https://doi.org/10.1109/TIFS.2020.2976607.Yang, X., Lau, W. F., Ye, Q., Au, M. H., Liu, J. K., Cheng, J. Practical escrow protocol for Bitcoin. IEEE Transactions on Information Forensics and Security, 15, 3023–3034 (2020). https://doi.org/10.1109/TIFS.2020.2976607Fournier L. One-Time Verifiably Encrypted Signatures AKA Adaptor Signatures. – 2019. URL: https://raw.githubusercontent.com/LLFourn/one-time-VES/master/main.pdf.Fournier, L. One-time verifiably encrypted signatures (adaptor signatures). Technical report (2019). URL: https://raw.githubusercontent.com/LLFourn/one-time-VES/master/main.pdfYang X., Liu M., Au M.H., Luo X., Ye Q. Efficient Verifiably Encrypted ECDSA-Like Signatures and Their Applications // IEEE Trans. Inf. Forensics Secur. – 2022. – Vol. 17. – P. 1573–1582. https://doi.org/10.1109/TIFS.2022.3165978.Yang, X., Liu, M., Au, M. H., Luo, X., Ye, Q. Efficient verifiably encrypted ECDSA-like signatures and their applications. IEEE Transactions on Information Forensics and Security, 17, 1573–1582 (2022). https:// doi.org/10.1109/TIFS.2022.3165978Lu X., Yin W., Zhang P. Lattice-Based Verifiably Encrypted Signature Scheme Without Gaussian Sampling for Privacy Protection in Blockchain // Sustainability. – October 31, 2022. – Vol. 14. – No. 21. – P. 14225. https://doi.org/10.3390/su142114225.Lu, X., Yin, W., Zhang, P. Lattice-based verifiably encrypted signature scheme without Gaussian sampling for privacy protection in blockchain. Sustainability, 14(21), 14225 (2022). https://doi.org/10.3390/su142114225Aumasson J.-P., Bernstein D.J., Beullens W., Dobraunig C., Eichlseder M., Fluhrer S., Gazdag S.-L., Hülsing A., Kampanakis P., Kölbl S. et al. SPHINCS+ // Submission to the 3rd Round of the NIST Post-Quantum Project. – 2022. – Vol. 3.1. https://sphincs.org/data/sphincs+-r3.1-specification.pdf.Aumasson, J.-P., Bernstein, D. J., Beullens, W., Dobraunig, C., Eichlseder, M., Fluhrer, S., Gazdag, S.-L., Hülsing, A., Kampanakis, P., Kölbl, S. et al. SPHINCS+. Submission to the NIST Post-Quantum Cryptography Project, version 3.1 (2022). URL: https://sphincs.org/data/sphincs+-r3.1-specification.pdfBernstein D. J., Hülsing A., Kölbl S., Niederhagen R., Rijneveld J., Schwabe P.The SPHINCS+ signature framework // Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security (CCS ’19). – London, UK, 2019. – P. 2129–2146.Bernstein, D. J., Hülsing, A., Kölbl, S., Niederhagen, R., Rijneveld, J., Schwabe, P. The SPHINCS+ signature framework. Proceedings of the ACM SIGSAC Conference on Computer and Communications Security, 2129–2146 (2019).National Institute of Standards and Technology. Stateless Hash-Based Digital Signature Standard. – Washington, D.C.: Department of Commerce, 2024. – (Federal Information Processing Standards Publications; FIPS 205). https://doi.org/10.6028/NIST.FIPS.205.National Institute of Standards and Technology. Stateless hash-based digital signature standard. Federal Information Processing Standards Publications, FIPS 205 (2024). https://doi.org/10.6028/NIST.FIPS.205Kiktenko E., Bulychev A., Karagodin P., Pozhar N., Anufriev M., Fedorov A. SPHINCS+ postquantum digital signature scheme with Streebog hash function // AIP Conference Proceedings. – 2020. – Vol. 2241. – P. 020014.Kiktenko, E., Bulychev, A., Karagodin, P., Pozhar, N., Anufriev, M., Fedorov, A. SPHINCS+ postquantum digital signature scheme with Streebog hash function. AIP Conference Proceedings, 2241, 020014 (2020).Sim M., Eum S., Song G., Kwon H., Jang K., Kim H., Kim H., Yang Y., Kim W., Lee W. K. et al. K-XMSS and K-SPHINCS+: Hash-based signatures with Korean cryptography algorithms // Cryptology ePrint Archive. – 2022. – Report 2022/152. – URL: https://eprint.iacr.org/2022/152.Sim, M., Eum, S., Song, G., Kwon, H., Jang, K., Kim, H., Kim, H., Yang, Y., Kim, W., Lee, W. K. et al. K-XMSS and K-SPHINCS+: Hash-based signatures with Korean cryptography algorithms. Cryptology ePrint Archive, Report 2022/152 (2022). URL: https://eprint.iacr.org/2022/152Tasmagambetov O., Seitkulov Ye., Ospanov R., Yergaliyeva B. Fault-tolerant backup storage system for confidential data in distributed servers // TELKOMNIKA (Telecommunication Computing Electronics and Control). – 2023. – Vol. 21. – No. 5. – P. 1030–1038. https://doi.org/10.12928/telkomnika.v21i5.25305.Tasmagambetov, O., Seitkulov, E., Ospanov, R., Yergaliyeva, B. Fault-tolerant backup storage system for confidential data in distributed servers. TELKOMNIKA, 21(5), 1030–1038 (2023). https://doi.org/10.12928/telkomnika.v21i5.25305Tang C., Chronopoulos A.T. An efficient distributed key generation protocol for secure communications with causal ordering // Proceedings of the 11th International Conference on Parallel and Distributed Systems (ICPADS 2005). – Fukuoka, Japan, July 20–22, 2005. – Vol. 2. – P. 285–289.Tang, C., Chronopoulos, A. T. An efficient distributed key generation protocol for secure communications with causal ordering. Proceedings of the International Conference on Parallel and Distributed Systems, 2, 285–289 (2005).Pedersen T.P. Non-interactive and information-theoretic secure verifiable secret sharing // Lecture Notes in Computer Science. – 1991. – Vol. 576. – P. 129–140. (Proc. of CRYPTO’91).Pedersen, T. P. Non-interactive and information-theoretic secure verifiable secret sharing. Lecture Notes in Computer Science, 576, 129–140 (1991).Trung M. M., Do L. P., Tuan D. T., Thanh N. V., Tri N. Q. Design a cryptosystem using elliptic curves cryptography and Vigenère symmetric key // International Journal of Electrical and Computer Engineering (IJECE). – 2023. – Vol. 13. – No. 2. – P. 1734–1743. https://doi.org/10.11591/ijece.v13i2.Trung, M. M., Do, L. P., Tuan, D. T., Thanh, N. V., Tri, N. Q. Design a cryptosystem using elliptic curves cryptography and Vigenère symmetric key. International Journal of Electrical and Computer Engineering, 13(2), 1734–1743 (2023). https://doi.org/10.11591/ijece.v13i2.pp1734-1743

The authors declare that there are no conflicts of interest present.