An efficient certificateless blind signature scheme without bilinear pairing

Dong, Guofagn; Gao, Fei; Shi, Wenbo; Gong, Peng

doi:10.1590/0001-3765201420130199

Cited by 8 publications

(9 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Using the IBC technique, Zhang et al [183] were the first to propose the IDBS schemes. Later, many IDBS schemes have been presented, such as [41,57,58,66,70,71,100,102,103,124,157].…”

Section: Id-based Blind Signature With Message Recovery Scheme For Pr...mentioning

confidence: 99%

“…[100], [41], [65], [70], [45], [72] and [163] in terms of the computation, bandwidth cost and security.…”

Section: Comparative Performancementioning

confidence: 99%

“…• Computation cost. Here, we evaluate the computation of our proposed scheme with related schemes [58], [100], [41], [65], [70], [45], [72] and [163],…”

Section: Comparative Performancementioning

confidence: 99%

“…as summarized in Table 5.1. In the blind signature algorithm, our proposed scheme consumes 4T SM + 2T A + 7T M = 4*6.67+2*0.23+7*0.03=27.35 ms, while the schemes [58], [100], [41], [65], [70], [45], [72] and [163] consume…”

Section: Comparative Performancementioning

confidence: 99%

See 3 more Smart Citations

A Secure and Efficient Cloud-Centric Internet-of-Medical-Things-Enabled Smart Healthcare System With Public Verifiability

Kumar

Chand

2020

IEEE Internet Things J.

View full text Add to dashboard Cite

Elliptic curve cryptography (ECC) is a remarkable mathematical tool that offers the same level of security as traditional public-key cryptography (PKC) with a significantly smaller key size and lower computational requirements. The use of pairing on elliptic curves has emerged as a vibrant field of research that provides enhanced security measures for the next generation of cryptographic systems.This thesis explores using ECC and Pairing-Based Cryptosystems (PBC) as effective mathematical tools for achieving high-security levels with minimal key size and computation cost. Specifically, the research aims to analyze Pairing-Friendly Elliptic Curves (PF-EC) and their practicality in resource-constrained environments. It proposes solutions to some of the limitations of existing applications of pairingbased cryptography.The thesis begins by presenting a comprehensive framework for constructing PF-EC and evaluating the practical security of several families of pairing-friendly curves. The study then explores the limitations of Identity-Based Encryption (IBE), a recognized application of pairing-based cryptography. It proposes mechanisms to address issues such as key escrow, secure key issuing, user slandering, and key abusing problems. The proposed solutions include an Escrow-Free Identity-Based Encryption (EF-IBE) scheme secured against confidentiality and an Escrow-Free Identity-Based Signature (EF-IBS) scheme that is forgeable and secure.Next, the thesis examines the feasibility of Internet-Voting Systems (IVS) and identifies user anonymity and ballot integrity during distribution as the main issues hindering their practical implementation. To address these challenges, the thesis proposes two cryptographic primitives secured under the Computational Diffie-Hellman Problem (CDHP) and the Random Oracle Model (ROM) and implements an Endto-End Verifiable Internet Voting (E2E-VIV) system with batch verifiability using one of the proposed cryptographic protocols.The research also studies the security issues associated with data outsourcing in the cloud and proposes an Identity-Based Blind Signature with a Message Recovery (IDBS-MR) scheme to implement a privacy-preserving data outsourcing mechanism that audits the integrity of stored data for resource-limited devices in cloud computing.Furthermore, the thesis proposes two kinds of Escrow-Free Identity-Based Signcryption (EF-IDSC) schemes and implements a secure peer-to-peer video-on-demand (P2P-VoD) streaming system and a secure cloud-assisted health care system that achieves public verifiability based on the identity-based aggregated signcryption (IDASC) scheme.Finally, the research focuses on realizing an authenticated (anonymous) key agreement protocol in energy-constrained settings and proposes two identity-based authenticated key agreement protocols to obtain a secure session key in health care. The first protocol is a One-Round Three-Party Authenticated Identity-Based Key Agreement Protocol (OR-3PID-KAP). In contrast, the second is an Identity-Based Anonymous Authent...

show abstract

“…Using the IBC technique, Zhang et al [183] were the first to propose the IDBS schemes. Later, many IDBS schemes have been presented, such as [41,57,58,66,70,71,100,102,103,124,157].…”

Section: Id-based Blind Signature With Message Recovery Scheme For Pr...mentioning

confidence: 99%

“…[100], [41], [65], [70], [45], [72] and [163] in terms of the computation, bandwidth cost and security.…”

Section: Comparative Performancementioning

confidence: 99%

“…• Computation cost. Here, we evaluate the computation of our proposed scheme with related schemes [58], [100], [41], [65], [70], [45], [72] and [163],…”

Section: Comparative Performancementioning

confidence: 99%

Section: Comparative Performancementioning

confidence: 99%

See 2 more Smart Citations

A Secure and Efficient Cloud-Centric Internet-of-Medical-Things-Enabled Smart Healthcare System With Public Verifiability

Kumar

Chand

2020

IEEE Internet Things J.

View full text Add to dashboard Cite

show abstract

“…It is well known that the computational cost of bilinear mapping is huge, it will lead to the delay of verification. In order to reduce the high computational cost, Dong et al [Dong, Gao, Shi et al (2014)] propose a certificateless blind signature scheme without bilinear pairing, which solves the problem of certificate management and key escrow existed in the identity-based public key cryptography, thereby greatly reduces the cost of computation and storage. Zhao et al [Zhao, Ren, Xiong et al (2015)] present an integrity verification scheme for cloud data without bilinear pairing.…”

Section: Introductionmentioning

confidence: 99%

WiBPA: An Efficient Data Integrity Auditing Scheme without Bilinear Pairings

Wang²,

Sun³

et al. 2019

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

The security of cloud data has always been a concern. Cloud server provider may maliciously tamper or delete user's data for their own benefit, so data integrity audit is of great significance to verify whether data is modified or not. Based on the general three-party audit architecture, a dynamic auditing scheme without bilinear pairings is proposed in this paper. It utilizes exponential operation instead of bilinear mapping to verify the validity of evidence. By establishing the mapping relation between logic index and tag index of data block with index transformation table, our scheme can easily support dynamic data operation. By hiding random numbers in the integrity evidence, our scheme can protect users' privacy information. Detailed security analysis shows that our scheme is secure against attacks such as forgery, replaying and substitution. Further experiments demonstrate that our scheme has lower computational overhead.

show abstract

A Pairing-Less Identity-Based Blind Signature with Message Recovery Scheme for Cloud-Assisted Services

Kumar¹,

Chand²

2020

Information Security and Cryptology

View full text Add to dashboard Cite

An efficient certificateless blind signature scheme without bilinear pairing

Cited by 8 publications

References 24 publications

A Secure and Efficient Cloud-Centric Internet-of-Medical-Things-Enabled Smart Healthcare System With Public Verifiability

A Secure and Efficient Cloud-Centric Internet-of-Medical-Things-Enabled Smart Healthcare System With Public Verifiability

WiBPA: An Efficient Data Integrity Auditing Scheme without Bilinear Pairings

A Pairing-Less Identity-Based Blind Signature with Message Recovery Scheme for Cloud-Assisted Services

Contact Info

Product

Resources

About