scholarly journals Proposing a method to design secure digital signature scheme on the ring structure Zn

2022 ◽  
Vol 2 (14) ◽  
pp. 66-74
Author(s):  
Nguyen Dao Truong ◽  
Le Van Tuan
Keyword(s):  
Digital Signature ◽  
Ring Structure ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Signature Generation ◽  
Digital Signature Scheme

Abstract—In this paper, we propose a method to design signature scheme on ring structure with residual classes modulo composite. At the same time, we develop several new digital signature schemes that are more secure, with faster signature generation than ElGamal digital signature scheme and its variants. Furthermore, our proposed signature scheme has overcome some weaknesses of some published signature scheme of the same type, which are built on ring structure. Tóm tắt—Trong bài báo này, chúng tôi đề xuất một phương pháp thiết kế lược đồ chữ ký trên cấu trúc vành các lớp thặng dự theo modulo hợp số, đồng thời phát triển một số lược đồ chữ ký số mới an toàn hơn, tốc độ sinh chữ ký nhanh hơn so với lược đồ chữ ký số ElGamal cùng với những biến thể của nó. Hơn nữa, lược đồ chữ ký do chúng tôi đề xuất cũng khắc phục được một số nhược điểm của một số lược đồ chữ ký cùng loại, được xây dựng trên cấu trúc vành.

scholarly journals Digital signature scheme on the 2 x 2 matrix algebra

2021 ◽  
Vol 17 (3) ◽  
pp. 254-261
Author(s):  
Nikolay A. Moldovyan ◽  
◽  
Alexandr A. Moldovyan ◽  
Keyword(s):  
Digital Signature ◽  
High Performance ◽  
Matrix Algebra ◽  
Multiplicative Group ◽  
Discrete Logarithm ◽  
Signature Scheme ◽  
The Public ◽  
Signature Generation ◽  
Commutative Subalgebras ◽  
Digital Signature Scheme

The article considers the structure of the 2x2 matrix algebra set over a ground finite field GF(p). It is shown that this algebra contains three types of commutative subalgebras of order p2, which differ in the value of the order of their multiplicative group. Formulas describing the number of subalgebras of every type are derived. A new post-quantum digital signature scheme is introduced based on a novel form of the hidden discrete logarithm problem. The scheme is characterized in using scalar multiplication as an additional operation masking the hidden cyclic group in which the basic exponentiation operation is performed when generating the public key. The advantage of the developed signature scheme is the comparatively high performance of the signature generation and verification algorithms as well as the possibility to implement a blind signature protocol on its base.

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 Anonymous Payment in a Kiosk Centric Model Using Digital Signature Scheme with Message Recovery and Low Computational Power Devices

2006 ◽  
Vol 1 (2) ◽  
pp. 1-11
Author(s):  
Jesús Isaac ◽  
José Camara ◽  
Antonio Manzanares ◽  
Joaquín Márquez
Keyword(s):  
Public Space ◽  
Digital Signature ◽  
Signature Scheme ◽  
Computational Power ◽  
Power Devices ◽  
Signature Schemes ◽  
The Public ◽  
Message Recovery ◽  
Public Keys ◽  
Digital Signature Scheme

In this paper we present an anonymous protocol for a mobile payment system based on a Kiosk Centric Case Mobile Scenario where the customer cannot communicate with the issuer due to absence of Internet access with her mobile device and the costs of implementing other mechanism of communication between both of them are high. Our protocol protects the real identity of the clients during the purchase and employs a digital signature scheme with message recovery using self-certified public keys that reduces the public space and the communication cost in comparison with the certificate-based signature schemes. Moreover, our proposed protocol requires low computational power that makes it suitable for mobile devices. As a result, our proposal illustrates how a portable device equipped with a short range link (such Bluetooth, Infrared or Wi-Fi) and low computational power should be enough to interact with a vendor machine in order to buy goods or services in a secure way.

scholarly journals A Digital Signature Scheme Based onMST3Cryptosystems

2014 ◽  
Vol 2014 ◽  
pp. 1-11
Author(s):  
Haibo Hong ◽  
Jing Li ◽  
Licheng Wang ◽  
Yixian Yang ◽  
Xinxin Niu
Keyword(s):  
Digital Signature ◽  
Encryption Scheme ◽  
Signature Scheme ◽  
Secret Key ◽  
Signature Schemes ◽  
Logarithmic Signatures ◽  
Public Key Cryptosystems ◽  
Cryptographic Keys ◽  
Main Components ◽  
Digital Signature Scheme

As special types of factorization of finite groups, logarithmic signature and cover have been used as the main components of cryptographic keys for secret key cryptosystems such asPGMand public key cryptosystems likeMST1,MST2, andMST3. Recently, Svaba et. al proposed a revisedMST3encryption scheme with greater security. Meanwhile, they put forward an idea of constructing signature schemes on the basis of logarithmic signatures and random covers. In this paper, we firstly design a secure digital signature scheme based on logarithmic signatures and random covers. In order to complete the task, we devise a new encryption scheme based onMST3cryptosystems.

Digital Signature Schemes

2017 ◽  
Author(s):  
Keith M. Martin
Keyword(s):  
Digital Signature ◽  
Digital Signatures ◽  
Public Key Cryptography ◽  
Detailed Comparison ◽  
Public Key ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Digital Signature Scheme

In this chapter, we discuss digital signature schemes. We start by considering the general requirements of a digital signature scheme. We show first that a digital signature scheme could be established using symmetric techniques. We then consider the more conventional use of public-key cryptography to create digital signature schemes. We compare two different approaches to building a digital signature scheme and illustrate how to manifest these using RSA. We then discuss practical issues concerning digital signature schemes, including different aspects of their security. We close by providing a detailed comparison between digital signatures and handwritten signatures which serves to both illustrate the strengths and vulnerabilities of digital signature schemes.

scholarly journals Digital Signature Scheme with Hidden Group Possessing Two-Dimensional Cyclicity

2021 ◽  
Vol 7 (2) ◽  
pp. 85-93
Author(s):  
D. Moldovyan ◽  
R. Fahrutdinov ◽  
A. Mirin ◽  
A. Kostina
Keyword(s):  
Digital Signature ◽  
Discrete Logarithm ◽  
Public Key ◽  
Two Dimensional ◽  
Signature Scheme ◽  
The Public ◽  
Multiplication Operation ◽  
Signature Generation ◽  
Cryptographic Primitive ◽  
Digital Signature Scheme

A method is proposed for constructing digital signature schemes based on the hidden discrete logarithm problem, which meet ageneral criterion of post-quantum resistance. The method provides a relatively small size of the public key and signature. Based on the method, a practical digital signature scheme has been developed, in which the exponentiation operation in a hidden group with two-dimensional cyclicity is the basic cryptographic primitive. The algebraic support of a cryptoscheme is a four-dimensional finite non-commutative algebra with associative multiplication operation. By specifying algebra using abasis vector multiplication table with half of empty cells, the performance of signature generation and authentication procedures is improved. A public key is a triple of four-dimensional vectors calculated as images of elements of a hidden group which are mapped using two types of masking operations: 1) mutually commutative with the exponentiation operation and 2) not having this property.

Identity-Based Proxy Signcryption Schemes

2013 ◽  
Vol 380-384 ◽  
pp. 2605-2608
Author(s):  
Jian Wu
Keyword(s):  
Digital Signature ◽  
Computational Cost ◽  
Proxy Signature ◽  
Single Step ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Identity Based Encryption ◽  
Encryption Schemes ◽  
Identity Based ◽  
Digital Signature Scheme

Identity-based encryption and signature schemes that allow any pair of users to communicate securely and to verify each other's signatures without verifying certificate. A signcryption is a primitive that provides the properties of both digital signatures and encryption schemes in a way that is more efficient than signing and encrypting separately. Proxy signature schemes are a variation of ordinary digital signature scheme that allow a proxy signer to sign messages on behalf of the original singer which proxy signcryption simultaneously fulfill both the functions of signature and encryption in a single step with a lower computational cost than that required by the traditional signature-then-encryption. In this paper, we present identity-based proxy signcryption schemes with lower efficient..

Sign in / Sign up

Export Citation Format

Share Document