An Improved Lattice-Based Ring Signature With Unclaimable Anonymity in the Standard Model

نویسندگان

چکیده

Abstract Ring signatures enable a user to sign messages on behalf of an arbitrary set users, called the ring, without revealing exactly which member that ring actually generated signature. The signer-anonymity property makes have been active research topic. Recently, Park and Sealfon (PS; CRYPTO’19) presented important anonymity notion named signer-unclaimability constructed lattice-based signature scheme with unclaimable in standard model; however, it did not consider unforgeable w.r.t. adversarially chosen-key attack (the public key may contain keys created by adversary) size grows quadratically message. In this work, we propose new model. particular, our work improves security efficiency PS is attack, linearly size.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Lattice-Based Threshold Ring Signature Scheme

We present in this paper an improvement of the lattice-based threshold ring signature proposed by Cayrel, Lindner, Rückert and Silva (CLRS) [LATINCRYPT ’10]. We generalize the same identification scheme CLRS to obtain a more efficient threshold ring signature. The security of our scheme relies on standard lattice problems. The improvement is a significant reduction of the size of the signature....

متن کامل

ID-Based Ring Signature Scheme Secure in the Standard Model

The only known construction of ID-based ring signature schemes which maybe secure in the standard model is to attach certificates to non-ID-based ring signatures. This method leads to schemes that are somewhat inefficient and it is an open problem to find more efficient and direct constructions. In this paper, we propose two such constructions. Our first scheme, with signature size linear in th...

متن کامل

Lattice-Based Ring Signature Scheme under the Random Oracle Model

Abstract: On the basis of the signatures scheme without trapdoors from lattice, which is proposed by Vadim Lyubashevsky in 2012, we present a new ring signature scheme from lattice. The proposed ring signature scheme is an extension of the signatures scheme without trapdoors. We proved that our scheme is strongly unforgeable against adaptive chosen message in the random oracle model, and proved...

متن کامل

A Lattice-Based Threshold Ring Signature Scheme

In this article, we propose a new lattice-based threshold ring signature scheme, modifying Aguilar’s code-based solution to use the short integer solution (SIS) problem as security assumption, instead of the syndrome decoding (SD) problem. By applying the CLRS identification scheme, we are also able to have a performance gain as result of the reduction in the soundness error to 1/2 per round. S...

متن کامل

An improved identity-based ring signature scheme from bilinear pairings

Lin-Wu’s ID-based ring signature scheme from bilinear pairings is unreasonable. In this paper, we improve it, and obtain a reasonable ID-based ring signature scheme from bilinear pairings.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 2022

ISSN: ['0010-4620', '1460-2067']

DOI: https://doi.org/10.1093/comjnl/bxac104