Data lineage technology is a method of describing the relationships between data, which plays a crucial role in solving many challenges in the data marketplace, such as unauthorized data redistribution, data tampering, and false data transactions. However, the complexity of the multi-chain data marketplace, including factors such as data credibility, trust environment, data ownership, and relationship complexity, poses significant challenges to construct data lineages. To effectively address these challenges, we propose a data lineage construction method for multi-chain data marketplaces. This method mainly involves the following three steps: Firstly, map data assets to Data Non-Fungible Token (DataNFT) and use referable NFT (rNFT) to record data lineage. Secondly, when data assets require cross-chain transfer, the transfer message of DataNFT is broadcasted through the interchain NFT protocol, without the need for actual cross-chain transfer. Finally, we add weights to the data lineage link, enabling us to quickly locate problematic data based on weight sorting during data auditing. We have implemented a system prototype of this method and verified its effectiveness through experiments. The experimental results show that our proposed scheme not only ensures the correctness and completeness of data lineages, but also effectively reduces audit costs.

In blockchain-based data marketplaces, the cross-chain solution based on relay chains has become an effective way to support digital asset transfer between heterogeneous blockchains. If a digital asset is popular, it will be frequently transferred between multiple data marketplaces. Digital assets are typically represented as (Non-fungible Tokens) NFTs. However, when utilizing a cross-chain transfer scheme based on a relay chain that involves locking, unlocking and burning of the NFT, it can lead to significant transaction costs. Due to the frequent minting and burning of popular NFTs, they tend to consume a significant amount of gas, resulting in high transaction costs. To address this issue, we propose the DART scheme, a secure and low-cost cross-chain transaction scheme for popular digital assets based on (dynamic NFT) DNFT and relay chain. The scheme mainly includes three aspects: Firstly, the initial owner of (Data NFT) DataNFT locks it onto the gateway contract on SChain, mints a (Cross-chain NFT) CNFT on the relay chain that references the DataNFT for resale, and minted DataNFT on the destination blockchain until the CNFT is no longer being resold. Secondly, the DNFT standard is utilized to implement CNFTs. The DNFT standard records the transaction hash of each CNFT resale, ensuring the secure reselling of DataNFTs. Thirdly, the metadata of DataNFT is encrypted to ensure its security during cross-chain transmission. Finally, we selected Axelar Network as the relay network and successfully implemented a prototype of the system. The experimental results demonstrate the feasibility of our proposed scheme.

Nowadays, data are regarded as an intangible asset. In the data marketplace, data are treated as a commodity or service, data owners can gain economic revenue by selling their data ownership or data usage rights. However, the data marketplace is facing various threats and challenges, such as unauthorized data reselling, trade of bogus data, dishonest data ownership claims, and unreasonable revenue allocation. Particularly, in the process of data resale, the revenue allocation remains a challenge when the data are processed and resold in another format. To solve this problem, we propose a revenue allocation mechanism based on the referable Non-Fungible Token (rNFT) and Shapley value method. Firstly, we tokenize the data to NFT to ensure the data ownership is traceable; Secondly, we use rNFT to record the data lineage that ensures the data owner can participate in the revenue allocation when the data are resold; Finally, we calculate the contribution of each party by the Shapley value method to ensure fairness in revenue allocation. We implement a prototype of our scheme on Ethereum and evaluate it comprehensively. The test results indicate that our scheme can meet the performance requirements of the data marketplace and improve the revenue of data owners effectively.

The blockchain technology in the Internet of Vehicles (IoV) can be applied to solve security problems. Due to the high dynamics and resource constraints of the IoV, the traditional single-chain blockchain system is not suitable for the practical scenarios. In our previous work, we proposed a lightweight blockchain architecture based on the directed acyclic graph lattice (DAG-lattice) structure for the IoV. However, the current consensus algorithms are not suitable for the previous architecture mentioned above. Therefore, this article proposes a parallel consensus mechanism based on the DAG-lattice structure in the IoV using practical Byzantine fault tolerance (PBFT) as consensus algorithm. This mechanism solves the problem of low efficiency of PBFT caused by too many consensus nodes and the mobility of nodes by adopting the method of network sharding, and meanwhile to ensure that transactions can be reached on consensus parallelly. To avoid the selection of primary nodes from being predicted in advance, this article proposes a primary node selection method based on verifiable random function (VRF). Moreover, a method is proposed of selecting transactions based on weighted round robin (WRR) scheduling to motivate nodes for the purpose of maintaining a high reputation score. Finally, the performance of the proposed scheme is verified by experiments whose results show that the proposed consensus mechanism shows better performance than other comparable schemes in terms of the time added to the blockchain, transaction per second (TPS), consensus success rate, and the time of obtaining transaction. And the proposed mechanism is less dependent on roadside unit (RSU).

In recent years, Vehicular Ad Hoc Network (VANET) has developed significantly. Coordination between vehicles can enhance driving safety and improve traffic efficiency. Due to the high dynamic characteristic of VANET, security has become one of the challenging problems. Trust of the message is a key element of security in VANET. This paper proposes a Manhattan Distance Based Trust Management model (MDBTM) in VANET environment which solves the problem in existing trust management research that considers the distance between the sending vehicle and event location. In this model, the Manhattan distance and the number of building obstacles are calculated by considering the movement relationship between the sending vehicle and event location. The Dijkstra algorithm is used to predict the path with the maximum probability, when the vehicle is driving toward the event location. The message scores are then calculated based on the Manhattan distance and the number of building obstacles. Finally, the scores are fused to determine whether to trust the message. The experimental results show that the proposed method has better performance than similar methods in terms of correct decision probability under different proportions of malicious vehicles, different numbers of vehicles, and different reference ranges.

With the development of wireless communication technology and the automobile industry, the Vehicular Ad Hoc Networks bring many conveniences to humans in terms of safety and entertainment. In the process of communication between the nodes, security problems are the main concerns. Blockchain is a decentralized distributed technology used in nonsecure environments. Using blockchain technology in the VANETs can solve the security problems. However, the characteristics of highly dynamic and resource-constrained VANETs make the traditional chain blockchain system not suitable for actual VANETs scenarios. Therefore, this paper proposes a lightweight blockchain architecture using DAG-lattice structure for VANETs, called V-Lattice. In V-Lattice, each node (vehicle or roadside unit) has its own account chain. The transactions they generated can be added to the blockchain asynchronously and parallelly, and resource-constrained vehicles can store the pruned blockchain and execute blockchain related operations normally. At the same time, in order to encourage more nodes to participate in the blockchain, a reputation-based incentive mechanism is introduced in V-Lattice. This paper uses Colored Petri Nets to verify the security of the architecture and verifies the feasibility of PoW anti-spam through experiment. The validation results show that the architecture proposed in this paper is security, and it is feasible to prevent nodes from generating malicious behaviors by using PoW anti-spam.