Linkable Ring Signature Scheme Using Biometric Cryptosystem and NIZK and Its Application

Abstract

Biometric encryption, especially based on fingerprint, plays an important role in privacy protection and identity authentication. In this paper, we construct a privacy-preserving linkable ring signature scheme. In our scheme, we utilize a fuzzy symmetric encryption scheme called symmetric keyring encryption (SKE) to hide the secret key and use non-interactive zero-knowledge (NIZK) protocol to ensure that we do not leak any information about the message. Unlike the blind signature, we use NIZK protocol to cancel the interaction between the signer (the prover) and the verifier. The security proof shows that our scheme is secure under the random oracle model. Finally, we implement it on a personal computer and analyze the performance of the constructed scheme in practical terms. Based on the constructed scheme and demo, we give an anonymous cryptocurrency transaction model as well as mobile demonstration.

Traffic data security sharing scheme based on blockchain and traceable ring signature for VANETs

“…There is a linear relationship between the calculation cost of generating the signature and the number of ring members. Compared to other The number of ring members (n) Computational cost (ms) Ref [37] Ref [38] Ref [39] Ref [40] Our Scheme Fig. 6 Computational cost comparison of key generation ring signature schemes, our computational cost is the lowest.…”

“…We set the number of ring members n = 100, compared with Fujisaki et al's scheme [37], Bouakkaz et al's scheme [38], and Lai et al's scheme [40], the key generation consumption of our scheme is reduced by about 31.65%, 61.84%, and 70.34%, respectively. Although, the key generation process cost of our scheme is longer than Mao et al's scheme [39]. However, the tracking key and vehicle key of our scheme is generated in advance by the TA and the vehicle during the vehicle registration process, and stored in the OBU of the vehicle, so it does not affect the communication efficiency of VANETs.…”

“…Compared with Mao et al's scheme [39] in signature generation and verification processes, the computational complexity is almost O(n 2 ) when n is the number of ring members. The relationship between computational cost and the number of ring members is not linear.…”

“…5. The computation cost of the schemes [37][38][39][40] in key generation, signature generation, signature verification, and tracking processes are computed and the calculation results are listed in Table 3.…”

“…This section analyses and compares the communication overhead of our scheme and other ring signature schemes [38][39][40] is shown in Table 4. According to Chen et al's paper [7], the size of elements in Z * P and G 1 are 20 × 2 = 40 bytes and 64 × 2 = 128 bytes, respectively.…”