scholarly journals A NEW APPROACH TO BUILDING A POST-QUANTUM SCHEME OF ELECTRONIC DIGITAL SIGNATURE

2020 ◽  
pp. 23-30
Author(s):  
Alexander Kuznetsov ◽  
Anastasia Kiyan ◽  
Andrey Pushkarev ◽  
Tatiana Kuznetsova
Keyword(s):  
Quantum Computing ◽  
Digital Signature ◽  
Rapid Development ◽  
Error Correcting Codes ◽  
Signature Schemes ◽  
New Approach ◽  
Quantum Cryptanalysis ◽  
Additional Protection ◽  
Digital Signature Scheme

Cryptographic information security techniques are essential in building a modern cybersecurity infrastructure. Recently, there have been new challenges and threats to cryptographic transformation. In particular, the emergence and rapid development of the latest quantum computing technologies necessitates the urgent need for the development and research of new methods of post-quantum cryptographic transformations, that is, those that will be sustainable even if quantum cryptanalysis is possible. This article is devoted to the analysis of possibilities of implementation of digital signature schemes based on using error-correcting codes. This approach allows cryptographers to build schemes that are resistant to both classic cryptanalysis and cryptanalysis which uses quantum computing. The article describes the principles of the classic digital signature scheme which is named CFS and built using a Niederreiter-like transform, and also we propose a new approach that enables an implementation of signature according to the McEliece transformations. This approach preserves the advantages of its predecessor and provides additional protection against special attacks. Also, a comparative analysis and characterization of the considered schemes according to the criteria of resistance to classic and quantum cryptanalysis, complexity of necessary transformations and length of generated signatures are made. The results show that reliable and secure cryptographic transformations can be built, in particular, electronic digital signature algorithms that are code-based and secure even in the case of quantum cryptanalysis. However, it should be noted that the drawback of code-based signature schemes is the large amount of key data required by the algorithm, as well as the difficulty in creating a signature due to the need for multiple decryption of the syndrome, which remains a topical topic and needs further research

A New Approach to Constructing Digital Signature Schemes

2019 ◽  
pp. 363-373 ◽  
Author(s):  
Ahto Buldas ◽  
Denis Firsov ◽  
Risto Laanoja ◽  
Henri Lakk ◽  
Ahto Truu
Keyword(s):  
Digital Signature ◽  
Signature Schemes ◽  
New Approach

scholarly journals Time of signing in the Estonian digital signature scheme

2019 ◽  
pp. 40-50
Author(s):  
Tõnu Mets ◽  
Arnis Parsovs
Keyword(s):  
European Union ◽  
Digital Signature ◽  
Digital Signatures ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Electronic Documents ◽  
Legal Requirement ◽  
The Public ◽  
Digital Signature Scheme ◽  
Legal Consequences

There is a widespread misconception among some lawyers, technologists and the public that the Estonian digital signature scheme provides reliable proof of the time when a document was digitally signed. In this article Tõnu Mets and Arnis Parsovs show that the legal requirement to establish the time of signing is not met in practice. The related legal requirement that the validation of the digital signature should confirm that the certificate was valid at the time of signing is also not met. The authors analyse the legal consequences of this, and discuss possible solutions for the issues that arise. They note that digital signature schemes used in other countries implementing Regulation (EU) No 910/2014 of the European Parliament and the Council of 23 July 2014 (eIDAS) are likely to share the problems discussed in this article. Index words: Estonia, European Union, Digital signatures, Electronic documents

scholarly journals Digital Signatures in a Quantum World: Evaluating The Trade-off Between Performance and Security for GeMSS

2019 ◽  
Author(s):  
Paulo Ricardo Reis ◽  
Fábio Borges
Keyword(s):  
Quantum Computing ◽  
Digital Signature ◽  
Quantum Computer ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Trade Off ◽  
Signature Generation ◽  
Security Parameter ◽  
Verification Process ◽  
Definition Of

With the advent of quantum computing, it urges the definition of a cryptographic standard algorithm that can resist attacks from a quantum computer. Inside this context is GeMSS, a multivariate quadratic signature scheme based on the HFEvconstruct. Schemes of this type have shown great potential throughout the last two decades. This paper traces a comparison of performance and security between GeMSS and other relevant digital signature schemes, showing that despite of its slow signature generation and large key pair, it has a very quick verification process and tiny signatures. It also proposes a method for deriving the size of keys from the security parameter evaluated.

scholarly journals New Blind Muti-signature Schemes based on ECDLP

2018 ◽  
Vol 8 (2) ◽  
pp. 1074
Author(s):  
Duc Nguyen Tan ◽  
Hai Nguyen Nam ◽  
Minh Nguyen Hieu ◽  
Hiep Nguyen Van
Keyword(s):  
Digital Signature ◽  
Discrete Logarithm ◽  
Blind Signature ◽  
Security Requirements ◽  
Signature Schemes ◽  
Computational Performance ◽  
Electronic Transactions ◽  
Election Systems ◽  
Digital Signature Scheme ◽  
Single Blind

In various types of electronic transactions, including election systems and digital cash schemes, user anonymity and authentication are always required. Blind signatures are considered the most important solutions to meeting these requirements. Many studies have focused on blind signature schemes; however, most of the studied schemes are single blind signature schemes. Although blind multi-signature schemes are available, few studies have focused on these schemes. In this article, blind multi-signature schemes are proposed based on the Elliptic Curve Discrete Logarithm Problem (ECDLP). The proposed schemes are based on the GOST R34.10-2012 digital signature standard and the EC-Schnorr digital signature scheme, and they satisfy blind multi-signature security requirements and have better computational performance than previously proposed schemes. The proposed schemes can be applied in election systems and digital cash schemes.

scholarly journals Committing to quantum resistance: a slow defence for Bitcoin against a fast quantum computing attack

2018 ◽  
Vol 5 (6) ◽  
pp. 180410 ◽  
Author(s):  
I. Stewart ◽  
D. Ilie ◽  
A. Zamyatin ◽  
S. Werner ◽  
M. F. Torshizi ◽  
...  
Keyword(s):  
Quantum Computing ◽  
Digital Signature ◽  
Public Key Cryptography ◽  
Public Key ◽  
Quantum Computers ◽  
Signature Scheme ◽  
Integer Factorization ◽  
Digital Signature Algorithm ◽  
Mathematical Problems ◽  
Digital Signature Scheme

Quantum computers are expected to have a dramatic impact on numerous fields due to their anticipated ability to solve classes of mathematical problems much more efficiently than their classical counterparts. This particularly applies to domains involving integer factorization and discrete logarithms, such as public key cryptography. In this paper, we consider the threats a quantum-capable adversary could impose on Bitcoin, which currently uses the Elliptic Curve Digital Signature Algorithm (ECDSA) to sign transactions. We then propose a simple but slow commit–delay–reveal protocol, which allows users to securely move their funds from old (non-quantum-resistant) outputs to those adhering to a quantum-resistant digital signature scheme. The transition protocol functions even if ECDSA has already been compromised. While our scheme requires modifications to the Bitcoin protocol, these can be implemented as a soft fork.

scholarly journals An Efficient Code-Based Threshold Ring Signature Scheme with a Leader-Participant Model

2017 ◽  
Vol 2017 ◽  
pp. 1-7 ◽  
Author(s):  
Guomin Zhou ◽  
Peng Zeng ◽  
Xiaohui Yuan ◽  
Siyuan Chen ◽  
Kim-Kwang Raymond Choo
Keyword(s):  
Quantum Computing ◽  
Digital Signature ◽  
Time Complexity ◽  
Signature Scheme ◽  
Decoding Algorithm ◽  
Signature Schemes ◽  
Ring Signature ◽  
Normal Code ◽  
Efficient Code

Digital signature schemes with additional properties have broad applications, such as in protecting the identity of signers allowing a signer to anonymously sign a message in a group of signers (also known as a ring). While these number-theoretic problems are still secure at the time of this research, the situation could change with advances in quantum computing. There is a pressing need to design PKC schemes that are secure against quantum attacks. In this paper, we propose a novel code-based threshold ring signature scheme with a leader-participant model. A leader is appointed, who chooses some shared parameters for other signers to participate in the signing process. This leader-participant model enhances the performance because every participant including the leader could execute the decoding algorithm (as a part of signing process) upon receiving the shared parameters from the leader. The time complexity of our scheme is close to Courtois et al.’s (2001) scheme. The latter is often used as a basis to construct other types of code-based signature schemes. Moreover, as a threshold ring signature scheme, our scheme is as efficient as the normal code-based ring signature.

Sign in / Sign up

Export Citation Format

Share Document