Search

In order to solve the problems of the current art circulation information is not transparent and the centralized trading authority is asymmetric, this paper proposed a art blockchain certificate traceability model based on three chains. First, in view of the large amount of data in a single piece of artwork information, this paper proposed a blockchain-based symmetric searchable encryption algorithm, and used the interplanetary file system to securely store artwork circulation records on-chain and off-chain. Secondly, for the characteristics of the increasing effective data of artwork information, this paper proposed a blockchain-based inverted fast query and traceability algorithm to help data users realize fast traceability and positioning. At the same time, this paper proposed for the first time that the false information alliance chain stores false art circulation records to realize the processing of false information. Finally, experiments verify the feasibility of the model for big data security storage and fast query traceability. Experiments show that the model is feasible and the query method is efficient. [ABSTRACT FROM AUTHOR]

This paper proposed an electronic voting scheme based on one-time ring signature and blockchain to solve the problems of the current e-voting system in terms of anonymity, transparency and open vote-counting. This paper introduced one-time ring signature, blockchain and stealth address technology. The one-time ring signature technology solved the problem of voter anonymity, repeated voting and public verification. The blockchain technology could ensure the openness and transparency of the e-voting system. The one-time ring signature technology could ensure no one or institution could obtain the voting intermediate result before the voting ends. In order to improve the efficiency of vote-counting,it used the method of key sharing to improve the vote-counting algorithm. Through security and performance analysis, the scheme conforms to the basic security standards of an electronic voting system. [ABSTRACT FROM AUTHOR]

In order to achieve a fair distribution of benefits in federated learning, an indicator that quantifies the contribution of each data provider to the global model is critical. Aiming at the problems of privacy leakage, opacity and dependence on central server in existing contribution evaluation schemes, this paper proposed a transparent federated learning contribution evaluation scheme based on blockchain. Firstly, this paper proposed an improved Paillier secure aggregation algorithm, which avoided the inference of user local data in the model aggregation stage by joint decryption. Secondly, this paper proposed a method to approximate the contribution based on the gradient of user cumulative submission, which solved the problem of privacy leakage in the existing contribution evaluation scheme. In addition, it integrated the evaluation of the contribution into the consensus process of the blockchain, making the evaluation results auditable. Finally, experiments based on MNIST dataset show that the proposed method can effectively evaluate the contribution. [ABSTRACT FROM AUTHOR]

To address the problems of Byzantine fault-tolerant algorithm with high communication overhead, simple node selection, and lack of penalty mechanism for malicious nodes, this paper proposed an improved Byzantine fault-tolerant consensus algorithm based on the recommendation trust model. It introduced the recommended trust model under P2P networks to calculate the global trust value of each node based on the behavior of nodes in the consensus phase, and used the node selection mechanism is to solve the problem of simple node selection. The nodes with high global trust value entered the consensus group, and malicious nodes were kicked out of the consensus group and no longer participate in the consensus, solving the problem of lack of punishment mechanism for malicious nodes. Experiments show that the R-PBFT algorithm has lower network overhead and higher fault tolerance than the PBFT algorithm. [ABSTRACT FROM AUTHOR]

Aiming at the problems of low consensus efficiency and insufficient incentive mechanism existing in current consensus algorithms, this paper proposed an alliance chain consensus algorithm based on credit. Firstly, according to the behavior of nodes participating in the consensus process, it designed a node credit evaluation mechanism, and solved the problem of insufficient incentive mechanism between nodes through credit rewards. Secondly, it constructed a credit blockchain and credit calculation model, stored the credit value of the node, and used it as the basis for selecting "miner" nodes, which improved the efficiency of the consensus algorithm. Finally, this paper proposed a round-by-round miner node selection algorithm, which used random algorithm and priority ranking algorithm to select miner nodes in turn, and proposed a node credit evaluation method to avoid excessive credit value of nodes and became "oligarchs" and ensured that the fairness of the nodes becoming miners. The experimental simulation results show that the credit consensus algorithm has low computational power consumption, fast block production speed, better performance than the existing consensus algorithm, and can be well applied to the business and medical alliance chain scenarios. [ABSTRACT FROM AUTHOR]

In order to solve the problem of high management cost of centralized identity authentication in the application scenario of Internet of Things ( IoT ), and solve the problem of mutual trust and certificate management between heterogeneous trust domains, this paper proposed a c ross- domain authentication scheme based on multi-layer blockchain. This scheme used local blockchain for distributed node management in IoT application scenarios, and used public blockchain for cross chain identity authentication between blockchains. This paper designed a protocol for cross domain authentication. In order to solve the problem of mutual trust among multiple management domains in cross-domain access, this paper proposed a DOPS consensus based on trust evaluation to evaluate the credibility of nodes. Finally, it analysed the security and efficiency of c ross domain authentication scheme. The analysis shows that the scheme has good security and effectiveness, and improves the efficiency of cross domain authentication. [ABSTRACT FROM AUTHOR]

In order to solve the trust problem and resource scheduling efficiency problem in the current cloud manufacturing system, this paper researched the application of block chain technology in cloud manufacturing system. Firstly, this paper expounded the significance of applying blockchain technology to cloud manufacturing system, and proposed a cloud manufacturing system based on blockchain technology. Secondly, this paper designed the manufacturing resource scheduling mode based on smart contract. And constructed the resource scheduling model aim to with the minimum manufacturing cost, the shortest time and the highest qualification rate. The model used differential evolution algorithm to solve. Finally, it simulated the experiment . The simulation results show the resource scheduling method based on the blockchain technology in the smart contract not only ensures the mutual trust between the participants in the system, but also effectively improves the resource scheduling efficiency and the superiority of the resource scheduling scheme of the cloud manufacturing system. [ABSTRACT FROM AUTHOR]

In order to solve the problems of centralised medical data management systems being vulnerable to hacking, poor data interoperability and patients having no control over their data, this paper proposed a secure sharing scheme for medical data based on the Ethereum. It used blockchain combined with the ElGamal algorithm and reversible hash function to achieve a secure patient-centric sharing mechanism, and used smart contracts as well as control modules to achieve access control for data users. Compared with the comparison scheme, the simulation experiment shows that the proposed scheme has lower computing overhead while meeting the five security features of confidentiality,integrity,identity verification,non-repudiation,and access control. [ABSTRACT FROM AUTHOR]

To solve the problem that the PBFT consensus algorithm can 't support large-scale network with the quadratic communication complexity of 0(n²) in consortium blockchain, this paper proposed an ABFT algorithm. Firstly, it improved the information interaction mode of nodes in PBFT consensus algorithm on multiple phases. On the prepare phase,each replica node sent information and signatured to the master node for verification. On the commit phase, the master node collected and verified the signatures, and combined with BLS signature, it aggregated the multiple verified signatures into an aggregating signature, which would be broadcast to all other replica nodes with other necessary information for verification. Moreover, ABFT algorithm the added the finish phase to prevent most replica nodes from timing out and causing view change. The ABFT algorithm reduced the complexity of network communication to 0(n). Experiments show that in the case of multiple nodes, the ABFT algorithm can effectively reduce the consensus delay and improve the transaction throughput, which makes the consortium blockchain being able to accommodate a large number of nodes [ABSTRACT FROM AUTHOR]