An efficient certificateless blind signature scheme without bilinear pairing
Autor(a) principal: | |
---|---|
Data de Publicação: | 2014 |
Outros Autores: | , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Anais da Academia Brasileira de Ciências (Online) |
Texto Completo: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0001-37652014000201003 |
Resumo: | Recently, the certificateless public key cryptography (CLPKC) has been studied widely since it could solve both of the certificate management problem in traditional public key cryptography (TPKC) and the key escrow problem in the identity-based public key cryptography (ID-based PKC). To satisfy requirements of different applications, many certificateless blind signature (CLBS) schemes using bilinear pairing for the CLPKC setting have been proposed. However, the bilinear pairing operation is very complicated. Therefore, the performance of those CLBS schemes is not very satisfactory. To solve the problem, we propose an efficient CLBS scheme without bilinear pairing. Performance analysis shows that the proposed scheme could reduce costs of computation and storage. Security analysis shows the proposed scheme is provably secure against both of two types of adversaries. |
id |
ABC-1_af0695fbcc78f4b5ed2cb424c894de0c |
---|---|
oai_identifier_str |
oai:scielo:S0001-37652014000201003 |
network_acronym_str |
ABC-1 |
network_name_str |
Anais da Academia Brasileira de Ciências (Online) |
repository_id_str |
|
spelling |
An efficient certificateless blind signature scheme without bilinear pairingblind signaturecertificateless cryptographybilinear pairingrandom oracle modelRecently, the certificateless public key cryptography (CLPKC) has been studied widely since it could solve both of the certificate management problem in traditional public key cryptography (TPKC) and the key escrow problem in the identity-based public key cryptography (ID-based PKC). To satisfy requirements of different applications, many certificateless blind signature (CLBS) schemes using bilinear pairing for the CLPKC setting have been proposed. However, the bilinear pairing operation is very complicated. Therefore, the performance of those CLBS schemes is not very satisfactory. To solve the problem, we propose an efficient CLBS scheme without bilinear pairing. Performance analysis shows that the proposed scheme could reduce costs of computation and storage. Security analysis shows the proposed scheme is provably secure against both of two types of adversaries.Academia Brasileira de Ciências2014-06-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0001-37652014000201003Anais da Academia Brasileira de Ciências v.86 n.2 2014reponame:Anais da Academia Brasileira de Ciências (Online)instname:Academia Brasileira de Ciências (ABC)instacron:ABC10.1590/0001-3765201420130199info:eu-repo/semantics/openAccessDONG,GUOFAGNGAO,FEISHI,WENBOGONG,PENGeng2015-10-26T00:00:00Zoai:scielo:S0001-37652014000201003Revistahttp://www.scielo.br/aabchttps://old.scielo.br/oai/scielo-oai.php||aabc@abc.org.br1678-26900001-3765opendoar:2015-10-26T00:00Anais da Academia Brasileira de Ciências (Online) - Academia Brasileira de Ciências (ABC)false |
dc.title.none.fl_str_mv |
An efficient certificateless blind signature scheme without bilinear pairing |
title |
An efficient certificateless blind signature scheme without bilinear pairing |
spellingShingle |
An efficient certificateless blind signature scheme without bilinear pairing DONG,GUOFAGN blind signature certificateless cryptography bilinear pairing random oracle model |
title_short |
An efficient certificateless blind signature scheme without bilinear pairing |
title_full |
An efficient certificateless blind signature scheme without bilinear pairing |
title_fullStr |
An efficient certificateless blind signature scheme without bilinear pairing |
title_full_unstemmed |
An efficient certificateless blind signature scheme without bilinear pairing |
title_sort |
An efficient certificateless blind signature scheme without bilinear pairing |
author |
DONG,GUOFAGN |
author_facet |
DONG,GUOFAGN GAO,FEI SHI,WENBO GONG,PENG |
author_role |
author |
author2 |
GAO,FEI SHI,WENBO GONG,PENG |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
DONG,GUOFAGN GAO,FEI SHI,WENBO GONG,PENG |
dc.subject.por.fl_str_mv |
blind signature certificateless cryptography bilinear pairing random oracle model |
topic |
blind signature certificateless cryptography bilinear pairing random oracle model |
description |
Recently, the certificateless public key cryptography (CLPKC) has been studied widely since it could solve both of the certificate management problem in traditional public key cryptography (TPKC) and the key escrow problem in the identity-based public key cryptography (ID-based PKC). To satisfy requirements of different applications, many certificateless blind signature (CLBS) schemes using bilinear pairing for the CLPKC setting have been proposed. However, the bilinear pairing operation is very complicated. Therefore, the performance of those CLBS schemes is not very satisfactory. To solve the problem, we propose an efficient CLBS scheme without bilinear pairing. Performance analysis shows that the proposed scheme could reduce costs of computation and storage. Security analysis shows the proposed scheme is provably secure against both of two types of adversaries. |
publishDate |
2014 |
dc.date.none.fl_str_mv |
2014-06-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0001-37652014000201003 |
url |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0001-37652014000201003 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
10.1590/0001-3765201420130199 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
text/html |
dc.publisher.none.fl_str_mv |
Academia Brasileira de Ciências |
publisher.none.fl_str_mv |
Academia Brasileira de Ciências |
dc.source.none.fl_str_mv |
Anais da Academia Brasileira de Ciências v.86 n.2 2014 reponame:Anais da Academia Brasileira de Ciências (Online) instname:Academia Brasileira de Ciências (ABC) instacron:ABC |
instname_str |
Academia Brasileira de Ciências (ABC) |
instacron_str |
ABC |
institution |
ABC |
reponame_str |
Anais da Academia Brasileira de Ciências (Online) |
collection |
Anais da Academia Brasileira de Ciências (Online) |
repository.name.fl_str_mv |
Anais da Academia Brasileira de Ciências (Online) - Academia Brasileira de Ciências (ABC) |
repository.mail.fl_str_mv |
||aabc@abc.org.br |
_version_ |
1754302860026183680 |