An Efficient Post-Quantum One-Time Signature Scheme

Maksim Iavich, Giorgi Iashvili, Sergiy O. Gnatyuk +2 more

Yerzhan N. Seitkulov, R. M. Ospanov, B. B. Yergaliyeva +2 more

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.

Chanyoung Ko, Youngkyung Lee, Kwangsu Lee +1 more

Олексій Башук

In the era of active information technologies and device development, the emergence of portable and general-purpose quantum computers is only a matter of time. And although the benefit of their many times greater efficiency, compared to ordinary bit computers, will be obvious, at the same time, they will bring many vulnerabilities to modern algorithms of cryptography and cybersecurity. To prevent this from happening, society has already started researching post-quantum protocols to replace modern ones. Digital signature protocols were no exception. Thus, one of the approaches was constructing post-quantum digital signature protocols based on hash functions. The first representatives were schemes of one-time signatures based on hash functions, which were protected from the capabilities of quantum computers but had the obvious disadvantage of one-time use. The most famous is the so-called Lamport one-time signature. However, this disadvantage of one-time use has been solved by proposing different schemes of multi-time digital signatures based on the creation and use of many one-time signatures. Thus, chain-based and tree-based schemes of multi-time signatures were proposed. This work is devoted to the implementation and comparison of various multi-time signature schemes. During the research, theoretical estimates of memory usage and time required for the operations of various schemes were given. Further implementation of these schemes and final measurements showed the correspondence of theoretical estimates with empirical results and clearly demonstrated the advantages and disadvantages of different schemes. Thus, tree-based schemes showed the best performance, especially those where the tree is built sequentially. However, in certain cases, it makes sense to use a tree with full-depth construction. Due to the relative novelty and small amount of research in this field, multi-time digital signatures have much room for further research, for example, considering N-ary trees and comparing them with binary ones.

Devraj Nerpagar, Meenakshi Tripathi

Ming-Yi Syu, Wen‐Chung Kuo, Ming-Chun Wei +1 more

Recently, NIST released the quantum cryptography standard, which includes three new encryption algorithms capable of effectively resisting attacks from quantum computers. Experts predict that quantum computers with the ability to break current encryption methods may emerge within the next decade. In particular, the advent of Shor’s algorithm [1] has rendered public-key encryption systems based on factoring and discrete logarithm problems vulnerable. Therefore, the release of the PQC (Post-Quantum Cryptography) standard is especially timely and significant. NIST encourages system administrators to begin integrating these standards into their systems immediately to ensure future security.Among these three new encryption algorithms, SLH-DSA (derived from SPHINCS+ [2]) is a stateless hash-based digital signature scheme. This innovative scheme is designed to provide robust security while maintaining efficiency. In the SLH-DSA signature scheme, the One-Time Signature (OTS) serves as its fundamental building block. This means that improving the OTS directly enhances the overall performance of the SLH-DSA scheme.Hash-based signature schemes are generally constructed using OTS schemes. The underlying OTS scheme plays a crucial role in determining the key size and signature size of hash-based signature schemes. We propose a novel signature scheme that allows partial key reuse while maintaining a minimum quantum security level of 128 bits. Compared to the popular Winternitz OTS scheme [3] [4] [5], our proposed signature scheme demonstrates superior performance in terms of key and signature sizes for the same number of signatures, while still preserving post-quantum security.