scholarly journals Anti-Quantum Lattice-Based Ring Signature Scheme and Applications in VANETs

Entropy ◽  
2021 ◽  
Vol 23 (10) ◽  
pp. 1364
Author(s):  
Chunhong Jiao ◽  
Xinyin Xiang
Keyword(s):  
Public Key Cryptography ◽  
Quantum Ring ◽  
Message Authentication ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Computing Power ◽  
Ring Signature ◽  
Signature Generation ◽  
And Performance ◽  
Entire Network

Message authentication is crucial because it encourages participants to accept countermeasures and further transmit messages to legitimate users in a network while maintaining the legitimacy of the identity of network members. An unauthorized user cannot transmit false messages to a given network. Although traditional public key cryptography is suitable for message authentication, it is also easy to manage and generate keys, and, with the expansion of an entire network, the system needs a lot of computing power, which creates additional risks to network security. A more effective method, such as ring signature, can realize this function and guarantee more security. In this paper, we propose an anti-quantum ring signature scheme based on lattice, functionality analysis, and performance evaluation to demonstrate that this scheme supports unconditional anonymity and unforgeability. After efficiency analysis, our scheme proved more effective than the existing ring signature schemes in processing signature generation and verification. The proposed scheme was applied to VANETs that support strong security and unconditional anonymity to vehicles.

scholarly journals Efficient identity based ring signature scheme in prime order group

2021 ◽  
Vol 6 (2) ◽  
pp. 69-74
Author(s):  
Jingyuan Li ◽  
Keyword(s):  
Prime Order ◽  
Signature Scheme ◽  
Ring Signature ◽  
Scheme Design ◽  
Order Group ◽  
Signature Generation ◽  
Verification Time ◽  
Identity Based ◽  
And Performance ◽  
Specific Identity

Aiming at the problem of long signature generation and verification time caused by low operation efficiency in ring signature algorithm based on composite order group, an asymmetric identity based ring signature scheme based on prime order group is proposed. The model definition and specific identity based ring signature scheme design of the proposed scheme are described, and the correctness and security of the proposed scheme are analyzed. Finally, the efficiency of the core operation part of the algorithm is explained. Compared with the correlation signature algorithm based on composite order group, the optimization has a great improvement in operation overhead and performance, and the designed scheme is unforgeable. The designed signature scheme meets the unconditional anonymity and unforgeability of ring signature.

A Verifiable Ring Signature Scheme Based on Multivariate Public-Key Cryptosystem

2013 ◽  
Vol 380-384 ◽  
pp. 1899-1902
Author(s):  
Ling Ling Wang
Keyword(s):  
Public Key ◽  
Quantum Computers ◽  
Public Key Cryptosystem ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Ring Signature ◽  
Multivariate Public Key

Most existing verifiable ring signature schemes are based on traditional PKCs, which cannot resist future attacks of quantum computers. Fortunately, the MQ-problem based Multivariate Public-Key Cryptosystem (MPKC) is an important alternative to traditional PKCs for its potential to resist future attacks of quantum computers. In this paper, we proposed a construction of verifiable ring signature based on MPKC, which has the properties of consistent, unforgery, signer-anonymity and verifiability.

ID-Based Deniable Ring Signature with Constant-Size Signature

2011 ◽  
Vol 255-260 ◽  
pp. 2192-2196
Author(s):  
Cheng Yu Hu ◽  
Peng Tao Liu
Keyword(s):  
Bilinear Pairings ◽  
The Other ◽  
Ring Size ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Ring Signature ◽  
Constant Size ◽  
Identity Based ◽  
Verification Process

The ring signature can guarantee the signer’s anonymity. Most proposed ring signature schemes have two problems: One is that the size of ring signature depends linearly on the ring size, and the other is that the signer can shift the blame to victims because of the anonymity. Some authors have studied the constant-size ring signature and deniable ring signature to solve these two problems. This paper shows that an identity-based ring signature scheme with constant size has some security problems by using an insecure accumulator and its verification process does not include the message m. Then we combine the concepts of “constant-size” and “deniable” to form an id-based deniable ring signature with constant-size signature. The new scheme with constant-size signature length is proposed based on an improved accumulator from bilinear pairings and it solves the problem of anonymity abuse.

Analysis and Attack of Two Ring Signature Schemes

2012 ◽  
Vol 468-471 ◽  
pp. 382-385
Author(s):  
Lei Wu
Keyword(s):  
Ad Hoc ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Ring Signature ◽  
Signcryption Scheme

A ring signature scheme enables a signer, in an ad-hoc manner, to sign a signature on behalf of a group of users including himself such that a verifier can be convinced that one of the identified users actually generated the signature but he can not identify the signer. In this paper, we analyse and attack two ring signature related schemes, including a ring signature scheme and a ring signcryption scheme, we prove that they can not satisfy the property of unconditional anonymity, and are all insecure.

Secure and Efficient Certificateless Signature and Blind Signature Scheme from Pairings

2013 ◽  
Vol 457-458 ◽  
pp. 1262-1265
Author(s):  
Min Qin Chen ◽  
Qiao Yan Wen ◽  
Zheng Ping Jin ◽  
Hua Zhang
Keyword(s):  
Random Oracle Model ◽  
Public Key Cryptography ◽  
Random Oracle ◽  
Blind Signature ◽  
Public Key ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Diffie Hellman ◽  
Identity Based ◽  
Certificateless Signature

Based an identity-based signature scheme, we givea certificateless signature scheme. And then we propose a certificateless blind signature (CLBS) scheme in this paper. This schemeis more efficient than those of previous schemes by pre-computing the pairing e (P, P)=g. Based on CL-PKC, it eliminates theusing of certificates in the signature scheme with respect to thetraditional public key cryptography (PKC) and solves key escrowproblems in ID-based signature schemes. Meanwhile it retains themerits of BS schemes. The proposed CLBS scheme is existentialunforgeable in the random oracle model under the intractabilityof the q-Strong Diffie-Hellman problem.

scholarly journals An Improved Identity-Based Multivariate Signature Scheme Based on Rainbow

Cryptography ◽  
2019 ◽  
Vol 3 (1) ◽  
pp. 8 ◽  
Author(s):  
Le Luyen
Keyword(s):  
Quantum Cryptography ◽  
Public Key Cryptography ◽  
Public Key ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Identity Based ◽  
Post Quantum Cryptography ◽  
Multivariate Public Key

Multivariate Public Key Cryptography (MPKC) is one of the main candidates for post-quantum cryptography, especially in the area of signature schemes. In this paper, we instantiate a certificate Identity-Based Signature (IBS) scheme based on Rainbow, one of the most efficient and secure multivariate signature schemes. In addition, we revise the previous identity-based signature scheme IBUOV based on the Unbalanced Oil and Vinegar (UOV) scheme on the security and choice of parameters and obtain that our scheme is more efficient than IBUOV in terms of key sizes and signature sizes.

scholarly journals Strongly Unforgeable Ring Signature Scheme from Lattices in the Standard Model

2014 ◽  
Vol 2014 ◽  
pp. 1-12
Author(s):  
Geontae Noh ◽  
Ji Young Chun ◽  
Ik Rae Jeong
Keyword(s):  
Standard Model ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Ring Signature ◽  
Arbitrary Ring ◽  
Computational Overhead ◽  
The Standard Model ◽  
First Time ◽  
Strong Unforgeability

In a ring signature scheme, a user selects an arbitrary ring to be able to sign a message on behalf of the ring without revealing the signer’s identity. Whistle-blowers especially find this useful. To date, various ring signature schemes have been proposed, all considered to be secure as existentially unforgeable with respect to insider corruption; that is, an adversary who chooses ring-message pairs for which he requests signatures, corrupts honest users, and obtains their signing keys can not produce forgeries for new ring-message pairs. Lattice-based ring signature schemes offer lower computational overhead and security from quantum attacks. In this paper, we offer a lattice-based scheme. We begin by showing that the existing ring signature schemes are not sufficiently secure, because existential unforgeability still permits a signer to potentially produce a new signature on previously signed messages. Furthermore, we show that existing ring signature schemes from lattices are not even existentially unforgeable with respect to insider corruption. We then improve previous schemes by applying, for the first time, the concept of strong unforgeability with respect to insider corruption to a ring signature scheme in lattices. This offers more security than any previous ring signature scheme: adversaries cannot produce new signatures for any ring-message pair, including previously signed ring-message pairs.

scholarly journals Digital Signatures in a Quantum World: Evaluating The Trade-off Between Performance and Security for GeMSS

2019 ◽  
Author(s):  
Paulo Ricardo Reis ◽  
Fábio Borges
Keyword(s):  
Quantum Computing ◽  
Digital Signature ◽  
Quantum Computer ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Trade Off ◽  
Signature Generation ◽  
Security Parameter ◽  
Verification Process ◽  
Definition Of

With the advent of quantum computing, it urges the definition of a cryptographic standard algorithm that can resist attacks from a quantum computer. Inside this context is GeMSS, a multivariate quadratic signature scheme based on the HFEvconstruct. Schemes of this type have shown great potential throughout the last two decades. This paper traces a comparison of performance and security between GeMSS and other relevant digital signature schemes, showing that despite of its slow signature generation and large key pair, it has a very quick verification process and tiny signatures. It also proposes a method for deriving the size of keys from the security parameter evaluated.

Some Thoughts on Strong Unforgeability in Ring Signature Schemes

2012 ◽  
Vol 457-458 ◽  
pp. 773-779
Author(s):  
Chen Wang
Keyword(s):  
Standard Model ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Ring Signature ◽  
Modified Method ◽  
Ring Signatures ◽  
The Standard Model ◽  
Strong Unforgeability

A signature scheme is strongly unforgeable if the adversary cannot produce a new signature even on a queried message. Some methods have been proposed to enhance some regular signatures. However, if applied to ring signatures, such methods will break the anonymity, which is the soul of ring signatures. We introduce a modified method which can achieve both strong unforgeability and anonymity in the standard model. Applying this method to Shacham-Waters scheme, we get the first ring signature with strong unforgeability in the stand model.

scholarly journals An Efficient Code-Based Threshold Ring Signature Scheme with a Leader-Participant Model

2017 ◽  
Vol 2017 ◽  
pp. 1-7 ◽  
Author(s):  
Guomin Zhou ◽  
Peng Zeng ◽  
Xiaohui Yuan ◽  
Siyuan Chen ◽  
Kim-Kwang Raymond Choo
Keyword(s):  
Quantum Computing ◽  
Digital Signature ◽  
Time Complexity ◽  
Signature Scheme ◽  
Decoding Algorithm ◽  
Signature Schemes ◽  
Ring Signature ◽  
Normal Code ◽  
Efficient Code

Digital signature schemes with additional properties have broad applications, such as in protecting the identity of signers allowing a signer to anonymously sign a message in a group of signers (also known as a ring). While these number-theoretic problems are still secure at the time of this research, the situation could change with advances in quantum computing. There is a pressing need to design PKC schemes that are secure against quantum attacks. In this paper, we propose a novel code-based threshold ring signature scheme with a leader-participant model. A leader is appointed, who chooses some shared parameters for other signers to participate in the signing process. This leader-participant model enhances the performance because every participant including the leader could execute the decoding algorithm (as a part of signing process) upon receiving the shared parameters from the leader. The time complexity of our scheme is close to Courtois et al.’s (2001) scheme. The latter is often used as a basis to construct other types of code-based signature schemes. Moreover, as a threshold ring signature scheme, our scheme is as efficient as the normal code-based ring signature.

Sign in / Sign up

Export Citation Format

Share Document