Open AccessBlind signature protocols based on hidden discrete logarithm problem
Author(s) -
Dmitriy N. Moldovyan,
A. A. Moldovyan,
D.Yu. Guryanov
Publication year - 2020
Publication title -
informacionno-upravlâûŝie sistemy
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.202
H-Index - 6
eISSN - 2541-8610
pISSN - 1684-8853
DOI - 10.31799/1684-8853-2020-3-71-78
Subject(s) - blind signature , discrete logarithm , blinding , computer science , post quantum cryptography , theoretical computer science , digital signature , cryptography , signature (topology) , cryptographic protocol , protocol (science) , logarithm , hash function , public key cryptography , algorithm , mathematics , encryption , computer security , medicine , geometry , surgery , alternative medicine , pathology , randomized controlled trial , mathematical analysis
The progress in the development of quantum computing has raised the problem of constructing post-quantum two-key cryptographic algorithms and protocols, i.e. crypto schemes resistant to attacks from quantum computers. Based on the hidden discrete logarithm problem, some practical post-quantum digital signature schemes have been developed. The next step could be the development of post-quantum blind signature protocols. Purpose: To develop blind signature protocols based on the computational difficulty of the hidden discrete logarithm problem. Method: The use of blinding factors introduced by the client during the blind signature protocol when the parameters necessary for the blind signature formation are passed to the signatory. Results: It has been proposed to use blinding multipliers of two different types: left-sided and right-sided ones. With them, you can develop blind signature protocols on the base of schemes with a verification equation defined in non-commutative algebraic structures. New blind signature protocols have been developed, based on the computational difficulty of the hidden discrete logarithm problem. As the algebraic carrier for the developed protocols, finite non-commutative associative algebras of two types are used: 1) those with a global two-sided unit, and 2) those with a large set of global left units. Practical relevance: The proposed protocols have a high performance and can be successfully implemented either in software or in hardware.