Certificateless Linkable Ring Signature Scheme

Lunzhi Deng,Hongyu Shi,Yan Gao

doi:10.1109/access.2020.2981360

Lunzhi Deng, Hongyu Shi + Show 1 more

Open Access

https://doi.org/10.1109/access.2020.2981360

Copy DOI

Abstract

Ring signature is an anonymous signature that both authenticates the message and protects the identity information of the signer. It is suitable for scenarios such as anonymous network access, online auctions, etc. However, there is a problem in a regular ring signature scheme. The signer can generate multiple different signatures for the same message without being discovered by the verifier. This will of course cause some confusion. Linkable ring signature (LRS) resolves the problem. The verifier can determine if multiple signatures were generated by the same signer, but he cannot determine the actual signer’s identity. In this paper, we first proposed the system model and security requirements for certificateless linked ring signature (CL-LRS). Then, we constructed a concrete CL-LRS scheme and gave the security proofs. Finally, we compared the efficiency of our scheme with several other LRS schemes. Our scheme does not use pairing operation and is more suitable for the computation-constrained environment.

Highlights

With the continuous upgrade of network information technology and communication technology, e-commerce has entered people’s lives, and people have become accustomed to conducting various business activities through the network
It is estimated that the global online shopping consumer size will reach 2.38 billion by 2022, and the online shopping penetration rate will increase to more than 30%
In 2018, China’s fixed data and Internet business revenues reached 207.2 billion yuan, an increase of 5.1% over the previous year, and its proportion in telecommunications business revenue increased from 15.6% to 15.9% in the previous year

Summary

INTRODUCTION

With the continuous upgrade of network information technology and communication technology, e-commerce has entered people’s lives, and people have become accustomed to conducting various business activities (online shopping, online transactions, electronic payment, etc.) through the network. In 2013, Au et al [2] constructed an IB-LRS scheme, in which the length of the signature is constant In these two schemes, the user’s private key does be decided by the identity information of the user and master secret key, one user may correspond to more than one private keys, It does not meet the requirements of traditional identity-based cryptography. We proposed a concrete CL-LRS scheme by following the methods in [7] It avoids key escrow while not requiring certificate management. SYSTEM MODEL A CL-LRS scheme consists of the following eight algorithms: Setup: Input a security parameter ν, key generation center (KGC) yields the system parameters (params) and the master secret key (msk). Outputs 0. Link: Input two tuples (event, σ1, m1), (event, σ2, m2), anyone outputs either link or unlink

NOTIONS OF SECURITY

NEW SCHEME

SECURITY OF SCHEME

Findings

VIII. CONCLUSION