A Lattice-Based Certificateless Traceable Ring Signature Scheme

نویسندگان

چکیده

A ring signature (RS) scheme enables a group member to sign messages on behalf of its without revealing the definite signer identify, but this also leads abuse anonymity by malicious signers, which can be prevented traceable signatures (TRS). Up until that point, have been secure based difficult problem number-theoretic (discrete logarithms or RSA), since advent quantum computers, traditional may no longer secure. Thus Feng proposed lattice TRS, are resistant attacks computers. However, works did not tackle certificate management problem. To close gap, quantum-resistant certificateless TRS was in study. best our knowledge, is first TRS. In detail, specific combined with lattice-based technology solve while avoid key escrow Additionally, better zero-knowledge protocol used improve computational efficiency scheme, and reducing soundness error protocol, number runs reduced, so communication overhead reduced. Under random oracle model, satisfies tag-linkability, anonymity, exculpability SIS DLWE conclusion, more practical promising e-voting.

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

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...

متن کامل

New Certificateless Blind Ring Signature Scheme

A new certificateless blind ring signature scheme was proposed in this paper. The scheme could not only avoid the problem of certificate management of public key certificate cryptography, but also overcome the inherent key-escrow problem of identity-based public key cryptography. In the last, by using bilinear pairing technique, it was proved that this scheme satisfied the security of existenti...

متن کامل

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....

متن کامل

Lattice-Based Revocable Certificateless Signature

Certificateless signatures (CLS) are noticeable because they may resolve the key escrow problem in ID-based signatures and break away the management problem regarding certificate in conventional signatures. However, the security of the mostly previous CLS schemes relies on the difficulty of solving discrete logarithm or large integer factorization problems. These two problems would be solved by...

متن کامل

A Certificateless Proxy Ring Signature Scheme with Provable Security

Proxy ring signature allows proxy signer to sign messages on behalf of the original signer while providing anonymity. Certificateless public key cryptography was first introduced by Al-Riyami and Paterson in Asiacrypt 2003. In certificateless cryptography, it does not require the use of certificates to guarantee the authenticity of users’ public keys. Meanwhile, certificateless cryptography doe...

متن کامل

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


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

ژورنال

عنوان ژورنال: Information

سال: 2023

ISSN: ['2078-2489']

DOI: https://doi.org/10.3390/info14030160