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.

Improved Multi-party Quantum Key Agreement with Four-qubit Cluster States

Quantum key agreement is a promising key establishing protocol that can play a significant role in securing 5G/6G communication networks.Recently,Liu et al.(Quantum Information Processing 18(8):1-10,2019)proposed a multi-party quantum key agreement protocol based on four-qubit cluster states was proposed.The aim of their protocol is to agree on a shared secret key among multiple remote participants.Liu et al.employed four-qubit cluster states to be the quantum resources and the X operation to securely share a secret key.In addition,Liu et al.’s protocol guarantees that each participant makes an equal contribution to the final key.The authors also claimed that the proposed protocol is secure against participant attack and dishonest participants cannot generate the final shared key alone.However,we show here that Liu et al.protocol is insecure against a collusive attack,where dishonest participants can retrieve the private inputs of a trustworthy participant without being caught.Additionally,the corresponding modifications are presented to address these security flaws in Liu et al.’s protocol.

A Kind of Multi-party Non-repudiation Protocol with Consistent Evidence

With development of electronic com- merce, non-repudiation protocol as the basal component of non-repudiation service has done more and more important functions. Comparing with lots of work on two-party non-repudiation, there are less work on multi-party non-repudiation protocol. Multi-party protocol is more complex and facing more challenge of collusion attack. In this paper we give a kind of multi-party non-repudiation protocol based on off-line TTP with consistent evidence. Consistent evidence is a property that can not only simplify the process of disputation resolving, but also make the service more friendly to users, which means that whether or not TTP involves, evidences participants obtained are consistent. In the meanwhile we analyze the collusion attack that multi-party protocol facing, our protocol can prevent collusion attack.

Cryptanalysis on an organization-friendly blockchain system

To verify that an organization-friendly blockchain system may suffer from forgery and collusion attacks,forgery and collusion attacks were theoretically carried out according to the phase sequence of an organization-friendly blockchain system.Then,the organization-friendly blockchain system was improved and based on the phase sequence forgery and collusion attacks were conducted.The results show that the attacker can obtain illegal transaction data from forgery and collusion attacks on the organization-friendly blockchain system.However,for the improved organization-friendly blockchain,the attacker s forgery and collusion attacks cannot be completed.Therefore,the organization-friendly blockchain system may be subject to forgery and collusion attacks,but the improved organization-friendly blockchain system can prevent such attacks.

Attacks and Improvement of Quantum Sealed-Bid Auction with EPR Pairs

Recently, an experimentally feasible three-party quantum sealed-bid auction protocol based on EPR pairs [Z.Y. Wang, Commun. Theor. Phys. 54 （2010） 997] was proposed. However, this study points out Wang＇s protocol cannot resist some internal bidders＇ attacks, such as the Twiee-CNOT attack, the collusion attack. A malicious bidder can launch the Twice-CNOT attack to obtain the other＇s bid, or the dishonest auctioneer may collude with one bidder and help him/her win the action by changing his/her bid. For preventing against these attacks, a simple solution by using the QKD-based message encryption and a post-confirmation mechanism by adopting the hash function are proposed.

Attack on the Enhanced Multiparty Quantum Secret Sharing

Recently, Gao et al.'s [Commun. Theor. Phys. 52 (2009) 421] multiparty quantum secret sharing (MQSS) protocol with two-photon three-dimensional Bell states was enhanced by Hwang et al. [Commun. Theor. Phys. 56 (2011) 79]. The improved protocol removes some unnecessary unitary operations, devices, and transmissions by the technique of decoy single photons and careful modification. However, in this paper, we investigate the security of the improved protocol and find it is insecure. The eavesdropper can steal all Alice's secret information. Furthermore, a feasible modification to remedy the security loophole is put forward. Our improved protocol provides a basic method to modify a kind of MQSS protocols which cannot resist the collusion attack.

Public Auditing for Shared Data Utilizing Backups with User Revocation in the Cloud

With the advent of cloud storage, users can share their own data in the remote cloud as a group. To ensure the security of stored data and the normal operation of public auditing, once a user is revoked from the user group, the data files he signed should be resigned by other legal users in the group. In this paper, we propose a new re-signature scheme utilizing backup files to rebuild data which can resist the collusion between the cloud and revoked users, and we use Shamir Secret Sharing Scheme to encrypt data in the multi-managers system which can separate the authority of the group managers. Moreover, our scheme is more practical because we do not need managers to be online all the time. Performance evaluation shows that our mechanism can improve the efficiency of the process of data re-signature.