A new proxy signature with revocation based on factoring and discrete logarithm

Research output: Contribution to journalArticle

Abstract

In 2006, Lu et al. proposed a proxy signature with revocation based on the discrete logarithm problem. In their scheme an original signer delegated his signing capability to a proxy signer on behalf of the original signer and revoke delegation when forgery detected. All previous proxy signature schemes have been based on single problem. Therefore, it has been proven it will not secure anymore since day to day single problem has been solved. To encounter this problem we propose a new proxy signature with revocation with two hard problems. To our best knowledge, this is the first proxy signature with revocation based on factoring and discrete logarithms using two hard problems with advancement security.

Original languageEnglish
Pages (from-to)6141-6152
Number of pages12
JournalApplied Mathematical Sciences
Volume7
Issue number121-124
DOIs
Publication statusPublished - 2013

Fingerprint

Proxy Signature
Revocation
Discrete Logarithm
Factoring
Discrete Logarithm Problem
Delegation
Signature Scheme

Keywords

  • Cryptography
  • Discrete logarithms
  • Factoring
  • Proxy signature scheme

ASJC Scopus subject areas

  • Applied Mathematics

Cite this

A new proxy signature with revocation based on factoring and discrete logarithm. / Mat-Isa, M.; Ismail, Eddie Shahril.

In: Applied Mathematical Sciences, Vol. 7, No. 121-124, 2013, p. 6141-6152.

Research output: Contribution to journalArticle

@article{527674b4da72470c89a45ba4670ba2e7,
title = "A new proxy signature with revocation based on factoring and discrete logarithm",
abstract = "In 2006, Lu et al. proposed a proxy signature with revocation based on the discrete logarithm problem. In their scheme an original signer delegated his signing capability to a proxy signer on behalf of the original signer and revoke delegation when forgery detected. All previous proxy signature schemes have been based on single problem. Therefore, it has been proven it will not secure anymore since day to day single problem has been solved. To encounter this problem we propose a new proxy signature with revocation with two hard problems. To our best knowledge, this is the first proxy signature with revocation based on factoring and discrete logarithms using two hard problems with advancement security.",
keywords = "Cryptography, Discrete logarithms, Factoring, Proxy signature scheme",
author = "M. Mat-Isa and Ismail, {Eddie Shahril}",
year = "2013",
doi = "10.12988/ams.2013.310506",
language = "English",
volume = "7",
pages = "6141--6152",
journal = "Applied Mathematical Sciences",
issn = "1312-885X",
publisher = "Hikari Ltd.",
number = "121-124",

}

TY - JOUR

T1 - A new proxy signature with revocation based on factoring and discrete logarithm

AU - Mat-Isa, M.

AU - Ismail, Eddie Shahril

PY - 2013

Y1 - 2013

N2 - In 2006, Lu et al. proposed a proxy signature with revocation based on the discrete logarithm problem. In their scheme an original signer delegated his signing capability to a proxy signer on behalf of the original signer and revoke delegation when forgery detected. All previous proxy signature schemes have been based on single problem. Therefore, it has been proven it will not secure anymore since day to day single problem has been solved. To encounter this problem we propose a new proxy signature with revocation with two hard problems. To our best knowledge, this is the first proxy signature with revocation based on factoring and discrete logarithms using two hard problems with advancement security.

AB - In 2006, Lu et al. proposed a proxy signature with revocation based on the discrete logarithm problem. In their scheme an original signer delegated his signing capability to a proxy signer on behalf of the original signer and revoke delegation when forgery detected. All previous proxy signature schemes have been based on single problem. Therefore, it has been proven it will not secure anymore since day to day single problem has been solved. To encounter this problem we propose a new proxy signature with revocation with two hard problems. To our best knowledge, this is the first proxy signature with revocation based on factoring and discrete logarithms using two hard problems with advancement security.

KW - Cryptography

KW - Discrete logarithms

KW - Factoring

KW - Proxy signature scheme

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

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

U2 - 10.12988/ams.2013.310506

DO - 10.12988/ams.2013.310506

M3 - Article

AN - SCOPUS:84889561990

VL - 7

SP - 6141

EP - 6152

JO - Applied Mathematical Sciences

JF - Applied Mathematical Sciences

SN - 1312-885X

IS - 121-124

ER -