An Efficient EUF-ID-CMA Secure Identity-based Short Signature Scheme using Discrete Logarithm

2019 ◽  
Author(s):  
Chandrashekhar Meshram ◽  
Mohammad S. Obaidat ◽  
Kuei-Fang Hsiao
Keyword(s):  
Discrete Logarithm ◽  
Signature Scheme ◽  
Identity Based ◽  
Short Signature

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.

Applied-Information Technology in an Improved Certificateless Signature Scheme without Bilinear Pairings

2014 ◽  
Vol 685 ◽  
pp. 528-531
Author(s):  
Ying Lian Wang ◽  
Jun Yao Ye
Keyword(s):  
Information Technology ◽  
High Efficiency ◽  
Discrete Logarithm ◽  
Simple Algorithm ◽  
Simple Calculation ◽  
Bilinear Pairings ◽  
Signature Scheme ◽  
Short Signature ◽  
Low Efficiency ◽  
Certificateless Signature

This paper analyzed two certificateless signature scheme without bilinear pairings, which pointed out that the Wang scheme had high efficiency, simple algorithm and short signature length, but it had low security. Compared with the Wang scheme, the Chen scheme had high security, but it had high calculation cost, low efficiency and long signature length, which was not practical in wireless network environment requiring low bandwidth. In order to overcome the disadvantages of the two schemes, we proposed a new improved certificateless signature scheme, which had simple calculation, high efficiency and short signature length. We proved the scheme to be secure based on the discrete logarithm problem.

A Provably Secure Certificate-Based Signature Scheme with Bilinear Pairings

2010 ◽  
Vol 439-440 ◽  
pp. 1271-1276 ◽  
Author(s):  
Jian Hong Zhang ◽  
Hua Chen ◽  
Yi Xian Yang
Keyword(s):  
Discrete Logarithm ◽  
Random Oracle Model ◽  
Bilinear Pairings ◽  
Random Oracle ◽  
Third Party ◽  
Maintenance Cost ◽  
Signature Scheme ◽  
Key Escrow ◽  
Identity Based ◽  
Provably Secure

Traditional public key cryptosystem (PKC) requires high maintenance cost for certificate management. Although, identity based cryptosystem (IBC) reduces the overhead of management, it suffers from the drawback of key escrow. Certificate-based cryptosystem solves certificate revocation problem and eliminate third party queries in the traditional PKI. In addition, it also solves the inherent key escrow problem in the IBC. In this paper, we proposed an efficient certificate-based signature and the result shows that the scheme is provable secure against two game attacks of certificate-based signature in the random oracle model. The security is closely related to the difficulty of solving the discrete logarithm problem.

scholarly journals A Secure Short Signature Scheme Based upon Biometric Security

2014 ◽  
pp. 32-36
Author(s):  
Mousumi Parida ◽  
Sujata Mohanty
Keyword(s):  
Discrete Logarithm ◽  
Real Life ◽  
Communication Overhead ◽  
Signature Scheme ◽  
Biometric Data ◽  
Factorization Problem ◽  
Integer Factorization Problem ◽  
Hard Problems ◽  
Short Signature ◽  
Feature Values

This paper presents a short signature scheme whose security is based upon two computationally hard problems, namely, discrete logarithm problem (DLP) and Integer factorization problem (IFP). In this scheme, biometric feature values of the signer are used to compute biometric cryptographic key, which is further used in signature generation. As biometric data is unique to a person, the signature cannot be forged. Also the length of the signature is short, which helps to reduce communication overhead. The verification cost of the proposed scheme is low, thus applicable in real life scenarios, such as e-voting, e-cash and e-commerce.

scholarly journals Pairing Free Identity-Based Blind Signature Scheme with Message Recovery

Cryptography ◽  
2018 ◽  
Vol 2 (4) ◽  
pp. 29 ◽  
Author(s):  
Salome James ◽  
N.B. Gayathri ◽  
P. Vasudeva Reddy
Keyword(s):  
Rapid Development ◽  
Discrete Logarithm ◽  
Modern Technology ◽  
Blind Signature ◽  
Security Requirements ◽  
Signature Scheme ◽  
Personal Privacy ◽  
Advanced Technique ◽  
Message Recovery ◽  
Identity Based

With the rapid development of modern technology, personal privacy has become a critical concern in many applications. Various digitalized applications such as online voting systems and the electronic cash systems need authenticity and anonymity. Blind signature is an advanced technique that provides the authenticity and anonymity of the user by obtaining a valid signature for a message without revealing its content to the signer. The message recovery property minimizes the signature size and allows efficient communication in situations where bandwidth is limited. With the advantage of blind signature and message recovery properties, in this paper, we present a new pairing free blind signature scheme with message recovery in Identity-based settings. The proposed scheme is proven to be secure in the random oracle model under the assumption that the Elliptic Curve Discrete Logarithm Problem (ECDLP) is intractable. The proposed scheme meets the security requirements such as blindness, untracebility, and unforgeability. We compare our scheme with the well-known existing schemes in the literature, and the efficiency analysis shows that our scheme is more efficient in terms of computational and communicational point of view.

EIPS: An Efficient Identity-Based Ring Signature Scheme

2014 ◽  
Vol 687-691 ◽  
pp. 2100-2103
Author(s):  
Jian Hong Zhang ◽  
Wei Wang ◽  
Wei Na Zhen ◽  
Qiao Cui Dong
Keyword(s):  
Discrete Logarithm ◽  
Public Key ◽  
Signature Scheme ◽  
Ring Signature ◽  
Computation Cost ◽  
Diffie Hellman ◽  
Graphical Tool ◽  
Identity Based ◽  
Schnorr Signature ◽  
Identity Protection

As an important crypto graphical tool, ring signature is able to realize full anonymity and identity protection. Comparison the traditional PKI, Identity-based (ID-based) cryptography is a very good cryptosystem since it eliminates the need for checking the validity of the certificates of traditional public key system. In this work, we propose an efficient ring signature scheme by combining ID-based cryptography and Schnorr signature conception. Our scheme has some advantages for efficiency. In our proposed scheme, no pairing operators are needed in the whole signing phase and the verifying phase. It reduces the signer’s computation cost and increases the whole signature algorithm’s efficiency. In terms of signature’s length, our scheme only needs (n+1)|G| bits. Our ring signature can achieve full anonymity and unforgeability. The security of the scheme is related to two classical security assumptions: computational diffie-hellman problem and discrete logarithm problem.

Identity-based threshold ring signature scheme with constant signature size

2013 ◽  
Vol 32 (5) ◽  
pp. 1385-1387 ◽  
Author(s):  
Hua SUN ◽  
Lei GUO ◽  
Xue-feng ZHENG ◽  
Ai-min WANG
Keyword(s):  
Signature Scheme ◽  
Ring Signature ◽  
Identity Based

Concurrent signature scheme constructed by identity-based ring signcryption

2013 ◽  
Vol 33 (5) ◽  
pp. 1386-1390 ◽  
Author(s):  
Kui LIU ◽  
Xiangqian LIANG ◽  
Xiaolin LI
Keyword(s):  
Signature Scheme ◽  
Identity Based ◽  
Concurrent Signature
Sign in / Sign up

Export Citation Format

Share Document