Threshold Group Signature Scheme Research Articles

An identity-verifiable quantum threshold group signature scheme based on three-particle GHZ states

With the advancement of the new generation of information technology in recent years, quantum digital signatures have been widely concerned. Among them, quantum threshold group signatures have become a hot research field due to their advantages such as low cost and strong scalability. Therefore, in this paper, we propose an identity-verifiable quantum threshold group signature scheme based on three-particle GHZ states. The characteristics of the scheme are as follows. The signers can reconstruct the key K for signature’s generation and verification by using the Shamir threshold secret sharing scheme. A quantum signature is generated by performing controlled-not operations, von Neumann measurements, and quantum Fourier transform. When the signature is verified, only classical hash values need to be compared, without comparing quantum states. Identity verification is performed between participants by using hash functions. The efficiency of the scheme is improved by using super-dense coding. Security analysis shows that our scheme is unforgeable and undeniable.

Arbitrated quantum (t,n) threshold group signature scheme based on multi-coin quantum walk

Arbitrated quantum (t,n) threshold group signature scheme based on multi-coin quantum walk

Improved quantum (t, n) threshold group signature

Threshold signature is an important branch of the digital signature scheme, which can distribute signature rights and avoid the abuse of signature rights. With the continuous development of quantum computation and quantum information, quantum threshold signatures are gradually becoming more popular. Recently, a quantum (t, n) threshold group signature scheme was analyzed that uses techniques such as quantum-controlled-not operation and quantum teleportation. However, this scheme cannot resist forgery attack and does not conform to the design of a threshold signature in the signing phase. Based on the original scheme, we propose an improved quantum (t, n) threshold signature scheme using quantum (t, n) threshold secret sharing technology. The analysis proves that the improved scheme can resist forgery attack and collusion attack, and it is undeniable. At the same time, this scheme reduces the level of trust in the arbitrator during the signature phase.

Cryptanalysis and improvement of a (t, n) threshold group signature scheme

Cryptanalysis and improvement of a (t, n) threshold group signature scheme

A threshold group signature scheme suitable for the Internet of Things

SummaryWith the development of information technology, the Internet of Things terminals are vulnerable to threats such as eavesdropping, tampering, and counterfeiting. The application of threshold group signature technology can effectively ensure the security of the system in applications such as battlefield intelligent decision‐making, connected vehicles, and intelligent manufacturing. However, the existing threshold group signature schemes lack the two‐way trusted authentication mechanism between group members and group manager, and group manager can easily become a security risk for the entire signature system. To solve this problem, this paper proposes a threshold group signature scheme based on elliptic curve that achieves mutual authentication of group members and group manager. The security analysis proves that the proposed scheme is anonymous, traceable, and can resist collusion attacks and frame attacks. The results of performance analysis and comparison also show that under the same security strength, the scheme proposed has shorter signature length, lower calculation amount for signature generation and signature verification, which can effectively reduce the communication and calculation overhead of the IoT terminal, and can be better applied to the Internet of Things application scenarios.

Identity-based threshold group signature scheme based on multiple hard number theoretic problems

We introduce in this paper a new identity-based threshold signature (IBTHS) technique, which is based on a pair of intractable problems, residuosity and discrete logarithm. This technique relies on two difficult problems and offers an improved level of security relative to an individual hard problem. The majority of the denoted IBTHS techniques are established on an individual difficult problem. Despite the fact that these methods are secure, however, a prospective solution of this sole problem by an adversary will enable him/her to recover the entire private data together with secret keys and configuration values of the associated scheme. Our technique is immune to the four most familiar attack types in relation to the signature schemes. Enhanced performance of our proposed technique is verified in terms of minimum cost of computations required by both of the signing algorithm and the verifying algorithm in addition to immunity to attacks.

Quantum (t, n) threshold group signature based on Bell state

Quantum group signature is an important branch of quantum signature. Most of the existing quantum group signature schemes require that all the signatories must be present to generate a valid signature, and this property may limit their application in practice. In this paper, we will propose a quantum (t, n) threshold group signature scheme. In our scheme, n signatories compose a group, and any t out of these n signatories can generate a valid signature on behalf of the group. The t signatories use the quantum-controlled-not operations to expand the quantum message into t-particle entangled states, and then use the entanglement swapping to transmit the quantum message to the receiver. The receiver performs the single-particle measurements and unitary operations to recover the initial quantum message, and then verifies the signature with the help of the arbitrator. Compared to the existing quantum group signature schemes, our (t, n) threshold scheme will be more flexible in practice.

A Signature Protocol Based on Specific Set

Based on the idea of privilege set, this paper proposes a threshold group signature scheme with multiple privilege sets. Only when the joint involvement of ordinary users under satisfied conditions and privileged users with multiple privilege sets can the valid proxy group signature be generated. Some members can’s forge signatures, which can help resist attacks. The threshold signature scheme has good features of privilege sets and threshold characteristics, unforgeability of signature and anonymity of verification and traceability of identity.

An Elliptic Curve Threshold Group Signature Scheme

In a (t,n) threshold group signature scheme, only t or more signers of the group can sign messages on behalf of the group. Elliptic Curve Cryptography (ECC) was introduced by Victor Miller and Neal Koblitz in 1985. ECC proposed as an alternative to established public-key systems such as DSA and RSA. The main reason for the attractiveness of ECC isthe fact that there is no sub-exponential algorithm known to solve the discrete logarithm problem on a properly chosen elliptic curve. This means that significantly smaller parameters can be used in ECC than in other competitive systems such RSA and DSA, but with equivalent levels of security. Some benefits of having smaller key sizes include faster computations, and reductions in processing power, storage space and bandwidth. This makes ECC ideal for constrained environment such as pagers, PDAs, cellular phones and smart cards. In this paper, we propose a threshold group signature scheme based on elliptic curve discrete logarithm problem. The advantages of the proposed scheme are justified through extensive simulations.

"Discrete Logarithm based 't, n' Threshold Group Signature Scheme"

of the Internet has boosted electronic information exchange on both the personal and business levels. There is a need of the authentication of messages sent by a group of individuals to another group. A (t, n) threshold group signature scheme is a method for allowing a member of a group to anonymously sign a message on behalf of the group. The idea of threshold cryptography is to protect information by distributing it among a cooperating member. Following some ideas of the classical threshold signature scheme, a (t, n) threshold group signature scheme and (k, m) threshold group signature verification scheme based on discrete logarithm problem is proposed. The group signature is generated by at least t group members and is verified by at least k members in the group. Only one group public key is required. Each group member separately signs the message. The scheme is highly secure and resists the conspiracy attack.

Two Group Signature Schemes with Multiple Strategies Based on Bilinear Pairings

A group signature scheme and a threshold group signature scheme based on Bilinear Paring are proposed, there are multiple security strategies in these two schemes. These schemes have forward security which minimizes the damage caused by the exposure of any group member's signing key, and does not affect the past signatures generated by this member; meanwhile, ahead signature generated by a group member before the joining date can be prevented via this strategy. Moreover, this scheme support the group member revocable function efficiently and further has no requirement for time period limits.

Repairing Efficient Threshold Group Signature Scheme

To enhance the efficiency of threshold group signature schemes, Yu and Chen, recently, proposed an efficient threshold group signature scheme. By using elliptic curves, the proposed scheme can use short secret key and reduces the load of signature verification. However, in this paper we find that there are many ambiguities in the proposed scheme. The verifiers cannot verify valid signatures, while adversaries can not only easily forge the signatures of individual members, but also forge group signatures without the knowledge of secret keys. Though we can modify it to withstand this forgery attack, the modified scheme cannot withstand a general coalition at-tack inherent in many threshold signature schemes.

A Group of Threshold Group-Signature Schemes with Privilege Subsets

Feng Deng-Guo suggested a problem so called “threshold group-signature scheme with privilege subsets”. This paper analyzes the security of such schemes at present and propose new schemes. Based on theory of finite fields, the authors firstly show there are some insufficiencies and potential hazard in the scheme proposed by Shi, et al. Secondly, using the idea of constructing group-signature scheme by individual signature scheme, a group of the ones with four variants of type of ElGamal are put fordward, which have some attractive properties, such as message recovery, shorter length of signature, etc. Finally, the security of the schemes is proved under the assumption that the respective individual signature schemes are secure.

A secure threshold group signature scheme

The threshold group signature is an important kind of signature. So far, many threshold group signature schemes have been proposed, but most of them suffer from conspiracy attack and are insecure. In this paper, a secure threshold group signature scheme is proposed. It can not only satisfy the properties of the threshold group signature, but also withstand the conspiracy attack.