Towards Practical Lattice-Based One-Time Linkable Ring Signatures

Baum, Carsten; Lin, Huang; Oechsner, Sabine

doi:10.1007/978-3-030-01950-1_18

Cited by 50 publications

(49 citation statements)

References 50 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More concretely we use the ring R q = Z q [X]/(X 256 + 1), where q = 8380417. The parameters of the MLWE problem are (k, l) = (3,4) and the coefficients of the LWE secrets are sampled uniformly from [−6, 6]. In our implementation we use the optimization by Bai and Galbraith [2].…”

Section: Parameter Selection Implementation Results and Conclusionmentioning

confidence: 99%

“…) proving knowledge of (s I , I) ∈ S 1 ×[N ], such that s I X 0 = X I . 4 We sketch the description of our base OR sigma protocol Π RS-base Σ . First, the prover samples an element r uniformly from S 2 , and computes R i = r X i for all i ∈ [N ].…”

Section: From An Admissible Group Action To Base or Sigma Protocolmentioning

confidence: 99%

“…To resolve this issue it is necessary to consider hard problems that resist attacks from quantum computers. Post-quantum ring signature schemes scaling polylogarithmically with the ring size have been constructed from symmetric cryptographic primitives [20,11] and the hardness of lattice problems [15,16,4,31,23].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Calamari and Falafl: Logarithmic (Linkable) Ring Signatures from Isogenies and Lattices

Beullens

Katsumata

Pintore

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We construct efficient ring signatures (RS) from isogeny and lattice assumptions. Our ring signatures are based on a logarithmic OR proof for group actions. We instantiate this group action by either the CSIDH group action or an MLWE-based group action to obtain our isogeny-based or lattice-based RS scheme, respectively. Even though the OR proof has a binary challenge space and therefore requires a number of repetitions which is linear in the security parameter, the sizes of our ring signatures are small and scale better with the ring size N than previously known post-quantum ring signatures. We also construct linkable ring signatures (LRS) that are almost as efficient as the non-linkable variants. The isogeny-based scheme produces signatures whose size is an order of magnitude smaller than all previously known logarithmic post-quantum ring signatures, but it is relatively slow (e.g. 5.5 KB signatures and 79 s signing time for rings with 8 members). In comparison, the latticebased construction is much faster, but has larger signatures (e.g. 30 KB signatures and 90 ms signing time for the same ring size). For small ring sizes our lattice-based ring signatures are slightly larger than state-ofthe-art schemes, but they are smaller for ring sizes larger than N ≈ 1024.

show abstract

Section: Parameter Selection Implementation Results and Conclusionmentioning

confidence: 99%

Section: From An Admissible Group Action To Base or Sigma Protocolmentioning

confidence: 99%

See 1 more Smart Citation

Calamari and Falafl: Logarithmic (Linkable) Ring Signatures from Isogenies and Lattices

Beullens

Katsumata

Pintore

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…In 2018, Boyen and Haines [5] put forward a LRS scheme, which uses an n-time one-way private key update mechanism based on n-times multi-linear mapping. Baum et al [4] proposed a LRS scheme, the security is based on difficult questions on lattices.…”

Section: A Related Workmentioning

confidence: 99%

Certificateless Linkable Ring Signature Scheme

2020

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

“…These two schemes achieved unconditional anonymity. In 2018, Baum et al [3] presented a LRS scheme by a lattice-based collision-resistant hash function. Boyen and Haines [4] proposed a LRS scheme that implements forward-secure key updates and unconditional anonymity.…”

Section: A Related Workmentioning

confidence: 99%

Identity-Based Linkable Ring Signature Scheme

2019

View full text Add to dashboard Cite

A ring signature is an anonymous signature that implements both the authentication of the message and the anonymity of the signer. In a ''normal'' ring signature scheme, the same signer can generate multiple ring signatures, but the verifier cannot find this fact. Linkable ring signature (LRS) solves the problem. In the setting, the identity of the signer is still anonymous, and if the same signer generates multiple ring signatures, the verifier can confirm the fact. Linkable ring signatures are applied to some actual scenarios, such as e-cash, e-voting and ad-hoc network authentication. In this paper, we presented a new identity-based linkable ring signature scheme that avoids certificate management. We then gave the security proofs in the random oracle model (ROM) and compared the efficiency of it with the previous schemes. The new scheme requires only 7 pairing operations in signing and verifying. It is the most efficient linkable ring signature in the identity-based setting. INDEX TERMS Identity-based cryptography, ring signature, linkable, pairing, random oracle model.

show abstract

Towards Practical Lattice-Based One-Time Linkable Ring Signatures

Cited by 50 publications

References 50 publications

Calamari and Falafl: Logarithmic (Linkable) Ring Signatures from Isogenies and Lattices

Calamari and Falafl: Logarithmic (Linkable) Ring Signatures from Isogenies and Lattices

Certificateless Linkable Ring Signature Scheme

Identity-Based Linkable Ring Signature Scheme

Contact Info

Product

Resources

About