Identity-Based Identification Scheme without Trusted Party against Concurrent Attacks

3Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Identification schemes support that a prover who holding a secret key to prove itself to any verifier who holding the corresponding public key. In traditional identity-based identification schemes, there is a key generation center to generate all users' secret keys. This means that the key generation center knows all users' secret key, which brings the key escrow problem. To resolve this problem, in this work, we define the model of identity-based identification without a trusted party. Then, we propose a multi-authority identity-based identification scheme based on bilinear pairing. Furthermore, we prove the security of the proposed scheme in the random oracle model against impersonation under passive and concurrent attacks. Finally, we give an application of the proposed identity-based identification scheme to blockchain.

Cite

CITATION STYLE

APA

Tang, F., Bao, J., Huang, Y., Huang, D., & Wang, F. (2020). Identity-Based Identification Scheme without Trusted Party against Concurrent Attacks. Security and Communication Networks, 2020. https://doi.org/10.1155/2020/8820271

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free