A Simpler Construction of Identity-Based Ring Signatures from Lattices

Zhao, Gongming; Tian, Miaomiao

doi:10.1007/978-3-030-01446-9_16

Cited by 9 publications

(8 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Assumption Security ModelPost-quantum Chow [12] The proposed IdLRS enjoys the anonymity, the unforgeability, the linkability and the nonslanderability in the random oracle model. In doing this, we combine the idea of ID-based ring signature [52] and the idea of linkable ring signature [2] to construct our IdLRS. A technically essential tool is the lattice trapdoor mechanism [33].…”

Section: Methodsmentioning

confidence: 99%

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

Section: Methodsmentioning

confidence: 99%

Identity-Based Linkable Ring Signatures From Lattices

Lê

Duong

et al. 2021

IEEE Access

View full text Add to dashboard Cite

show abstract

“…But their scheme was constructed under ROM and cannot be well applied in practice. In 2018, an identity-based ring signature based on lattice was reported by Zhao et al, which solved the problem that traditional ring signatures need to rely on digital certificates, but this scheme is constructed under ROM and cannot be well applied in practice [41]. In the same year, Wang and Zhao used the Fiat-Shamir framework to design a ring signature without trapdoors under ROM [25].…”

Section: Introductionmentioning

confidence: 99%

“…However, the verification key size is still too big [47]. For above ring signature schemes, they are either constructed under ROM [25], [40], [41], [43], [44], have a relatively large verification key size or signature size [22]- [25], [42], [47], or have some security risks [45], [46].…”

Section: Introductionmentioning

confidence: 99%

Profane or Not: Improving Korean Profane Detection using Deep Learning

2022

KSII TIIS

View full text Add to dashboard Cite

With the development of quantum computers, ring signature schemes based on large integer prime factorization, discrete logarithm problem, and bilinear pairing are under threat. For this reason, we design a ring signature scheme based on lattice with a fixed verification key. Compared with the previous ring signature scheme based on lattice, our design has a fixed verification key and does not disclose the signer's identity. Meanwhile, we propose an anonymous electronic voting scheme by using our ring signature scheme based on lattice and (𝑡𝑡, 𝑛𝑛) threshold scheme, which makes up for the lack of current anonymous electronic voting that cannot resist attacks of the quantum computer. Finally, under standard model (SM), we prove that our ring signature scheme based on lattice is anonymous against the full-key exposure, and existentially non-forgeable against insider corruption. Furthermore, we also briefly analyze the security of our anonymous electronic voting scheme.

show abstract

“…Similar to a digital signature over lattice, lattice-based (linkable) RS can also be mainly divided into two branches, i.e., with trapdoors and without trapdoors. Lattice-based RS schemes with trapdoors have been extensively studied [31][32][33][34][35][36]. Notice that these lattice-based RS schemes with trapdoors, although are progressing about storage overhead, cannot always avoid the drawbacks brought by the structure of hash-and-sign, and the computational efficiency cannot be enhanced to a satisfactory level.…”

Section: Introductionmentioning

confidence: 99%

Efficient Lattice-Based Ring Signature Scheme without Trapdoors for Machine Learning

Lang

Zhao

et al. 2022

Computational Intelligence and Neuroscience

View full text Add to dashboard Cite

Machine learning (ML) and privacy protection are inseparable. On the one hand, ML can be the target of privacy protection; on the other hand, it can also be used as an attack tool for privacy protection. Ring signature (RS) is an effective way for privacy protection in cryptography. In particular, lattice-based RS can still protect the privacy of users even in the presence of quantum computers. However, most current lattice-based RS schemes are based on a strong trapdoor like hash-and-sign, and in such constructions, there is a hidden algebraic structure, that is, added to lattice so that the trapdoor shape is not leaked, which greatly affects the computational efficiency of RS. In this study, utilizing Lyubashevsky collision-resistant hash function over lattice, we construct an RS scheme without trapdoors based on ideal lattice via Fiat‒Shamir with aborts (FSwA) protocol. Regarding security, the proposed scheme satisfies unconditional anonymity against chosen setting attacks (UA-CSA), which is stronger than anonymity against full key exposure (anonymity-FKE), and moreover, our scheme satisfies unforgeability with respect to insider corruption (EU-IC). Regarding computational overhead, compared with other RS schemes that satisfy the same degree of security, our scheme has the highest computational efficiency, the signing and verification time costs of the proposed scheme are obviously better than those of other lattice-based RS schemes without trapdoors, which is more suitable for ML scenarios.

show abstract

A Simpler Construction of Identity-Based Ring Signatures from Lattices

Cited by 9 publications

References 32 publications

Identity-Based Linkable Ring Signatures From Lattices

Identity-Based Linkable Ring Signatures From Lattices

Profane or Not: Improving Korean Profane Detection using Deep Learning

Efficient Lattice-Based Ring Signature Scheme without Trapdoors for Machine Learning

Contact Info

Product

Resources

About