Strong unforgeability in group signature schemes

2009 ◽  
Vol 31 (4) ◽  
pp. 856-862 ◽  
Author(s):  
Haeryong Park ◽  
Seongan Lim ◽  
Ikkwon Yie ◽  
Kitae Kim ◽  
Junghwan Song
Keyword(s):  
Group Signature ◽  
Signature Schemes ◽  
Strong Unforgeability

Two proposals for group signature schemes based on number theory problems

2012 ◽  
Vol 21 (4) ◽  
pp. 648-658
Author(s):  
R. Duran Diaz ◽  
L. Hernandez Encinas ◽  
J. Munoz Masque
Keyword(s):  
Number Theory ◽  
Group Signature ◽  
Signature Schemes

scholarly journals Provably Secure Group Signature Schemes From Code-Based Assumptions

2020 ◽  
Vol 66 (9) ◽  
pp. 5754-5773 ◽  
Author(s):  
Martianus Frederic Ezerman ◽  
Hyung Tae Lee ◽  
San Ling ◽  
Khoa Nguyen ◽  
Huaxiong Wang
Keyword(s):  
Group Signature ◽  
Signature Schemes ◽  
Provably Secure

A New Approach to Group Signature Schemes

2011 ◽  
Vol 6 (4) ◽  
Author(s):  
Xiangguo Cheng ◽  
Chen Yang ◽  
Jia Yu
Keyword(s):  
Group Signature ◽  
Signature Schemes ◽  
New Approach

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.

Sign in / Sign up

Export Citation Format

Share Document