Identity-Based Linkable Ring Signature Scheme

Deng, Li; Jiang, Yuhong; Ning, Bingqin

doi:10.1109/access.2019.2948972

Cited by 17 publications

(24 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In these two schemes, the user's private key does not only 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. In 2019, Deng et al [11] put forward a new IB-LRS scheme, which requires only seven pairing operations.…”

Section: A Related Workmentioning

confidence: 99%

Certificateless Linkable Ring Signature Scheme

2020

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: A Related Workmentioning

confidence: 99%

Certificateless Linkable Ring Signature Scheme

2020

Self Cite

View full text Add to dashboard Cite

show abstract

“…e LRS with unconditional anonymity was given by Liu et al [14] in the same year, which further improved the security of LRS and made up for the weaknesses of linkability and strong anonymity in ring signature that cannot be realized simultaneously. In 2019, Deng et al [15] constructed the most efficient identity-based LRS scheme, which requires only seven pairing operations in signature generation and verification. e above schemes are mainly founded on classical number theory problems (e.g., the large integer decomposition [16] and the finite field discrete logarithm problem [17]).…”

Section: Introductionmentioning

confidence: 99%

Identity-Based Linkable Ring Signature on NTRU Lattice

Tang

Xia

et al. 2021

Security and Communication Networks

View full text Add to dashboard Cite

Although most existing linkable ring signature schemes on lattice can effectively resist quantum attacks, they still have the disadvantages of excessive time and storage overhead. This paper constructs an identity-based linkable ring signature (LRS) scheme over NTRU lattice by employing the technologies of trapdoor generation and rejection sampling. The security of this scheme relies on the small integer solution (SIS) problem on NTRU lattice. We prove that this scheme has unconditional anonymity, unforgeability, and linkability under the random oracle model (ROM). Through the performance analysis, this scheme has a shorter size of public/private keys, and when the number of ring members is small (such as N ≤ 8 ), this scheme has a shorter signature size compared with other existing latest lattice-based LRS schemes. The computational efficiency of signature has also been further improved since it only involves multiplication in the polynomial ring and modular operations of small integers. Finally, we implemented our scheme and other similar schemes, and it is shown that the time for the signature generation and verification of this scheme decreases roughly by 44.951% and 33.503%, respectively.

show abstract

“…In 2013, Au et al [4] proposed a new ID-based event-oriented linkable ring signature scheme and prove the security of our scheme in the random oracle model, using the Discrete Logarithm (DL), the Decisional Diffie-Hellman (DDH) and q-Strong Diffie-Hellman (q-SDH) assumptions. Recently, in 2019, Deng et al [13] have presented a new identity-based linkable ring signature scheme that is secure in ROM. The security of [13] is based on the hardness of the computational Diffie-Hellman (CDH) problem and the decisional bilinear Diffie-Hellman (DBDH) problem.…”

Section: Introductionmentioning

confidence: 99%

“…Recently, in 2019, Deng et al [13] have presented a new identity-based linkable ring signature scheme that is secure in ROM. The security of [13] is based on the hardness of the computational Diffie-Hellman (CDH) problem and the decisional bilinear Diffie-Hellman (DBDH) problem.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Identity-Based Linkable Ring Signatures From Lattices

Lê

Duong

et al. 2021

IEEE Access

View full text Add to dashboard Cite

Linkable ring signatures is a useful cryptographic tool for constructing applications such as ones relative to electronic voting (e-voting), digital cashes (e-cashes) as well as cloud computing. Equipped with linkable ring signatures, e-voting, e-cash systems can simultaneously enjoy the privacy and the unreusability properties thanks to the anonymity and the linkability of linkable ring signatures. Likewise, cloud servers can enjoy a privacy-preserving ability, a flexible access control and an efficient security management with linkable ring signatures. Moreover, linkable ring signatures built in the identitybased setting would help to remove the expense of using the conventional public key infrastructure and also could be applied to the user management. This primitive hence would be suitable for huge-scale applications. In this paper, we present the first identity-based linkable ring signatures (IdLRS) in both integer lattice and ideal lattice setting. The proposed IdLRS is proved secure in the random oracle model and based on the hardness of the short integer solution and ring short integer solution assumption. We also implement the proposed idLRS as a proof of concept and then do some experiments to evaluate the running times and the sizes.INDEX TERMS Identity-based linkable ring signatures, e-voting, e-cash, cloud computing, lattices

show abstract

Identity-Based Linkable Ring Signature Scheme

Cited by 17 publications

References 29 publications

Certificateless Linkable Ring Signature Scheme

Certificateless Linkable Ring Signature Scheme

Identity-Based Linkable Ring Signature on NTRU Lattice

Identity-Based Linkable Ring Signatures From Lattices

Contact Info

Product

Resources

About