Partially blind signature scheme based on chaotic maps and factoring problems

Nedal Tahat, Eddie Shahril Ismail, A. K. Alomari

Research output: Contribution to journalArticle

Abstract

Due to the importance of security and efficiency of electronic signatures schemes, there is an increase in interest among scholars to develop such schemes based on mathematical problems to be more secure and efficient. In this paper, we propose a scheme with a low computation cost based on both cryptographic and chaotic system characteristics. The security of the scheme depends upon the intractability of the factorization problem and discrete logarithm of Chebyshev polynomials. The performance comparison demonstrated that the proposed scheme has a lower communication cost than the existing schemes in the literature, such as the one proposed by Tahat et al. To the best of our knowledge, this is the first time a partially blind signature scheme based on chaotic maps and factoring problem has been proposed.

Original languageEnglish
Pages (from-to)165-177
Number of pages13
JournalItalian Journal of Pure and Applied Mathematics
Issue number39
Publication statusPublished - 1 Feb 2018

Fingerprint

Blind Signature
Chaotic Map
Factoring
Signature Scheme
Discrete Logarithm
Communication Cost
Chebyshev Polynomials
Performance Comparison
Chaotic System
Factorization
Electronics
Costs

Keywords

  • Chaotic maps
  • Digital signature
  • Factorization
  • Partially blind signature

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Partially blind signature scheme based on chaotic maps and factoring problems. / Tahat, Nedal; Ismail, Eddie Shahril; Alomari, A. K.

In: Italian Journal of Pure and Applied Mathematics, No. 39, 01.02.2018, p. 165-177.

Research output: Contribution to journalArticle

@article{532b73777a8841f09009e4eeba165cb1,
title = "Partially blind signature scheme based on chaotic maps and factoring problems",
abstract = "Due to the importance of security and efficiency of electronic signatures schemes, there is an increase in interest among scholars to develop such schemes based on mathematical problems to be more secure and efficient. In this paper, we propose a scheme with a low computation cost based on both cryptographic and chaotic system characteristics. The security of the scheme depends upon the intractability of the factorization problem and discrete logarithm of Chebyshev polynomials. The performance comparison demonstrated that the proposed scheme has a lower communication cost than the existing schemes in the literature, such as the one proposed by Tahat et al. To the best of our knowledge, this is the first time a partially blind signature scheme based on chaotic maps and factoring problem has been proposed.",
keywords = "Chaotic maps, Digital signature, Factorization, Partially blind signature",
author = "Nedal Tahat and Ismail, {Eddie Shahril} and Alomari, {A. K.}",
year = "2018",
month = "2",
day = "1",
language = "English",
pages = "165--177",
journal = "Italian Journal of Pure and Applied Mathematics",
issn = "1126-8042",
publisher = "Forum Societa Editrice Universitaria Udinese srl",
number = "39",

}

TY - JOUR

T1 - Partially blind signature scheme based on chaotic maps and factoring problems

AU - Tahat, Nedal

AU - Ismail, Eddie Shahril

AU - Alomari, A. K.

PY - 2018/2/1

Y1 - 2018/2/1

N2 - Due to the importance of security and efficiency of electronic signatures schemes, there is an increase in interest among scholars to develop such schemes based on mathematical problems to be more secure and efficient. In this paper, we propose a scheme with a low computation cost based on both cryptographic and chaotic system characteristics. The security of the scheme depends upon the intractability of the factorization problem and discrete logarithm of Chebyshev polynomials. The performance comparison demonstrated that the proposed scheme has a lower communication cost than the existing schemes in the literature, such as the one proposed by Tahat et al. To the best of our knowledge, this is the first time a partially blind signature scheme based on chaotic maps and factoring problem has been proposed.

AB - Due to the importance of security and efficiency of electronic signatures schemes, there is an increase in interest among scholars to develop such schemes based on mathematical problems to be more secure and efficient. In this paper, we propose a scheme with a low computation cost based on both cryptographic and chaotic system characteristics. The security of the scheme depends upon the intractability of the factorization problem and discrete logarithm of Chebyshev polynomials. The performance comparison demonstrated that the proposed scheme has a lower communication cost than the existing schemes in the literature, such as the one proposed by Tahat et al. To the best of our knowledge, this is the first time a partially blind signature scheme based on chaotic maps and factoring problem has been proposed.

KW - Chaotic maps

KW - Digital signature

KW - Factorization

KW - Partially blind signature

UR - http://www.scopus.com/inward/record.url?scp=85045757948&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85045757948&partnerID=8YFLogxK

M3 - Article

SP - 165

EP - 177

JO - Italian Journal of Pure and Applied Mathematics

JF - Italian Journal of Pure and Applied Mathematics

SN - 1126-8042

IS - 39

ER -