TITLE

A New Signature Scheme Based on Multiple Hard Number Theoretic Problems

AUTHOR(S)
Ismail, E. S.; Tahat, N. M. F.
PUB. DATE
January 2011
SOURCE
ISRN Communications & Networking;2011, Special section p1
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The past years have seen many attempts to construct digital signature schemes based on a single hard problem, like factoring or discrete logarithm. But in the near future, those systems will no longer be secure if the solution of factoring or discrete logarithms problems is discovered. In this paper, we propose a new signature scheme based on two hard number theoretic problems, factoring and discrete logarithms. The major advantage of our scheme is that it is very unlikely that factoring and discrete logarithms can be efficiently solved simultaneously, and; therefore, the security of our scheme is longer or higher than that of any scheme based on a single hard number theoretic problem. We also show that the performance of the scheme requires only minimal operation both in signing and verifying logarithms and is resistant to attack.
ACCESSION #
65920955

 

Related Articles

  • Provable Secure Multi-Authority Attribute Based Signatures. Yanli Chen; Junjun Chen; Geng Yang // Journal of Convergence Information Technology;Jan2013, Vol. 8 Issue 2, p1 

    Attribute-based signature extends the identity-based signature by allowing identity of a signer to be a set of descriptive attributes rather than a single string representing the signer's identity. However, classic single authority attribute based signature, where all secret keys are distributed...

  • A New Digital Signature Scheme Based on Two Hard Problems. Verma, Swati; Sharma, Birendra Kumar // International Journal of Pure & Applied Sciences & Technology;Aug2011, Vol. 5 Issue 2, p55 

    In this paper, we propose a new signature scheme based on factoring and discrete logarithm. This scheme is based on two hard problems and provides higher level security as compare to a single hard problem. Most of the designated signature schemes are based on a single hard problem. Although...

  • ID-Based Signature Scheme with Weil Pairing. Sharma, Neetu; Sahu, Hemlal; Sharma, Birendra Kumar // International Journal of Advanced Networking & Applications;2013, Vol. 5 Issue 2, p1893 

    Digital signature is an essential component in cryptography. Digital signaturesguarantee end-to-end message integrity and authentication information about the origin of a message. In this paper we propose a new identification based digital signature scheme with weil pairing. Also we analyze...

  • Analysis of a Known Offline E-Coin System. Aboud, Sattar J.; Aggoun, Ammar // International Journal of Computer Applications;Jul2014, Vol. 98, p27 

    In 2012, Fan et al. presented the user recoverable offline e-coin system with rapid anonymity revoking. The authors claimed that their system can accomplish the security needs of e-coin scheme such as unlinkability, over-spending checking, anonymity control and rapid anonymity revoking on...

  • An Improved Version of the Visual Digital Signature Scheme. Jaafar, Abdullah; Samsudi, Azman // International Arab Journal of Information Technology (IAJIT);Nov2013, Vol. 10 Issue 6, p595 

    The issue of authenticity in data transfer is very important in many communications. In this paper, we propose an improved version of the visual digital signature scheme with enhanced security. The improvement was made based on Yang's non-expansion visual cryptography technique and Boolean...

  • Improvement of a Multi-designated Certifier Signature Scheme.  // Journal of Systems Science & Information;Dec2010, Vol. 8 Issue 4, p335 

    No abstract available.

  • Bonsai Trees, or How to Delegate a Lattice Basis. Cash, David; Hofheinz, Dennis; Kiltz, Eike; Peikert, Chris // Journal of Cryptology;Oct2012, Vol. 25 Issue 4, p601 

    We introduce a new lattice-based cryptographic structure called a bonsai tree, and use it to resolve some important open problems in the area. Applications of bonsai trees include an efficient, stateless 'hash-and-sign' signature scheme in the standard model (i.e., no random oracles), and the...

  • An Intranet Connection Scheme in TNC Based on Proxy Multi-Signature. Miao Zhang // International Journal of Advancements in Computing Technology;Oct2012, Vol. 4 Issue 18, p672 

    The current development of Trusted Network Connection (TNC) is introduced, and the problem of TNC one-point access mode is analyzed. After this, the paper proposes an intranet connection scheme based on proxy multi-signature, and analyzes its security character. The security analysis can prove...

  • Cryptoschemes Based on Difficulty of Simultaneous Solving Two Different Difficult Problems. Berezin, A. N.; Moldovyan, N. A.; Shcherbacov, V. A. // Computer Science Journal of Moldova;2013, Vol. 21 Issue 2, p280 

    The paper proposes a general method for construction cryptoschemes based on difficulty of simultaneous solving factoring (FP) and discrete logarithm modulo prime problem (DLpP). The proposed approach is applicable for construction digital signatures (usual, blind, collective), public key...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics