A signature scheme from the finite field isomorphism problem

AbstractIn a recent paper the authors and their collaborators proposed a new hard problem, called the finite field isomorphism problem, and they used it to construct a fully homomorphic encryption scheme. In this paper, we investigate how one might build a digital signature scheme from this new problem. Intuitively, the hidden field isomorphism allows us to convert short vectors in the underlying lattice of one field into generic looking vectors in an isomorphic field.

Download Full-text

A Digital Signature Scheme Based onMST3Cryptosystems

Mathematical Problems in Engineering ◽

10.1155/2014/630421 ◽

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.

Download Full-text

A New Approach to Keep the Privacy Information of the Signer in a Digital Signature Scheme

Information ◽

10.3390/info11050260 ◽

2020 ◽

Vol 11 (5) ◽

pp. 260

Author(s):

Dung Hoang Duong ◽

Willy Susilo ◽

Viet Cuong Trinh

Keyword(s):

Digital Signature ◽

Group Signature ◽

Encryption Scheme ◽

Signature Scheme ◽

Secret Key ◽

New Approach ◽

Designated Verifier ◽

Designated Verifier Signature ◽

Digital Signature Scheme ◽

Responsible Person

In modern applications, such as Electronic Voting, e-Health, e-Cash, there is a need that the validity of a signature should be verified by only one responsible person. This is opposite to the traditional digital signature scheme where anybody can verify a signature. There have been several solutions for this problem, the first one is we combine a signature scheme with an encryption scheme; the second one is to use the group signature; and the last one is to use the strong designated verifier signature scheme with the undeniable property. In this paper, we extend the traditional digital signature scheme to propose a new solution for the aforementioned problem. Our extension is in the sense that only a designated verifier (responsible person) can verify a signer’s signature, and if necessary (in case the signer refuses to admit his/her signature) the designated verifier without revealing his/her secret key is able to prove to anybody that the signer has actually generated the signature. The comparison between our proposed solution and the three existing solutions shows that our proposed solution is the best one in terms of both security and efficiency.

Download Full-text