Comment: Improved group signature scheme based on discrete logarithm problem

1999 ◽  
Vol 35 (16) ◽  
pp. 1323 ◽  
Author(s):  
Hung-Min Sun
Keyword(s):  
Discrete Logarithm ◽  
Discrete Logarithm Problem ◽  
Group Signature ◽  
Signature Scheme

scholarly journals Constructing the 2-Element AGDS Protocol based on the Discrete Logarithm Problem

2021 ◽  
Vol 13 (04) ◽  
pp. 13-22
Author(s):  
Tuan Nguyen Kim ◽  
Duy Ho Ngoc ◽  
Nikolay A. Moldovyan
Keyword(s):  
Discrete Logarithm ◽  
Discrete Logarithm Problem ◽  
Group Signature ◽  
Signature Scheme ◽  
Fixed Size ◽  
Electronic Documents ◽  
Computational Difficulty

It is considered a group signature scheme in frame of which different sets of signers sign electronic documents with hidden signatures and the head of the signing group generates a group signature of fixed size. A new mechanism for imbedding the information about signers into a group signature is proposed. The method provides possibilities for reducing the signature size and to construct collective signature protocols for signing groups. New group signature and collective signature protocols based on the computational difficulty of discrete logarithm are proposed.

scholarly journals POST-QUANTUM BLIND SIGNATURE PROTOCOL ON NON-COMMUTATIVE ALGEBRAS

2021 ◽  
Vol 37 (4) ◽  
pp. 495-509
Author(s):  
Minh N.H ◽  
Moldovyan D.N, et al.
Keyword(s):  
Finite Field ◽  
Discrete Logarithm ◽  
Blind Signature ◽  
Discrete Logarithm Problem ◽  
Signature Scheme ◽  
Associative Algebras ◽  
Basic Properties ◽  
Commutative Algebras ◽  
Quantum Blind Signature

A method for constructing a blind signature scheme based on a hidden discrete logarithm problem defined in finite non-commutative associative algebras is proposed. Blind signature protocols are constructed using four-dimensional and six-dimensional algebras defined over a ground finite field GF(p) and containing a global two-sided unit as an algebraic support. The basic properties of the used algebra, which determine the choice of protocol parameters, are described.

scholarly journals Identity-based threshold group signature scheme based on multiple hard number theoretic problems

2020 ◽  
Vol 10 (4) ◽  
pp. 3695
Author(s):  
Nedal Tahat ◽  
Ashraf A. Tahat
Keyword(s):  
Discrete Logarithm ◽  
Minimum Cost ◽  
Difficult Problem ◽  
Group Signature ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Private Data ◽  
Intractable Problems ◽  
Secret Keys ◽  
Identity Based

We introduce in this paper a new identity-based threshold signature (IBTHS) technique, which is based on a pair of intractable problems, residuosity and discrete logarithm. This technique relies on two difficult problems and offers an improved level of security relative to an individual hard problem. The majority of the denoted IBTHS techniques are established on an individual difficult problem. Despite the fact that these methods are secure, however, a prospective solution of this sole problem by an adversary will enable him/her to recover the entire private data together with secret keys and configuration values of the associated scheme. Our technique is immune to the four most familiar attack types in relation to the signature schemes. Enhanced performance of our proposed technique is verified in terms of minimum cost of computations required by both of the signing algorithm and the verifying algorithm in addition to immunity to attacks.

scholarly journals Proposed Developments of Blind Signature Scheme based on The Elliptic Curve Discrete Logarithm Problem

2013 ◽  
Vol 2 (1) ◽  
pp. 151-160
Author(s):  
E.H. El Kinani ◽  
Fatima Amounas
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Discrete Logarithm ◽  
Mathematical Structure ◽  
Blind Signature ◽  
Discrete Logarithm Problem ◽  
Signature Scheme

In recent years, Elliptic Curve Cryptography (ECC) has attracted the attention of researchers due to its robust mathematical structure and highest security compared to other existing algorithm like RSA. Our main objective in this work was to provide a novel blind signature scheme based on ECC. The security of the proposed method results from the infeasibility to solve the discrete logarithm over an elliptic curve. In this paper we introduce a proposed to development the blind signature scheme with more complexity as compared to the existing schemes. Keyword: Cryptography, Blind Signature, Elliptic Curve, Blindness, Untraceability.DOI: 10.18495/comengapp.21.151160

Sign in / Sign up

Export Citation Format

Share Document