Efficient and provably-secure certificateless short signature scheme from bilinear pairings

Hongzhen Du; Qiaoyan Wen

doi:10.1016/j.csi.2008.05.013

ScienceGate Book Chapters

JOURNAL ARTICLE

Efficient and provably-secure certificateless short signature scheme from bilinear pairings

Hongzhen Du Qiaoyan Wen

Year: 2008 Journal: Computer Standards & Interfaces Vol: 31 (2)Pages: 390-394 Publisher: Elsevier BV

DOI: 10.1016/j.csi.2008.05.013

Get Full-Text PDF Get Analytical Report

Keywords:

Random oracle Computer science Public-key cryptography Key escrow Hash function Cryptosystem Cryptography Scheme (mathematics) Theoretical computer science Schnorr signature Computer network Digital signature Computer security Blind signature Encryption Mathematics

Metrics

111

Cited By

7.58

FWCI (Field Weighted Citation Impact)

Refs

0.98

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Cryptography and Data Security

Physical Sciences → Computer Science → Artificial Intelligence

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

Cryptography and Residue Arithmetic

Physical Sciences → Computer Science → Information Systems

Efficient and provably-secure certificateless short signature scheme from bilinear pairings

Metrics

Citation History

Topics

Related Documents

An efficient and provably‐secure certificateless signature scheme without bilinear pairings

Certificateless Short Signature Scheme from Bilinear Pairings

Secure and efficient certificateless aggregate signature scheme from bilinear pairings

A Provably-Secure Outsourced Revocable Certificateless Signature Scheme Without Bilinear Pairings

A provably secure proxy signature scheme from bilinear pairings