Abstract
It is expected the massive release of quantum computers in the near future. Quantum computers can easily break the crypto schemes, which are used in practice. Therefore, classical encryption systems have become vulnerable to quantum computer-based attacks. This involves the research efforts that look for encryption schemes that are immune to quantum computer-based attacks. This paper describes the digital signature schemes, which are safe against quantum computer attacks, but these schemes have different efficiency problems. The signature size of the scheme is very large and one-way function are used many time during the signature process. The paper offers the ways of reducing the signature size and acceleration the process of using one-way functions. It is offered to integrate the quantum key distribution algorithms into the scheme. It is also offered to use Blake family hash function as the one-way function.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Paquin, C., Stebila, D., Tamvada, G.: Benchmarking post-quantum cryptography in TLS. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 72–91. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-44223-1_5
Ajtai, M.: Generating hard instances of lattice problems. In Complexity of computations and proofs, volume 13 of Quad. Mat., pp. 1–32. Dept. Math., Seconda Univ. Napoli, Caserta (2004). Preliminary version in STOC 1996. 8. Babai, L.: On Lovász lattice reduction and the nearest lattice point problem. Combinatorica, 6:1*13 (1986)
Buchmann, J., Dahmen, E., Klintsevich, E., Okeya, K., Vuillaume, C.: Merkle signatures with virtually unlimited signature capacity. In: Katz, J., Yung ,M. (eds.) Ap-plied Cryptography and Network Security. ACNS 2007. Lecture Notes in Computer Science, vol 4521. Springer, Berlin, Heidelberg (2007). https://doi.org/10.1007/978-3-540-72738-5_3
Katz, J., Yung, M. (eds.): ACNS 2007. LNCS, vol. 4521. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-72738-5
Lee, D., Park, N.: Blockchain based privacy preserving multimedia intelligent video surveillance using secure Merkle tree. Multimedia Tools Appl. 1–18 (2020). https://doi.org/10.1007/s11042-020-08776-y
Gagnidze, A., Iavich, M., Iashvili, G.: Novel version of merkle cryptosystem. Bulletin of the Georgian National Academy of Sciences (2017)
Sklavos, N., Kitsos, P.: BLAKE HASH Function Family on FPGA: From the Fastest to the Smallest. In: 2010 IEEE Computer Society Annual Symposium on VLSI, pp. 139–142. Lixouri, Greece (2010). https://doi.org/10.1109/ISVLSI.2010.115
Wang, H., Zhang, H.: A fast pseudorandom number generator with BLAKE hash function. Wuhan Univ. J. Nat. Sci. 15, 393–397 (2010). https://doi.org/10.1007/s11859-010-0672-0
Gottesman, D., Lo, D., Lutkenhaus, N., Preskill, J.: Security of quantum key distribution with imperfect devices. In: International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings, Chicago, IL, USA (2004). https://doi.org/10.1109/ISIT.2004.1365172
Liao, S.K., Cai, W.Q., Liu, W.Y.: Satellite-to-ground quantum key distribution. Nature 549, 43–47 (2017). https://doi.org/10.1038/nature23655
Hu, Z., Gnatyuk, S., Okhrimenko, T., Kinzeryavyy, V., Iavich, M., Yubuzova, K.: High-speed privacy amplification method for deterministic quantum cryptography protocols using pairs of entangled Qutrits. CEUR Workshop Proc. 2393, 810–821 (2019)
Gnatyuk, S., Okhrimenko, T., Iavich, M., Berdibayev, R.: Intruder control mode simulation of deterministic quantum cryptography protocol for depolarized quantum channel. In: Proceedings of 2019 International Scientific-Practical Conference on the Problems of Infocommunications. Science and Technology (PIC S&T 2019), pp. 825–828. Kyiv, Ukraine, October 08–11 (2019)
Lucamarini, M., Yuan, Z.L., Dynes, J.F.: Overcoming the rate–distance limit of quantum key distribution without quantum repeaters. Nature 557, 400–403 (2018). https://doi.org/10.1038/s41586-018-0066-6
Lucamarini, M., Yuan, Z. L., Dynes, J. F., Shields, A. J.: Overcoming the rate–distance limit of quantum key distribution without quantum repeaters. Nature (London) 557, 400 (2018)
Cui, C.-H., et al.: Twin-field quantum key distribution without phase postselection. Phys. Rev. Appl. 11, 034053 (2019)
Acknowledgement
The work was conducted as a part of PHDF-19–519 financed by Shota Rustaveli National Science Foundation of Georgia.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Iavich, M., Iashvili, G., Gnatyuk, S., Tolbatov, A., Mirtskhulava, L. (2021). Efficient and Secure Digital Signature Scheme for Post Quantum Epoch. In: Lopata, A., Gudonienė, D., Butkienė, R. (eds) Information and Software Technologies. ICIST 2021. Communications in Computer and Information Science, vol 1486. Springer, Cham. https://doi.org/10.1007/978-3-030-88304-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-88304-1_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-88303-4
Online ISBN: 978-3-030-88304-1
eBook Packages: Computer ScienceComputer Science (R0)